Linear realizability and full completeness for typed lambda-calculi
type: Item
instance of: scholarly article
title: Linear realizability and full completeness for typed lambda-calculi
zbMATH Open document ID: 1064.03012
author: Samson Abramsky
author: Marina Lenisa
published in: Annals of Pure and Applied Logic
publication date: 2005-06-23T00:00:00Z
Mathematics Subject Classification ID: 03B40
Mathematics Subject Classification ID: 03F52
zbMATH DE Number: 2181951
zbMATH Keywords: Typed lambda-calculi
zbMATH Keywords: ML-polymorphic types
zbMATH Keywords: Linear logic
zbMATH Keywords: Hyperdoctrines
zbMATH Keywords: PER models
zbMATH Keywords: Geometry of Interaction
zbMATH Keywords: (Axiomatic) Full completeness
MaRDI profile type: Publication
full work available at URL: j.apal.2004.08.003
OpenAlex ID: W1983399101
Wikidata QID: Q57006682
cites work: Retracing some paths in process algebra
cites work: Q4513619
cites work: New foundations for the geometry of interaction
cites work: Games and full completeness for multiplicative linear logic
cites work: Full abstraction for PCF
cites work: Q4536349
cites work: Q2753670
cites work: Q4783324
cites work: Geometry of Interaction and linear combinatory algebras
cites work: Q3999603
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Q3024825
cites work: Extensional models for polymorphism
cites work: Categories for Types
cites work: Q4263866
cites work: Q3824307
cites work: On full abstraction for PCF: I, II and III
cites work: Algebraic types in PER models
cites work: Traced monoidal categories
cites work: Q4945241
cites work: Q5642701
cites work: Equational theories for inductive types
cites work: Decidability of all minimal models
cites work: Q3786612
cites work: Q3478387
cites work: Completeness, invariance and λ-definability
cites work: λ-definable functionals andβη conversion
DOI: 10.1016/J.APAL.2004.08.003
DBLP publication ID: journals/apal/AbramskyL05
description: scientific article; zbMATH DE number 2181951