On an interpretation of safe recursion in light affine logic
type: Item
instance of: scholarly article
title: On an interpretation of safe recursion in light affine logic
zbMATH Open document ID: 1048.03049
author: Yanyan Li
published in: Theoretical Computer Science
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 03F52
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03D20
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 2083410
zbMATH Keywords: Computational complexity
zbMATH Keywords: Light affine logic
zbMATH Keywords: Polynomial-time computability
MaRDI profile type: Publication
OpenAlex ID: W2076030590
cites work: Q4936120
cites work: A new recursion-theoretic characterization of the polytime functions
cites work: Light linear logic
cites work: Linear types and non-size-increasing polynomial time computation.
cites work: Q4499227
cites work: Q4945245
DOI: 10.1016/J.TCS.2003.10.017
description: scientific article; zbMATH DE number 2083410