Plain CHOCS. A second generation calculus for higher order processes

DOI10.1007/BF01200262zbMath0790.68069MaRDI QIDQ1323361

Bent Thomsen

Publication date: 1993

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

zbMATH Keywords

operational semantics; object oriented programming; labelled transition systems; calculus of communicating systems; semantics of object oriented language

Mathematics Subject Classification ID

68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)

68N15: Theory of programming languages

68Q55: Semantics in the theory of computing

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

Related Items

Equivalence Checking for a Finite Higher Order π-Calculus, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Recursive equations in higher-order process calculi, From CML to its process algebra, Full abstractness for a functional/concurrent language with higher-order value-passing, Reaction graph, Process calculus based upon evaluation to committed form, Non-interleaving semantics for mobile processes, Bisimulation congruence of \(\chi\)-calculus, On modelling mobility, 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, Tau laws for pi calculus, A formal semantics for DAI language NUML, Variations on mobile processes, The name discipline of uniform receptiveness, Notions of bisimulation and congruence formats for SOS with data, A CPS encoding of name-passing in higher-order mobile embedded resources, The seal calculus, \(\pi\)-calculus with noisy channels, Normal Bisimulations in Calculi with Passivation

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