Algorithmically Expressive, Always-Terminating Model for Reversible Computation
Pages 31 - 49
Abstract
Concerning classical computational models able to express all the Primitive Recursive Functions (PRF), there are interesting results regarding limits on their algorithmic expressiveness, meant as the possibility to naturally express algorithms with minimal computational cost. By introducing the reversible computational model , to our knowledge, we provide a first study of analogous properties, adapted to the context of reversible computational models that can represent all the functions in PRF. Firstly, we show that extends Matos’ linear reversible computational model M-SRL, the very extension being a guaranteed terminating iteration that can be halted by means of logical predicates. The consequence is that is PRF-complete, because M-SRL is. Secondly, we show that is strictly algorithmically more expressive than M-SRL: it can encode a reversible algorithm for the minimum between two integers in optimal time, while M-SRL cannot.
References
[1]
Andary P, Patrou B, and Valarcher P A representation theorem for primitive recursive algorithms Fundam. Inform. 2011 107 313-330
[2]
Colson L A unary representation result for system T Ann. Math. Artif. Intell. 1996 16 385-403
[3]
Colson L and Fredholm D System T, call-by-value and the minimum problem Theor. Comput. Sci. 1998 206 301-315
[4]
Dijkstra, E.W.: Go to statement considered harmful. In: Apt, K.R., Hoare, T. (eds.) Edsger Wybe Dijkstra: His Life, Work, and Legacy. ACM Books, vol. 45, pp. 315–318. ACM/Morgan & Claypool (2022)
[5]
Glück R and Yokoyama T A minimalist’s reversible while language IEICE Trans. Inf. Syst. 2017 100 5 1026-1034
[6]
Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. Oxford University Press (1993)
[7]
Lutz, C.: Janus: a time-reversible language. Letter to R. Landauer (1986)
[8]
Maletto G and Roversi L Mezzina CA and Podlaski K Certifying algorithms and relevant properties of reversible primitive permutations with lean Reversible Computation 2022 Cham Springer 111-127
[9]
Maletto G and Roversi L Certifying expressive power and algorithms of reversible primitive permutations with lean J. Log. Algebraic Methods Program. 2024 136 100923
[10]
Matos AB Linear programs in a simple reversible language Theor. Comput. Sci. 2003 290 3 2063-2074
[11]
Matos AB The efficiency of primitive recursive functions: a programmer’s view Theoret. Comput. Sci. 2015 594 65-81
[12]
Matos AB, Paolini L, and Roversi L Lanese I and Rawski M On the expressivity of total reversible programming languages Reversible Computation 2020 Cham Springer 128-143
[13]
Meyer, A.R., Ritchie, D.M.: The complexity of loop programs. In: Proceedings of the 1967 22nd National Conference, ACM 1967, pp. 465–469. Association for Computing Machinery, New York (1967)
[14]
Normann, L., Glück, R.: Partial evaluation of reversible flowchart programs. In: PEPM, pp. 119–133. ACM (2024)
[15]
Paolini L, Piccolo M, and Roversi L A class of recursive permutations which is primitive recursive complete Theor. Comput. Sci. 2020 813 218-233
[16]
Reholt JW, Glück R, and Kruse M Kutrib M and Meyer U Towards a dereversibilizer: fewer asserts, statically Reversible Computation 2023 Cham Springer 106-114
[17]
Yokoyama T, Axelsen HB, and Glück R Fundamentals of reversible flowchart languages Theor. Comput. Sci. 2016 611 87-115
Recommendations
On Reversible Combinatory Logic
The @l-calculus is destructive: its main computational mechanism - beta reduction - destroys the redex and makes it thus impossible to replay the computational steps. Recently, reversible computational models have been studied mainly in the context of ...
Terminating Calculi and Countermodels for Constructive Modal Logics
Automated Reasoning with Analytic Tableaux and Related MethodsAbstractWe investigate terminating sequent calculi for constructive modal logics and in the style of Dyckhoff’s calculi for intuitionistic logic. We first present strictly terminating calculi for these logics. Our calculi provide immediately a ...
Toward a Curry-Howard Equivalence for Linear, Reversible Computation: Work-in-Progress
Reversible ComputationAbstractIn this paper, we present a linear and reversible language with inductive and coinductive types, together with a Curry-Howard correspondence with the logic [inline-graphic not available: see fulltext] : linear logic extended with least and greatest ...
Comments
Information & Contributors
Information
Published In
Jul 2024
248 pages
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 04 July 2024
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 14 Jan 2025