Date of Original Version

6-2011

Type

Conference Proceeding

Rights Management

© ACM, YYYY. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published at http://doi.acm.org/10.1145/2003476.2003499

Abstract or Description

We develop an interpretation of linear type theory as dependent session types for a term passing extension of the π-calculus. The type system allows us to express rich constraints on sessions, such as interface contracts and proof-carrying certification, which go beyond existing session type systems, and are here justified on purely logical grounds. We can further refine our interpretation using proof irrelevance to eliminate communication overhead for proofs between trusted parties. Our technical results include type preservation and global progress, which in our setting naturally imply compliance to all properties declared in interface contracts expressed by dependent types.

DOI

10.1145/2003476.2003499

Share

COinS
 

Published In

Proceedings of ACM SIGPLAN Symposium on Principles and Practices of Declarative Programming (PPDP), 2011, 161-172.