Reversibility in the higher-order -calculus
From MaRDI portal
Publication:264996
DOI10.1016/J.TCS.2016.02.019zbMATH Open1338.68078OpenAlexW2284037492MaRDI QIDQ264996FDOQ264996
Authors: Ivan Lanese, Claudio Antares Mezzina, Jean-Bernard Stefani 
Publication date: 1 April 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.02.019
Recommendations
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A fully abstract semantics for causality in the \(\pi\)-calculus
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Non-interleaving semantics for mobile processes
- Proving nondeterministically specified safety properties using progress measures
- Reversible, irreversible and optimal \(\lambda\)-machines
- Forward and backward simulations. I. Untimed Systems
- Forward and backward simulations. II: Timing-based systems
- A structural approach to reversible computation
- Reversing algebraic process calculi
- Reversibility and asymmetric conflict in event structures
- General reversibility
- Event structure semantics of parallel extrusion in the pi-calculus
- Towards a reversible functional language
- Information effects
- The M-calculus: a higher-order distributed process calculus
- Controlling Reversibility in Higher-Order Pi
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Compositional Event Structure Semantics for the Internal π-Calculus
- Reversing Higher-Order Pi
- Normal Bisimulations in Calculi with Passivation
- Irreversibility and Heat Generation in the Computing Process
- A formal approach to undo operations in programming languages
- Functions as processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Reverse Execution of Java Bytecode
- Title not available (Why is that?)
- From λ to π; or, Rediscovering continuations
- Title not available (Why is that?)
- A logic with reverse modalities for history-preserving bisimulations
- Reverse bisimulations on stable configuration structures
- A compositional semantics for the reversible \(\pi\)-calculus
- CONCUR 2004 - Concurrency Theory
- Mathematics of Program Construction
- Concurrent flexible reversibility
- Title not available (Why is that?)
- Logical Reversibility of Computation
- Generic Forward and Backward Simulations
- CONCUR 2005 – Concurrency Theory
- Models for name-passing processes: Interleaving and causal
- Bisimulation for higher-order process calculi
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Reversible computing and cellular automata -- a survey
- Typed event structures and the linear \(\pi \)-calculus
Cited In (42)
- Concurrencies in reversible concurrent calculi
- Event structures for the reversible early internal \(\pi\)-calculus
- An axiomatic approach to reversible computation
- Implementation of a reversible distributed calculus
- Towards a taxonomy for reversible computation approaches
- revTPL: The Reversible Temporal Process Language
- The correctness of concurrencies in (reversible) concurrent calculi
- Title not available (Why is that?)
- Rigid families for the reversible \(\pi \)-calculus
- Static versus dynamic reversibility in CCS
- Reversibility in session-based concurrency: a fresh look
- A stable non-interleaving early operational semantics for the pi-calculus
- A stable non-interleaving early operational semantics for the pi-calculus
- A parametric framework for reversible \(\pi\)-calculi
- A compositional semantics for the reversible \(\pi\)-calculus
- Title not available (Why is that?)
- Reversible session-based pi-calculus
- Reversibility of Triple I Method Based on Łukasiewicz and Goguen Implication
- A theory of reversibility for Erlang
- Relative expressiveness of calculi for reversible concurrency
- Title not available (Why is that?)
- Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
- Reversible debugging of concurrent Erlang programs: supporting imperative primitives
- Reversibility in Erlang: imperative constructs
- Title not available (Why is that?)
- Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures
- A small-step semantics for Janus
- Model checking reversible systems: forwardly
- Reversibility with holes (work in progress)
- A collective interpretation semantics for reversing Petri nets
- Contextual equivalences in configuration structures and reversibility
- Controlling Reversibility in Higher-Order Pi
- Encodability and separation for a reflective higher-order calculus
- Token multiplicity in reversing Petri nets under the individual token interpretation
- An axiomatic theory for reversible computation
- Forward-reverse observational equivalences in CCSK
- A Petri net view of covalent bonds
- The reversible temporal process language
- Relating reversible Petri nets and reversible event structures, categorically
- Causal-consistent rollback in a tuple-based language
- Type theory based semantic verification for service composition in cloud computing environments
- Causal reversibility implies time reversibility
Uses Software
This page was built for publication: Reversibility in the higher-order \(\pi\)-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264996)
