RPO, Second-Order Contexts, and λ-Calculus
From MaRDI portal
Publication:5458369
DOI10.1007/978-3-540-78499-9_24zbMath1139.68040arXiv0906.2727MaRDI QIDQ5458369
Marina Lenisa, Furio Honsell, Pietro Di Gianantonio
Publication date: 11 April 2008
Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.2727
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
18A30: Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.)
03B40: Combinatory logic and lambda calculus
Related Items
RPO, Second-Order Contexts, and λ-Calculus, Reactive systems, (semi-)saturated semantics and coalgebras on presheaves, Variable Binding, Symmetric Monoidal Closed Theories, and Bigraphs, Finitely Branching Labelled Transition Systems from Reaction Semantics for Process Calculi, Reactive Systems, Barbed Semantics, and the Mobile Ambients
Cites Work
- Full abstraction in the lazy lambda calculus
- Local Bigraphs and Confluence: Two Conjectures
- Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts
- Process Bisimulation Via a Graphical Encoding
- RPO, Second-Order Contexts, and λ-Calculus
- Algebra and Coalgebra in Computer Science
- Processes, Terms and Cycles: Steps on the Road to Infinity
- From rewrite rules to bisimulation congruences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item