CHOCOLATE: Calculi of Higher Order COmmunication and LAmbda TErms (preliminary report)

Authors:
Bard Bloom
Affiliations:
Cornell University, Ithaca, NY
Venue:
POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Year:
1994

Citing 6
Cited 1

Bisimulation can't be traced

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A calculus of higher order communicating systems

POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CML: A higher concurrent language

PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
A calculus of mobile processes, II

Information and Computation
Expressive Results for Process Algebras

Proceedings of the REX Workshop on Sematics: Foundations and Applications
First-Class Synchronous Operations in Standard ML

First-Class Synchronous Operations in Standard ML

Compiler correctness for parallel languages

FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a general definition of higher-order process calculi, generalizing CHOCS [Tho89] and related calculi, and investigate its basic properties. We give sufficient conditions under which a calculus is finitely-branching and effective. We show that a suitable notion of higher-order bisimulation is a congruence for a subclass of higher-order calculi. We illustrate our definitions with a simple calculus strictly stronger than CHOCS.