Polarized Substructural Session Types

DOI10.1007/978-3-662-46678-0_1zbMath1459.68042OpenAlexW776882319MaRDI QIDQ2948548

Dennis Griffith, Frank Pfenning

Publication date: 1 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2142/90544

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) 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) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (18)

Back to futures ⋮ Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less) ⋮ Fairness and communication-based semantics for session-typed languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nested session types ⋮ A linear/producer/consumer model of classical linear logic ⋮ Unnamed Item ⋮ A message-passing interpretation of adjoint logic ⋮ Session-typed concurrent contracts ⋮ Session Types with Arithmetic Refinements ⋮ Polymorphic lambda calculus with context-free session types ⋮ Gradual type theory ⋮ Two decades of automatic amortized resource analysis ⋮ Prioritise the best variation

This page was built for publication: Polarized Substructural Session Types