2011 · 81 citations · 23 references
ComputingComputer ScienceContractsFormal MethodsProgramming LanguagesAbstract InterpretationDeductive VerificationModel TheoryProof AssistantsType CheckingType SystemsDependent TypesIntuitionistic Type TheoryLinear Type SystemsLinear TypesProof IrrelevanceSession TypesType PreservationType Theory
We develop an interpretation of linear type theory as dependent session types for a term passing extension of the pi-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.
23
George C. Necula · 1997 · 1.8K citations
Thierry Coquand, Gérard Huet · Information and Computation · 1988 · 1.1K citations · Full text
Mobile values, new names, and secure communication
Martı́n Abadi, Cédric Fournet · 2001 · 843 citations
Robin Milner · Mathematical Structures in Computer Science · 1992 · 530 citations · Full text