Theoretical Computer Science
Proofs and types
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
A calculus of mobile processes, I
Information and Computation
ACL—a concurrent linear logic programming paradigm
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
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
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interaction categories and the foundations of typed concurrent programming
Proceedings of the NATO Advanced Study Institute on Deductive program design
Behavioral equivalence in the polymorphic pi-calculus
Journal of the ACM (JACM)
Pict: a programming language based on the Pi-Calculus
Proof, language, and interaction
Language Primitives and Type Discipline for Structured Communication-Based Programming
ESOP '98 Proceedings of the 7th European Symposium on Programming: Programming Languages and Systems
Higher-Order Concurrent Linear Logic Programming
TPPP '94 Proceedings of the International Workshop on Theory and Practice of Parallel Programming
An Interaction-based Language and its Typing System
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
The pi-Calculus as a Theory in Linear Logic: Preliminary Results
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Linear Logic, Monads and the Lambda Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On asynchrony in name-passing calculi
Mathematical Structures in Computer Science
Acta Informatica
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
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear type theory for asynchronous session types
Journal of Functional Programming
Lolliproc: to concurrency from classical linear logic via curry-howard and control
Proceedings of the 15th ACM SIGPLAN international conference on Functional programming
Session types as intuitionistic linear propositions
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Towards concurrent type theory
TLDI '12 Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation
Structural recursion with locally scoped names
Journal of Functional Programming
On the degeneracy of Σ-types in presence of computational classical logic
TLCA'05 Proceedings of the 7th international conference on Typed Lambda Calculi and Applications
Proof-Carrying code in a session-typed process calculus
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Functions as session-typed processes
FOSSACS'12 Proceedings of the 15th international conference on Foundations of Software Science and Computational Structures
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
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of classical linear logic correspond to session types. Continuing a line of work by Honda (1993), by Honda, Kubo, and Vasconcelos (1998), and by Gay and Vasconcelos (2010), among others, this paper presents GV, a linear functional language with session types, and presents a translation from GV into CP. The translation formalises for the first time a connection between a standard presentation of session types and linear logic, and shows how a modification to the standard presentation yield a language free from deadlock, where deadlock freedom follows from the correspondence to linear logic.