Plain CHOCS A second generation calculus for higher order processes

Thomsen, Bent

doi:10.1007/bf01200262

Cited by 111 publications

(66 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since λx. P σ does not mention (linear) session names, we may embed it into a "duplicator" process which implements recursion using higher-order communication [40]. The encoding of the recursion variable X invokes this duplicator in a by-need fashion: it receives λx.…”

Section: Overview: Encoding Name Passing Into Process Passingmentioning

confidence: 99%

See 1 more Smart Citation

On the Relative Expressiveness of Higher-Order Session Processes

Kouzapas

Pérez

Yoshida

2016

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. By integrating constructs from the λ-calculus and the π-calculus, in higher-order process calculi exchanged values may contain processes. This paper studies the relative expressiveness of HOπ, the higher-order π-calculus in which communications are governed by session types. Our main discovery is that HO, a subcalculus of HOπ which lacks name-passing and recursion, can serve as a new core calculus for session-typed higher-order concurrency. By exploring a new bisimulation for HO, we show that HO can encode HOπ fully abstractly (up to typed contextual equivalence) more precisely and efficiently than the first-order session π-calculus (π). Overall, under session types, HOπ, HO, and π are equally expressive; however, HOπ and HO are more tightly related than HOπ and π.

show abstract

Section: Overview: Encoding Name Passing Into Process Passingmentioning

confidence: 99%

“…Building upon [40], the work [42] studies the (non)encodability of the untyped π-calculus into a higher-order π-calculus with a powerful name relabelling operator, which is essential to encode name-passing. The paper [44] defines an encoding of the (untyped) π-calculus without relabeling.…”

Section: Concluding Remarks and Related Workmentioning

confidence: 99%

On the Relative Expressiveness of Higher-Order Session Processes

Kouzapas

Pérez

Yoshida

2016

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…The empty sum represents the process that cannot do anything and is denoted by 0. As in [15,2] Note that 7d ~ does not consider any expression with more than one free variable. Our definition of open extension is, therefore, not the usual one.…”

Section: Introductionmentioning

confidence: 99%

“…However, first-order process calculi are limited in the sense that they assume a fixed interconnection structure between the processes involved. Recently, name-passing and higher-order calculi have been proposed to remedy this obvious deficiency [10,15]. They allow the communication of processes and functions, and thus support a powerful abstraction technique which is similar to the one found in higher-order programming languages and caters for systems with changing interconnection structure.…”

Section: Introductionmentioning

confidence: 99%

“…One of them is Thomsen's Plain CHOCS [15], which features a static treatment of the restriction operator and a bisimulation-based semantics. In [2], Amadio and Dam address the lack of specification formalisms for Plain CHOCS and propose a modal logic which extends Hennessy-Milner logic and characterizes strong context bisimulation (called CHOCS bisimulation in [2]).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modal characterization of weak bisimulation for higher-order processes

Baldamus

Dingel

1997

TAPSOFT '97: Theory and Practice of Software Development

View full text Add to dashboard Cite

Context bisimulation [12,1] has become an important notion of behavioural equivalence for higher-order processes. Weak forms of context bisimulation are particularly interesting, because of theh" high level of abstraction. We present a modal logic for this setting and provide a characterization of a variant of weak context bisimulation on second-order processes. We show how the logic permits compositional reasoning. In comparison to previous work by Amadio and Dam [2] on the strong case, our modal logic supports derived operators through a complete duality and thus constitutes an appealing extension of Hennessy-Milner logic.

show abstract

Bisimulation for Higher-Order Process Calculi

Sangiorgi¹

1996

Information and Computation

125

165

View full text Add to dashboard Cite

A higher-order process calculus is a calculus for communicating systems which contains higher-order constructs like communication of terms. We analyse the notion of bisimulation in these calculi. We argue that both the standard de nition of bisimulation (i.e., the one for CCS and related calculi), as well as higher-order bisimulation AGR88, Bou89, Tho90] are in general unsatisfactory, because of their overdiscrimination. We propose and study a new form of bisimulation for such calculi, called context bisimulation, which yields a more satisfactory discriminanting power. A drawback of context bisimulation is the heavy use of universal quanti cation in its de nition, which is hard to handle in practice. To resolve this di culty we introduce triggered bisimulation and normal bisimulation, and we prove that they both coincide with context bisimulation. In the proof, we exploit the factorisation theorem: When comparing the behaviour of two processes, it allows us to \isolate" subcomponents which might give di erences, so that the analysis can be concentrated on them.

show abstract

Plain CHOCS A second generation calculus for higher order processes

Cited by 111 publications

References 12 publications

On the Relative Expressiveness of Higher-Order Session Processes

On the Relative Expressiveness of Higher-Order Session Processes

Modal characterization of weak bisimulation for higher-order processes

Bisimulation for Higher-Order Process Calculi

Contact Info

Product

Resources

About