On session types and polynomial time

DOI10.1017/S0960129514000632MaRDI QIDQ2971079zbMATH OpenFDO

Authors Ugo Dal Lago, Paolo Di Giamberardino

Publication date 4 April 2017

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

Full work available at URL https://doi.org/10.1017/S0960129514000632

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7319032
• Bounded polymorphism in session types
• scientific article; zbMATH DE number 6816946
• Fundamentals of session types
• Session types as intuitionistic linear propositions

Cites work

• A simple proof of a theorem of Statman
• Behavioral polymorphism and parametricity in session-based communication
• Linear logic
• Proof-carrying code in a session-typed process calculus
• Quantum implicit computational complexity
• Session types as intuitionistic linear propositions
• Soft linear logic and polynomial time
• The typed lambda-calculus is not elementary recursive
• Two Session Typing Systems for Higher-Order Mobile Processes

Cited in

(5)

• Causal computational complexity of distributed processes
• Types for complexity of parallel computation in pi-calculus
• The impact of time on the session problem
• Implicit computation complexity in higher-order programming languages
• Sound approximate and asymptotic probabilistic bisimulations for PCTL

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2971079)