Nominal SOS
DOI10.1016/j.entcs.2012.08.008zbMath1342.68193OpenAlexW2913295794WikidataQ113318086 ScholiaQ113318086MaRDI QIDQ3178277
Matteo Cimini, Mohamamdreza Mousavi, Murdoch James Gabbay, Michel Reniers
Publication date: 8 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2012.08.008
\(\lambda\)-calculus\(\pi\)-calculusstructural operational semantics (SOS)nominal calculinominal SOS
Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- Bisimulation for higher-order process calculi
- SOS formats and meta-theory: 20 years after
- A congruence rule format for name-passing process calculi
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- A theory of higher order communicating systems
- A structural approach to operational semantics
- Nominal unification
- Nominal logic, a first order theory of names and binding
- A theory of bisimulation for the \(\pi\)-calculus
- Nominal rewriting
- Reasoning in Abella about Structural Operational Semantics Specifications
- Psi-calculi: a framework for mobile processes with nominal data and logic
- Mapping Modular SOS to Rewriting Logic
- Nominal SOS
- A proof theory for generic judgments
This page was built for publication: Nominal SOS