Reversibility in the higher-order -calculus
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 1953282 (Why is no real title available?)
- scientific article; zbMATH DE number 1754652 (Why is no real title available?)
- scientific article; zbMATH DE number 2090726 (Why is no real title available?)
- scientific article; zbMATH DE number 3305030 (Why is no real title available?)
- A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway
- A compositional semantics for the reversible \(\pi\)-calculus
- A formal approach to undo operations in programming languages
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A logic with reverse modalities for history-preserving bisimulations
- A structural approach to reversible computation
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Bisimulation for higher-order process calculi
- CONCUR 2004 - Concurrency Theory
- CONCUR 2005 – Concurrency Theory
- Compositional Event Structure Semantics for the Internal π-Calculus
- Concurrent flexible reversibility
- Controlling Reversibility in Higher-Order Pi
- Event structure semantics of parallel extrusion in the pi-calculus
- Forward and backward simulations. I. Untimed Systems
- Forward and backward simulations. II: Timing-based systems
- From λ to π; or, Rediscovering continuations
- Functions as processes
- General reversibility
- Generic Forward and Backward Simulations
- Information effects
- Irreversibility and Heat Generation in the Computing Process
- Logical Reversibility of Computation
- Mathematics of Program Construction
- Models for name-passing processes: Interleaving and causal
- Non-interleaving semantics for mobile processes
- Normal Bisimulations in Calculi with Passivation
- Proving nondeterministically specified safety properties using progress measures
- Reverse Execution of Java Bytecode
- Reverse bisimulations on stable configuration structures
- Reversibility and asymmetric conflict in event structures
- Reversible Flowchart Languages and the Structured Reversible Program Theorem
- Reversible computing and cellular automata -- a survey
- Reversible, irreversible and optimal \(\lambda\)-machines
- Reversing Higher-Order Pi
- Reversing algebraic process calculi
- The M-calculus: a higher-order distributed process calculus
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Towards a reversible functional language
- Typed event structures and the linear \(\pi \)-calculus
Cited in
(42)- 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
- Reversible session-based pi-calculus
- Type theory based semantic verification for service composition in cloud computing environments
- The reversible temporal process language
- A collective interpretation semantics for reversing Petri nets
- A parametric framework for reversible \(\pi\)-calculi
- Encodability and separation for a reflective higher-order calculus
- Token multiplicity in reversing Petri nets under the individual token interpretation
- Rigid families for the reversible \(\pi \)-calculus
- An axiomatic theory for reversible computation
- Concurrencies in reversible concurrent calculi
- Causal reversibility implies time reversibility
- Reversibility in Erlang: imperative constructs
- scientific article; zbMATH DE number 7471661 (Why is no real title available?)
- Forward-reverse observational equivalences in CCSK
- Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures
- A Petri net view of covalent bonds
- Contextual equivalences in configuration structures and reversibility
- Controlling Reversibility in Higher-Order Pi
- Static versus dynamic reversibility in CCS
- scientific article; zbMATH DE number 7269252 (Why is no real title available?)
- Relating reversible Petri nets and reversible event structures, categorically
- Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
- Reversible debugging of concurrent Erlang programs: supporting imperative primitives
- A small-step semantics for Janus
- Model checking reversible systems: forwardly
- Reversibility with holes (work in progress)
- Event structures for the reversible early internal \(\pi\)-calculus
- Reversibility in session-based concurrency: a fresh look
- Causal-consistent rollback in a tuple-based language
- scientific article; zbMATH DE number 7447776 (Why is no real title available?)
- An axiomatic approach to reversible computation
- Reversibility of Triple I Method Based on Łukasiewicz and Goguen Implication
- A compositional semantics for the reversible \(\pi\)-calculus
- A stable non-interleaving early operational semantics for the pi-calculus
- Relative expressiveness of calculi for reversible concurrency
- A theory of reversibility for Erlang
- A stable non-interleaving early operational semantics for the pi-calculus
- scientific article; zbMATH DE number 7559489 (Why is no real title available?)
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)
