Dependent session types via intuitionistic linear type theory

Authors:
Bernardo Toninho;Luís Caires;Frank Pfenning
Affiliations:
Carnegie Mellon University & Faculdade de Ciencias e Tecnologia, Pittsburgh, PA, USA;Universidade Nova de Lisboa, Lisbon, Portugal;Carnegie Mellon University, Pittsburgh, PA, USA
Venue:
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
Year:
2011

Citing 27
Cited 7

Implementing mathematics with the Nuprl proof development system

Implementing mathematics with the Nuprl proof development system
The calculus of constructions

Information and Computation - Semantics of Data Types
A framework for defining logics

Journal of the ACM (JACM)
Computational interpretations of linear logic

Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
On the &pgr;-calculus and linear logic

MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Linearity and the pi-calculus

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Eliminating array bound checking through dependent types

PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Mobile values, new names, and secure communication

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A generic type system for the Pi-calculus

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes

PI-Calculus: A Theory of Mobile Processes
Language Primitives and Type Discipline for Structured Communication-Based Programming

ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Types for Dynamic Interaction

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
A linear logical framework

Information and Computation
Intensionality, Extensionality, and Proof Irrelevance in Modal Type Theory

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Correspondence assertions for process synchronization in concurrent communications

Journal of Functional Programming
Propositions as [Types]

Journal of Logic and Computation
Subtyping for session types in the pi calculus

Acta Informatica
Language support for fast and reliable message-based communication in singularity OS

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
A Concurrent Model for Linear Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Logical semantics of types for concurrency

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
An exact correspondence between a typed pi-calculus and polarised proof-nets

Theoretical Computer Science
A theory of design-by-contract for distributed multiparty interactions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Session types as intuitionistic linear propositions

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
A linear account of session types in the pi calculus

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Conversation types

Theoretical Computer Science
A linear logic of authorization and knowledge

ESORICS'06 Proceedings of the 11th European conference on Research in Computer Security

Towards concurrent type theory

TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Proof-Carrying code in a session-typed process calculus

CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Linear logical relations for session-based concurrency

ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Functions as session-typed processes

FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
Fundamentals of session types

Information and Computation
Behavioral polymorphism and parametricity in session-based communication

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Higher-Order processes, functions, and sessions: a monadic integration

ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.