A polymorphic language which is typable and poly-step

DOI10.1007/3-540-49366-2_4MaRDI QIDQ4249177zbMATH OpenFDO

Authors Luca Roversi

Publication date 12 January 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-49366-2_4

zbMATH Keywords

automatic typabilitycut-elimination complexityfunctional languageIntuitionistic Light Affine Logicnormal formpolymorphismprototype of programming language for P-TIME algorithms

Mathematics Subject Classification ID

Logic in computer science (03B70) Cut-elimination and normal-form theorems (03F05) Functional programming and lambda calculus (68N18)

Recommendations

• Light affine logic as a programming language: a first contribution
• A polytime functional language from light linear logic
• Light types for polynomial time computation in lambda calculus
• Light affine lambda calculus and polynomial time strong normalization
• scientific article; zbMATH DE number 445159

Cited in

(4)

• Stratified coherence spaces: A denotational semantics for light linear logic
• Algorithmically broad languages for polynomial time and space
• A polytime functional language from light linear logic
• Light affine logic as a programming language: a first contribution

This page was built for publication: A polymorphic language which is typable and poly-step

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