A formal approach to undo operations in programming languages
From MaRDI portal
Publication:3721785
DOI10.1145/5001.5005zbMATH Open0592.68015OpenAlexW1987371135WikidataQ60305009 ScholiaQ60305009MaRDI QIDQ3721785FDOQ3721785
Authors: George B. jun. Leeman
Publication date: 1986
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/toplas/1986-8/
Recommendations
checkpointprogramming languagesrecoverylanguage constructspreprocessorsreverse executionUndo facility
Cited In (10)
- Bridging Causal Reversibility and Time Reversibility: A Stochastic Process Algebraic Approach
- Reversibility in the higher-order \(\pi\)-calculus
- Reversible computing from a programming language perspective
- Towards a Theory of Forward Error Recovery
- Title not available (Why is that?)
- Fundamentals of reversible flowchart languages
- Controlling Reversibility in Higher-Order Pi
- Causal-consistent rollback in a tuple-based language
- Running programs backwards: The logical inversion of imperative computation
- Undoing the effects of action sequences
This page was built for publication: A formal approach to undo operations in programming languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721785)