On session types and polynomial time

DOI10.1017/S0960129514000632zbMath1362.68208MaRDI QIDQ2971079

Paolo Di Giamberardino, Ugo Dal Lago

Publication date: 4 April 2017

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (4)

Sound approximate and asymptotic probabilistic bisimulations for PCTL ⋮ Types for complexity of parallel computation in pi-calculus ⋮ Causal computational complexity of distributed processes ⋮ Implicit computation complexity in higher-order programming languages

Cites Work

• Linear logic
• Quantum implicit computational complexity
• A simple proof of a theorem of Statman
• The typed lambda-calculus is not elementary recursive
• Soft linear logic and polynomial time
• Proof-Carrying Code in a Session-Typed Process Calculus
• Session Types as Intuitionistic Linear Propositions
• Two Session Typing Systems for Higher-Order Mobile Processes
• Behavioral Polymorphism and Parametricity in Session-Based Communication

This page was built for publication: On session types and polynomial time