A fully abstract denotational semantics for the calculus of higher-order communicating systems
From MaRDI portal
Publication:5940933
DOI10.1016/S0304-3975(00)00281-4zbMath0974.68109OpenAlexW1984590062WikidataQ57006725 ScholiaQ57006725MaRDI QIDQ5940933
No author found.
Publication date: 20 August 2001
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00281-4
denotational semanticsfully abstracthigher-order communicating systemsprocesses as first class objects
Related Items (5)
A Graphical Foundation for Schedules ⋮ \(\pi\)-calculus, internal mobility, and agent-passing calculi ⋮ From CML to its process algebra ⋮ A calculus of mobile processes. I ⋮ Recursive equations in higher-order process calculi
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Modal logics for communicating systems
- Observation equivalence as a testing equivalence
- The lambda calculus. Its syntax and semantics. Rev. ed.
- Calculi for synchrony and asynchrony
- A calculus of communicating systems
- Domain theory in logical form
- A calculus of mobile processes. II
- Plain CHOCS. A second generation calculus for higher order processes
- A fully abstract denotational model for higher-order processes
- Proofs as processes
- A theory of higher order communicating systems
- On full abstraction for PCF: I, II and III
- Full abstraction for PCF
- A domain equation for bisimulation
- A lattice-theoretical fixpoint theorem and its applications
- Algebraic laws for nondeterminism and concurrency
- A term model for synchronous processes
- A Powerdomain Construction
- Concurrent Processes and Their Syntax
- Higher-order processes and their models
- From π-calculus to higher-order π-calculus — and back
This page was built for publication: A fully abstract denotational semantics for the calculus of higher-order communicating systems
