Structural rewriting in the pi-calculus
From MaRDI portal
Recommendations
Cites work
- A calculus of mobile processes. II
- A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations
- A hierarchy of equivalences for asynchronous calculi
- A new natural structural congruence in the pi-calculus with replication
- Algorithms for extended alpha-equivalence and complexity
- An exercise in structural congruence
- Call-by-name, call-by-value and the \(\lambda\)-calculus
- Certification of Termination Proofs Using CeTA
- Conservative concurrency in Haskell
- Correctness of an STM Haskell implementation
- Correctness of program transformations as a termination problem
- Divergence and fair testing
- Fair testing
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- Logic for Programming, Artificial Intelligence, and Reasoning
- Observational semantics for a concurrent lambda calculus with reference cells and futures
- The -calculus: A theory of mobile processes
Cited in
(11)- A new natural structural congruence in the pi-calculus with replication
- A structural transformation from p- to MSVL
- From active names to -calculus rewriting rules
- iRho: an imperative rewriting calculus
- scientific article; zbMATH DE number 522837 (Why is no real title available?)
- scientific article; zbMATH DE number 2163040 (Why is no real title available?)
- Observing success in the pi-calculus
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
- Graph rewriting for the π-calculus
- Term graph rewriting for the \(\pi \)-calculus.
- Structural inclusion in the pi-calculus with replication
This page was built for publication: Structural rewriting in the pi-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5240137)
