A typed calculus of synchronous processes
Steven Gay, Rajagopal Nagarajan
Abstract
Steven Gay, Rajagopal Nagarajan
Abstract
Proposes a typed calculus of synchronous processes based on the structure of interaction categories. Our aim has been to develop a calculus for concurrency that is canonical in the sense that the typed /spl lambda/-calculus is canonical for functional computation. We show strong connections between syntax, logic and semantics, analogous to the familiar correspondence between the typed /spl lambda/-calculus, intuitionistic logic and Cartesian closed categories.
OpenAlex reports 9 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Proposes a typed calculus of synchronous processes based on the structure of interaction categories. Our aim has been to develop a calculus for concurrency that is canonical in the sense that the typed /spl lambda/-calculus is canonical for functional computation. We show strong connections between syntax, logic and semantics, analogous to the familiar correspondence between the typed /spl lambda/-calculus, intuitionistic logic and Cartesian closed categories.
Key concepts: Typed lambda calculus, Church encoding, Lambda calculus, Dependent type, Cartesian closed category, Concurrency, Calculus (dental), System F