A Uniform Reduction Equivalence for Process Calculi
No abstract available.
Related papers
- Instant Polymorphic Type Systems for Mobile Process Calculi: Just Add Reduction Rules and Close ESOP 2005
- A compositional theory for STM Haskell Haskell 2009
- A General Fine-Grained Reduction Theory for Effect Handlers ICFP 2023
- A unified approach to fully lazy sharing POPL 2012
- Control reduction theories: the benefit of structural substitution JFP 2008
- Fast Approximations of Quantifier Elimination CAV 2023
- Small-step and big-step semantics for call-by-need JFP 2009
- An approach to call-by-name delimited continuations POPL 2008