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

Bard Bloom
1994 Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94  
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 finitelybranching 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 sample calculus strictly stronger than CHOCS.
doi:10.1145/174675.177948 dblp:conf/popl/Bloom94 fatcat:q5terr76rzeb3earvqtvfxxvvy