A semantic proof of polytime soundness of light affine logic
type: Item
instance of: scholarly article
title: A semantic proof of polytime soundness of light affine logic
zbMATH Open document ID: 1205.68169
author: Ugo Dal Lago
author: Martin Hofmann
published in: Theory of Computing Systems
publication date: 2010-08-13T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5770221
zbMATH Keywords: implicit computational complexity
zbMATH Keywords: linear logic
zbMATH Keywords: realizability
MaRDI profile type: Publication
full work available at URL: s00224-009-9210-x
OpenAlex ID: W1967535898
cites work: Q4457446
cites work: The lambda calculus. Its syntax and semantics. Rev. ed.
cites work: Higher type recursion, ramification and polynomial time
cites work: Functional interpretations of feasibly constructive arithmetic
cites work: Q2778817
cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
cites work: Phase semantics and decidability of elementary affine logic
cites work: The weak lambda calculus as a reasonable machine
cites work: Light linear logic
cites work: Q3791120
cites work: Safe recursion with higher types and BCK-algebra
cites work: Realizability models for BLL-like languages
cites work: Q5344164
cites work: Soft linear logic and polynomial time
cites work: Q2753690
cites work: Q4945245
cites work: Q4385524
DOI: 10.1007/S00224-009-9210-X
description: scientific article; zbMATH DE number 5770221