Proof-Carrying Code in a Session-Typed Process Calculus

Abstract. Dependent session types allow us to describe not only properties of the I/O behavior of processes but also of the exchanged data. In this paper we show how to exploit dependent session types to express proof-carrying communication. We further introduce two modal operators into the type theory to provide detailed control about how much information is communicated: one based on traditional proof irrelevance and one integrating digital signatures.

• Type: Journal
• Year: 2011
• Where: CPP
• Authors: Frank Pfenning, Luís Caires, Bernardo Toninho
• Keywords: CPP 2011, Digital Signatures, Modal Operators, Session Types