Full abstractness for a functional/concurrent language with higher-order value-passing

DOI10.1006/inco.1998.2723zbMath0912.68114OpenAlexW1998378110MaRDI QIDQ1271466

Chrysafis Hartonas, Matthew C. B. Hennessy

Publication date: 10 November 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1998.2723

zbMATH Keywords

\(\lambda\)-calculuscall-by-value

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (2)

2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 ⋮ A Fully Abstract Model for Mobile Ambients

Uses Software

• Facile

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modal logics for communicating systems
• Bisimulation for higher-order process calculi
• Notions of computation and monads
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Proof systems for satisfiability in Hennessy-Milner logic with recursion
• A proof-theoretic characterization of observational equivalence
• Duality for modal \(\mu\)-logics
• Domain theory in logical form
• A calculus of mobile processes. I
• Lambda-calculi for (strict) parallel functions
• Plain CHOCS. A second generation calculus for higher order processes
• A fully abstract denotational model for higher-order processes
• A domain equation for bisimulation
• A theory of weak bisimulation for core CML
• A filter lambda model and the completeness of type assignment
• Towards a semantic theory of CML
• A Powerdomain Construction
• A filter model for mobile processes

This page was built for publication: Full abstractness for a functional/concurrent language with higher-order value-passing