From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
type: Item
instance of: scholarly article
title: From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing
zbMATH Open document ID: 1215.03070
DOI: 10.1007/978-3-540-73228-0_2
author: Patrick Baillot
published in: Lecture Notes in Computer Science
publication date: 2009-03-10T00:00:00Z
Mathematics Subject Classification ID: 03F52
zbMATH DE Number: 5527367
describes a project that uses: LaGO
MaRDI profile type: Publication
full work available at URL: 978-3-540-73228-0 2
OpenAlex ID: W1581033375
Recommended article: Proof nets and the linear substitution calculus
Recommended article: Polynomial-time Martin-Löf type theory
Recommended article: Proofs as computations in linear logic
Recommended article: Polynomial time in untyped elementary linear logic
Recommended article: Linear logic and polynomial time
Recommended article: Proof-search and proof nets in mixed linear logic
Recommended article: Proof nets for multiplicative cyclic linear logic and Lambek calculus
Recommended article: Q4993336
Recommended article: Bounded linear logic: A modular approach to polynomial-time computability
Recommended article: Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
description: scientific article