Light affine logic as a programming language: a first contribution

DOI10.1142/S0129054100000077MaRDI QIDQ5249032zbMATH OpenFDO

Authors Luca Roversi

Publication date 29 April 2015

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054100000077

zbMATH Keywords

automatic type inferencefunctional programming languageslight affine logicP-TIME computations

Mathematics Subject Classification ID

Logic in computer science (03B70) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Theory of programming languages (68N15) Functional programming and lambda calculus (68N18)

Recommendations

• A polytime functional language from light linear logic
• scientific article; zbMATH DE number 1302629
• Theoretical Computer Science
• Type inference for light affine logic via constraints on words
• Intuitionistic light affine logic

Cited in

(7)

• Algorithmically broad languages for polynomial time and space
• Controlling Program Extraction in Light Logics
• A polytime functional language from light linear logic
• scientific article; zbMATH DE number 1302629 (Why is no real title available?)
• Intuitionistic light affine logic
• Theoretical Computer Science
• Light affine lambda calculus and polynomial time strong normalization

This page was built for publication: Light affine logic as a programming language: a first contribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5249032)