Plain CHOCS. A second generation calculus for higher order processes
type: Item
instance of: scholarly article
title: Plain CHOCS. A second generation calculus for higher order processes
zbMATH Open document ID: 0790.68069
DOI: 10.1007/BF01200262
author: B. Thomsen
published in: Acta Informatica
publication date: 1993-01-01T00:00:00Z
review text: We present a calculus of communicating systems which allows one to express sending and receiving processes. We call this calculus Plain CHOCS. The calculus is a refinement of our earlier work on the calculus of higher order communicating systems (CHOCS). Essential to the new calculus is the treatment of restriction as a static binding operator on port names. The new calculus is given an operational semantics using labelled transition systems which combines ideas from the applicative transition systems described by Abramsky and the transition systems used for CHOCS. The new calculus enjoys algebraic properties which are similar to those of CHOCS only needing obvious extra laws for the static nature of the restriction operator. Processes as first class objects enable description of networks with changing interconnection structure, and there is a close connection between the Plain CHOCS calculus and the \(\pi\)-calculus described by Milner, Parrow and Walker: the two calculi can simulate one another. Recently object oriented programming has grown into a major discipline in computational practice as well as in computer science. From a theoretical point of view object oriented programming presents a challenge to any metalanguage since most object oriented languages have no formal semantics. We show how Plain CHOCS may be used to give a semantics to a protoype object oriented language called \(O\).
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68N15
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 567322
zbMATH Keywords: semantics of object oriented language
zbMATH Keywords: calculus of communicating systems
zbMATH Keywords: operational semantics
zbMATH Keywords: labelled transition systems
zbMATH Keywords: object oriented programming
describes a project that uses: POOL
describes a project that uses: Facile
describes a project that uses: Simula 67
MaRDI profile type: Publication
cites work: A domain equation for bisimulation
cites work: Q4721640
cites work: Q4038734
cites work: Q3667910
cites work: A calculus of communicating systems
cites work: Calculi for synchrony and asynchrony
cites work: Q3992568
cites work: A lattice-theoretical fixpoint theorem and its applications
full work available at URL: https://doi.org/10.1007/bf01200262
OpenAlex ID: W1998827035
description: scientific article; zbMATH DE number 567322