Observed Communication Semantics for Classical Processes

Reference. Observed Communication Semantics for Classical Processes

Cite

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

BibTeX

bibtex · 1 line

@inbook{atkey-2017-observed, title={Observed Communication Semantics for Classical Processes}, ISBN={9783662544341}, ISSN={1611-3349}, url={http://dx.doi.org/10.1007/978-3-662-54434-1_3}, DOI={10.1007/978-3-662-54434-1_3}, booktitle={Programming Languages and Systems}, publisher={Springer Berlin Heidelberg}, author={Atkey, Robert}, year={2017}, pages={56–82} }

hayagriva YAML (typst)

yaml · 15 lines

atkey-2017-observed:
  type: chapter
  title: Observed Communication Semantics for Classical Processes
  author: Atkey, Robert
  date: 2017
  page-range: 56-82
  url: http://dx.doi.org/10.1007/978-3-662-54434-1_3
  serial-number:
    doi: 10.1007/978-3-662-54434-1_3
    isbn: '9783662544341'
    issn: 1611-3349
  parent:
    type: book
    title: Programming Languages and Systems
    publisher: Springer Berlin Heidelberg

Download: atkey-2017-observed.bib · atkey-2017-observed.yml

Cites 36 works (5 here)

With notes (5)

Conflation Confers Concurrency atkey-2016-conflationA List of Successes That Can Change the World · 2016

DOI

I Got Plenty o’ Nuttin’ mcbride-2016-iA List of Successes That Can Change the World · 2016

DOI

Dependent session types via intuitionistic linear type theory toninho-2011-dependentPPDP · 2011

DOI

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 (31)

Talking bananas: structural recursion for session types (2016)
The true concurrency of differential interaction nets (2016)
Certifying data in multiparty session types (2016)
A semantics for propositions as sessions (2015)
Linear logical relations and observational equivalences for session-based concurrency (2014)
Propositions as sessions (JFP journal version) (2014)
Weighted Relational Models of Typed Lambda-Calculi (2013)
Linear logic and strong normalization (2013)
Least and Greatest Fixed Points in Linear Logic (2012)
Propositions as sessions (2012)
Probabilistic coherence spaces as a model of higher-order probabilistic computation (2011)
Interpreting a finitary pi-calculus in differential interaction nets (2010)
Linear type theory for asynchronous session types (2010)
Categorical semantics of linear logic (2009)
Finiteness spaces (2005)
Genericity and the pi-calculus (2003)
Introduction to Lattices and Order (2002)
The Pi-Calculus: A Theory of Mobile Processes (2001)
The Theory and Practice of Concurrency (1998)
Pomset logic: a non-commutative extension of classical linear logic (1997)
A fully abstract domain model for the pi-calculus (1996)
On the π-calculus and linear logic (1994)
Linear logic, totality and full completeness (1994)
Computational interpretations of linear logic (1993)
Types for dyadic interaction (1993)
Proofs as processes (1992)
Barbed bisimulation (1992)
*-Autonomous categories and linear logic (1991)
The formulae-as-types notion of construction (1980)
LCF considered as a programming language (1977)
Functionality in Combinatory Logic (1934)