An exact correspondence between a typed pi-calculus and polarised proof-nets
type: Item
instance of: scholarly article
title: An exact correspondence between a typed pi-calculus and polarised proof-nets
zbMATH Open document ID: 1203.68114
author: Kohei Honda
author: Olivier Laurent
published in: Theoretical Computer Science
publication date: 2010-05-27T00:00:00Z
Mathematics Subject Classification ID: 68Q85
Mathematics Subject Classification ID: 03F07
Mathematics Subject Classification ID: 03F52
zbMATH DE Number: 5712824
zbMATH Keywords: pi-calculus
zbMATH Keywords: proof-nets
zbMATH Keywords: processes
zbMATH Keywords: logics
zbMATH Keywords: proofs
zbMATH Keywords: types
zbMATH Keywords: interaction
zbMATH Keywords: concurrency
zbMATH Keywords: linear logic
zbMATH Keywords: polarity
zbMATH Keywords: embedding
zbMATH Keywords: determinism
zbMATH Keywords: non-determinism
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.01.028
OpenAlex ID: W2085264580
cites work: Computational interpretations of linear logic
cites work: Proofs as processes
cites work: Full abstraction for PCF
cites work: A concurrent model for linear logic
cites work: Q2778815
cites work: Q4417854
cites work: Concurrent nets: a study of prefixing in process calculi
cites work: On the \(\pi\)-calculus and linear logic
cites work: Process Algebra
cites work: Computer Science Logic
cites work: Differential interaction nets
cites work: Linear logic
cites work: Locus solum: From the rules of logic to the logic of rules.
cites work: On full abstraction for PCF: I, II and III
cites work: Q3777424
cites work: On reduction-based process semantics
cites work: Strong normalisation in the \(\pi\)-calculus
cites work: Bigraphs and transitions
cites work: Polarized proof-nets and \(\lambda \mu\)-calculus
cites work: Syntax vs. semantics: A polarized approach
cites work: Q5714437
cites work: Q4457461
cites work: CONCUR 2005 – Concurrency Theory
cites work: Q3992568
cites work: Functions as processes
cites work: A calculus of mobile processes. II
cites work: Behavioral equivalence in the polymorphic pi-calculus
cites work: An equivalence between lambda- terms
cites work: πI: A symmetric calculus based on internal mobility
cites work: The name discipline of uniform receptiveness
DOI: 10.1016/J.TCS.2010.01.028
Recommended article: Polarized proof-nets and \(\lambda \mu\)-calculus
Recommended article: Types and full abstraction for polyadic \(\pi\)-calculus
Recommended article: Q4703885
Recommended article: Q4790662
Recommended article: A proof search specification of the \(\pi\)-calculus
Recommended article: A generic type system for the Pi-calculus
Recommended article: \(\pi\)-calculus in (Co)inductive-type theory
Recommended article: Q4650577
Recommended article: A fully abstract denotational semantics for the \(\pi\)-calculus
Recommended article: Q4440827
description: scientific article; zbMATH DE number 5712824