Plain CHOCS. A second generation calculus for higher order processes

DOI10.1007/BF01200262zbMath0790.68069OpenAlexW1998827035MaRDI QIDQ1323361

Bent Thomsen

Publication date: 1993

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01200262

zbMATH Keywords

operational semanticsobject oriented programminglabelled transition systemscalculus of communicating systemssemantics of object oriented language

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (51)

Characteristic bisimulation for higher-order session processes ⋮ Tau laws for pi calculus ⋮ From a concurrent λ-calculus to the π-calculus ⋮ A formal semantics for DAI language NUML ⋮ Howe’s Method for Calculi with Passivation ⋮ The name discipline of uniform receptiveness (extended abstract) ⋮ A proof theoretical approach to communication ⋮ HOCore in Coq ⋮ Graph-grammar semantics of a higher-order programming language for distributed systems ⋮ Fairness and communication-based semantics for session-typed languages ⋮ Reasoning about higher-order processes ⋮ Distinguishing and relating higher-order and first-order processes by expressiveness ⋮ Bisimulation congruence of \(\chi\)-calculus ⋮ On transformations of concurrent object programs ⋮ Theory of interaction ⋮ Parameterizing higher-order processes on names and processes ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ Unnamed Item ⋮ Variations on mobile processes ⋮ The name discipline of uniform receptiveness ⋮ Unnamed Item ⋮ Characterizing contextual equivalence in calculi with passivation ⋮ From CML to its process algebra ⋮ Process specification and verification ⋮ Process calculus based upon evaluation to committed form ⋮ Decidable Fragments of a Higher Order Calculus with Locations ⋮ Higher-order psi-calculi ⋮ Notions of bisimulation and congruence formats for SOS with data ⋮ A fully abstract denotational semantics for the calculus of higher-order communicating systems ⋮ A CPS encoding of name-passing in higher-order mobile embedded resources ⋮ On the relative expressiveness of higher-order session processes ⋮ On the interactive power of higher-order processes extended with parameterization ⋮ Recursive equations in higher-order process calculi ⋮ On the Relative Expressiveness of Higher-Order Session Processes ⋮ Normal Bisimulations in Calculi with Passivation ⋮ Equivalence Checking for a Finite Higher Order π-Calculus ⋮ On parameterization of higher-order processes ⋮ Full abstractness for a functional/concurrent language with higher-order value-passing ⋮ The λ-calculus in the π-calculus ⋮ Reaction graph ⋮ Process calculus based upon evaluation to committed form ⋮ Non-interleaving semantics for mobile processes ⋮ On modelling mobility ⋮ The Value-Passing Calculus ⋮ The seal calculus ⋮ \(\pi\)-calculus with noisy channels ⋮ Names of the \(\pi\)-calculus agents handled locally ⋮ Asynchronous process calculi: The first- and higher-order paradigms ⋮ Tile formats for located and mobile systems. ⋮ Decoding choice encodings ⋮ Language-based performance prediction for distributed and mobile systems

Uses Software

• POOL
• Facile
• Simula 67

Cites Work

• Calculi for synchrony and asynchrony
• A calculus of communicating systems
• A domain equation for bisimulation
• A lattice-theoretical fixpoint theorem and its applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Plain CHOCS. A second generation calculus for higher order processes