Weak typed Böhm theorem on IMLL
type: Item
instance of: scholarly article
title: Weak typed Böhm theorem on IMLL
zbMATH Open document ID: 1110.03056
author: Satoshi Matsuoka
published in: Annals of Pure and Applied Logic
publication date: 2007-02-14T00:00:00Z
Mathematics Subject Classification ID: 03F52
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 18D15
zbMATH DE Number: 5126398
zbMATH Keywords: linear logic
zbMATH Keywords: separation
zbMATH Keywords: proof nets
zbMATH Keywords: graph isomorphisms
MaRDI profile type: Publication
full work available at URL: j.apal.2006.06.001
OpenAlex ID: W1615262499
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: The structure of multiplicatives
cites work: Q4842980
cites work: The maximality of the typed lambda calculus and of cartesian closed categories
cites work: The Typed Böhm Theorem
cites work: Linear logic
cites work: Q4896506
cites work: Q4650583
cites work: Exhausting strategies, joker games and full completeness for IMLL with unit
cites work: Q3922646
cites work: Completeness, invariance and λ-definability
cites work: λ-definable functionals andβη conversion
cites work: Obsessional experiments for linear logic proof-nets
DOI: 10.1016/J.APAL.2006.06.001
description: scientific article; zbMATH DE number 5126398