Higher-order processes and their models

DOI10.1007/3-540-58201-0_76zbMath1418.68143OpenAlexW143756819MaRDI QIDQ4632434

Matthew C. B. Hennessy

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_76

zbMATH Keywords

operational semanticsprocess algebradenotational semanticsprogram logicsyntactic category

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (3)

A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ Recursive equations in higher-order process calculi ⋮ A Fully Abstract Model for Mobile Ambients

Uses Software

• Facile

Cites Work

• Domain theory in logical form
• LCF considered as a programming language
• A fully abstract denotational model for higher-order processes
• A filter lambda model and the completeness of type assignment
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Higher-order processes and their models