Principles of a reversible programming language

Yokoyama, T.; Axelsen, Holger Bock; Glück, Robert

doi:10.1145/1366230.1366239

Cited by 103 publications

(83 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…can be used to model many reversible language constructs [35], and is useful when designing reversible circuits [30,32]. One of the authors found this generalization to be of significant practical use in the translation from high-level to low-level reversible languages [2], as it directly suggests a possible translation strategy for reversible assignment updates.…”

Section: Computable Operator Injective In Its First Argument and Letmentioning

confidence: 99%

“…In the following, we shall make heavy use of program inversion, so the direct coupling between the mechanical and semantical transformation is significant. The possibility to perform program inversion locally is also key to the implementation of reversible programming languages [35][36][37] and reversible microprocessors [6,32] because it allows on-the-fly program inversion.…”

Section: Then T −1 Is An Rtm That Computes the Inverse Function Of [[mentioning

confidence: 99%

“…Edges with the symbolic variables α, β encode for multiple different transitions, with α ∈ {b, 0, 1}, β ∈ {0, 1, B, S, M, #} simulation (i.e., if we came from step 1), and (by definition) must be different thereafter (i.e., if we came from step 3). This corresponds exactly the use of entry assertions in loops in reversible imperative programming [35]. Figure 7 shows a high-level state diagram of the program: nodes are states, and edges are the actions of the associated rules.…”

Section: Lemma 17 (Program Inversion By Encoding Reversal) Let T Be Amentioning

confidence: 99%

“…Reversible computation models have been studied in widely different areas ranging from cellular automata [24] and pushdown automata [7,18], program transformation concerned with the inversion of programs [29], reversible programming languages [6,35,37] and their translation [2], the view-update problem in bidirectional computing and model transformation [12,27], static prediction of program properties [28], digital circuit design [33,34], to quantum computing [11]. However, between all these cases, the definition and use of reversibility varies significantly (and subtly), making it difficult to apply results learned in one area to others.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

On reversible Turing machines and their function universality

Axelsen

Glück

2016

Acta Informatica

Self Cite

View full text Add to dashboard Cite

We provide a treatment of the reversible Turing machines (RTMs) under a strict function semantics. Unlike many existing reversible computation models, we distinguish strictly between computing the function λx. f (x) and computing the function λx. (x, f (x)), or other injective embeddings of f . We reinterpret and adapt a number of important foundational reversible computing results under this semantics. Unifying the results in a single model shows that, as expected (and previously claimed), the RTMs are robust and can compute exactly all injective computable functions. Because injectivity entails that the RTMs are not strictly Turing-complete w.r.t. functions, we use an appropriate alternative universality definition, and show how to derive universal RTMs (URTMs) from existing irreversible universal machines. We then proceed to construct a URTM from the ground up. This resulting machine is the first URTM which does not depend on a reversible simulation of an existing universal machine. The new construction has the advantage that the interpretive overhead of the URTM is limited to a (program dependent) constant factor. Another novelty is that the URTM can function as an inverse interpreter at no asymptotic cost. Mathematics Subject Classification 68Q05 · 68Q10 · 03D10Revised and extended version of the conference papers [4,5].

show abstract

Section: Computable Operator Injective In Its First Argument and Letmentioning

confidence: 99%

Section: Then T −1 Is An Rtm That Computes the Inverse Function Of [[mentioning

confidence: 99%

Section: Lemma 17 (Program Inversion By Encoding Reversal) Let T Be Amentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On reversible Turing machines and their function universality

Axelsen

Glück

2016

Acta Informatica

Self Cite

View full text Add to dashboard Cite

show abstract

“…These include work on the Janus language whose origin dates back to the early 1980s [51,52], work on sequential flow charts [53], the Inv [54], RFUN [55], and Π [56] reversible functional languages. The key aspect of Janus is that all its constructs, including assignments, are made bijective (and hence reversible), and the language does not allow I/O.…”

Section: Related Workmentioning

confidence: 99%

Reversibility in the higher-order π-calculus

Lanese

Mezzina

Stefani

2016

Theoretical Computer Science

View full text Add to dashboard Cite

This is a PDF file of an unedited manuscript that has been accepted for publication. As a service to our customers we are providing this early version of the manuscript. The manuscript will undergo copyediting, typesetting, and review of the resulting proof before it is published in its final form. Please note that during the production process errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal pertain. Reversibility in the higher-order π-calculus AbstractThe notion of reversible computation is attracting increasing interest because of its applications in diverse fields, in particular the study of programming abstractions for reliable systems. In this paper, we continue the study undertaken by Danos and Krivine on reversible CCS by defining a reversible higher-order π-calculus, called rhoπ. We prove that reversibility in our calculus is causally consistent and that the causal information used to support reversibility in rhoπ is consistent with the one used in the causal semantics of the π-calculus developed by Boreale and Sangiorgi. Finally, we show that one can faithfully encode rhoπ into a variant of higher-order π, substantially improving on the result we obtained in the conference version of this paper.

show abstract

References

2010

Reversible Computing

View full text Add to dashboard Cite

Principles of a reversible programming language

Cited by 103 publications

References 20 publications

On reversible Turing machines and their function universality

On reversible Turing machines and their function universality

Reversibility in the higher-order π-calculus

References

Contact Info

Product

Resources

About