Linear is CP (more or less)
DOI10.1007/978-3-319-30936-1_15zbMATH Open1343.68062OpenAlexW2488953214MaRDI QIDQ3188293FDOQ3188293
Authors: 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
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70)
Cites Work
- Lolliproc
- Functions as processes
- Title not available (Why is that?)
- Linear logic
- Resource modalities in tensor logic
- Control categories and duality: On the categorical semantics of the lambda-mu calculus
- A new constructive logic: classic logic
- Propositions as sessions
- Session types as intuitionistic linear propositions
- Linear type theory for asynchronous session types
- The duality of computation
- On the unity of duality
- A concurrent model for linear logic
- Linear logical relations and observational equivalences for session-based concurrency
- Propositions as sessions
- Title not available (Why is that?)
- Polarized proof-nets and \(\lambda \mu\)-calculus
- Focalisation and Classical Realisability
- On the \(\pi\)-calculus and linear logic
- Call-by-value is dual to call-by-name
- Term Rewriting and Applications
- Polarized Substructural Session Types
- A Semantics for Propositions as Sessions
Cited In (1)
Uses Software
This page was built for publication: Linear \(\lambda \mu\) is CP (more or less)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3188293)
