Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less)

DOI10.1007/978-3-319-30936-1_15zbMath1343.68062OpenAlexW2488953214MaRDI QIDQ3188293

Jennifer Paykin, Steve Zdancewic

Publication date: 17 August 2016

Published in: A List of Successes That Can Change the World (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30936-1_15

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40)

Uses Software

• Lolliproc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logical relations and observational equivalences for session-based concurrency
• Linear logic
• Resource modalities in tensor logic
• On the \(\pi\)-calculus and linear logic
• Polarized proof-nets and \(\lambda \mu\)-calculus
• On the unity of duality
• Control categories and duality: on the categorical semantics of the lambda-mu calculus
• A Semantics for Propositions as Sessions
• Propositions as sessions
• The duality of computation
• Polarized Substructural Session Types
• Session Types as Intuitionistic Linear Propositions
• Focalisation and Classical Realisability
• A new constructive logic: classic logic
• Functions as processes
• Propositions as sessions
• Lolliproc
• Linear type theory for asynchronous session types
• Call-by-value is dual to call-by-name
• Term Rewriting and Applications

This page was built for publication: Linear $$ \lambda \mu $$ is $$ \textsc {CP} $$ (more or less)