A Typed Calculus of Synchronous Processes

Authors:
Simon Gay;Rajagopal Nagarajan
Affiliations:
-;-
Venue:
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Year:
1995

Citing 0
Cited 4

Composing processes

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linearity and the pi-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Linearity and the pi-calculus

ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning About Concurrent Systems Using Types

FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose 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 lambda-calculus is canonical for functional computation. We show strong connections between syntax, logic and semantics, analogous to the familiar correspondence between the typed lambda- calculus, intuitionistic logic and cartesian closed categories.