Context-Free Session Types for Applied Pi-Calculus
@article{Aagaard2018ContextFreeST, title={Context-Free Session Types for Applied Pi-Calculus}, author={Jens Aagaard and Hans H{\"u}ttel and Mathias Jakobsen and Mikkel Kettunen}, journal={CoRR}, year={2018}, volume={abs/1808.08648}, pages={3-18} }
We present a binary session type system using context-free session types to a version of the applied pi-calculus of Abadi et. al. where only base terms, constants and channels can be sent. Session types resemble process terms from BPA and we use a version of bisimulation equivalence to characterize type equivalence. We present a quotiented type system defined on type equivalence classes for which type equivalence is built into the type system. Both type systems satisfy general soundness… CONTINUE READING
References
SHOWING 1-10 OF 12 REFERENCES
Process theory based on bisimulation semantics
- Computer Science, Mathematics
- REX Workshop
- 1988
- 93
- Highly Influential
- PDF
Communicating and mobile systems - the Pi-calculus
- Mathematics, Computer Science
- 1999
- 2,491
- Highly Influential
- PDF
Sessions, from Types to Programming Languages
- Mathematics, Computer Science
- Bull. EATCS
- 2011
- 16
- Highly Influential
- PDF
Language Primitives and Type Discipline for Structured Communication-Based Programming
- Computer Science, Mathematics
- ESOP
- 1998
- 811
- PDF
A Fast Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
- Mathematics, Computer Science
- CONCUR
- 1994
- 17
Psi-calculi: a framework for mobile processes with nominal data and logic
- Computer Science
- Log. Methods Comput. Sci.
- 2011
- 80
- PDF