Abstract
The paper investigates a concurrent computation model, chi calculus, in which communications resemble cut eliminations for classical proofs. The algebraic properties of the model are studied. Its relationship to sequential computation is illustrated by showing that it incorporates the operational semantics of the call-by-name lambda calculus. Practically the model has pi calculus as a submodel.
Cite
CITATION STYLE
Fu, Y. (1997). A proof theoretical approach to communication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 325–335). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_189
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
