A fully abstract denotational model for higher-order processes

DOI10.1006/inco.1994.1052zbMath0806.68071OpenAlexW2111841006MaRDI QIDQ1327390

Matthew C. B. Hennessy

Publication date: 22 January 1995

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

Full work available at URL: http://hdl.handle.net/2262/24944

zbMATH Keywords

higher-order process calculuslazy \(\lambda\)-calculusAbramsky's model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55)

Related Items (17)

Prime algebraicity ⋮ Reasoning about higher-order processes ⋮ A semantic theory for value-passing processes based on the late approach ⋮ A fully abstract model for the \(\pi\)-calculus. ⋮ Domain theory for concurrency ⋮ Higher-order processes and their models ⋮ \(\pi\)-calculus, internal mobility, and agent-passing calculi ⋮ Filter models for conjunctive-disjunctive \(\lambda\)-calculi ⋮ First–order Semantics for Higher–order Processes ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ Recursive equations in higher-order process calculi ⋮ 2008 European Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '08 ⋮ Full abstractness for a functional/concurrent language with higher-order value-passing ⋮ A conservative look at operational semantics with variable binding ⋮ A Fully Abstract Model for Mobile Ambients ⋮ Discrimination by parallel observers: the algorithm. ⋮ A proof-theoretic characterization of observational equivalence

This page was built for publication: A fully abstract denotational model for higher-order processes