Conflation Confers Concurrency

Reference. Conflation Confers Concurrency

Robert Atkey, Sam Lindley, J. Garrett Morris · A List of Successes That Can Change the World · 2016 · DOI

Cite

Cite as @atkey-2016-conflation (helia, typst) · \cite{atkey-2016-conflation} (LaTeX)

BibTeX

bibtex · 1 line

@inbook{atkey-2016-conflation, title={Conflation Confers Concurrency}, ISBN={9783319309361}, ISSN={1611-3349}, url={http://dx.doi.org/10.1007/978-3-319-30936-1_2}, DOI={10.1007/978-3-319-30936-1_2}, booktitle={A List of Successes That Can Change the World}, publisher={Springer International Publishing}, author={Atkey, Robert and Lindley, Sam and Morris, J. Garrett}, year={2016}, pages={32–55} }

hayagriva YAML (typst)

yaml · 18 lines

atkey-2016-conflation:
  type: chapter
  title: Conflation Confers Concurrency
  author:
  - Atkey, Robert
  - Lindley, Sam
  - Morris, J. Garrett
  date: 2016
  page-range: 32-55
  url: http://dx.doi.org/10.1007/978-3-319-30936-1_2
  serial-number:
    doi: 10.1007/978-3-319-30936-1_2
    isbn: '9783319309361'
    issn: 1611-3349
  parent:
    type: book
    title: A List of Successes That Can Change the World
    publisher: Springer International Publishing

Download: atkey-2016-conflation.bib · atkey-2016-conflation.yml

Cited by (1)

Observed Communication Semantics for Classical Processes atkey-2017-observedESOP · 2017

PDF · DOI · pldb

Cites 28 works (2 here)

With notes (2)

Session Types as Intuitionistic Linear Propositions caires-2010-sessionCONCUR · 2010

DOI

Linear logic girard_linear_1987TCS · 1987

The familiar connective of negation is broken into two operations: linear negation which is the purely negative part of negation and the modality “of course” which has the meaning of a reaffirmation. Following this basic discovery, a completely new approach to the whole area between constructive logics and programmation is initiated.

DOI

External (26)

The true concurrency of differential interaction nets (2016)
Propositions as types (2015)
A Semantics for Propositions as Sessions (2015)
Comparing Deadlock-Free Session Typed Processes (2015)
Deadlock analysis of unbounded process networks (2014)
Propositions as sessions (2014)
Deadlock and lock freedom in the linear pi-calculus (2014)
Interpreting a finitary pi-calculus in differential interaction nets (2010)
An exact correspondence between a typed pi-calculus and polarised proof-nets (2010)
Finite products are biproducts in a compact closed category (2008)
Differential structure in models of multiplicative biadditive intuitionistic linear logic (2007)
A new type system for deadlock-free processes (2006)
Java Generics and Collections (2006)
Control in the pi-calculus (2004)
Language primitives and type discipline for structured communication-based programming (1998)
Interaction Categories and the Foundations of Typed Concurrent Programming (1996)
Linearity and the pi-calculus (1996)
On the π-calculus and linear logic (1994)
An interaction-based language and its typing system (1994)
Types for dyadic interaction (1993)
Proofs as processes (1992)
An Introduction to Functional Programming (1988)
The formulae-as-types notion of construction (1980)
Infinitely long terms of transfinite type (1965)
The Mechanical Evaluation of Expressions (1964)
Functionality in Combinatory Logic (1934)