Type inference for light affine logic via constraints on words

DOI10.1016/j.tcs.2004.08.014zbMath1071.03018OpenAlexW2155879600MaRDI QIDQ703485

Patrick Baillot

Publication date: 11 January 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2004.08.014

zbMATH Keywords

ConstraintsLinear logicImplicit computational complexityLambda-calculusLight affine logicPolynomial time complexityType inference

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Related Items (3)

Controlling Program Extraction in Light Logics ⋮ Polynomial time over the reals with parsimony ⋮ Light types for polynomial time computation in lambda calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear logic
• Light affine lambda calculus and polynomial time strong normalization
• Light linear logic
• Typability and type checking in System F are equivalent and undecidable
• Phase semantics for light linear logic
• Linear logic and elementary time
• Higher type recursion, ramification and polynomial time
• Safe recursion with higher types and BCK-algebra
• Stratified coherence spaces: A denotational semantics for light linear logic
• Soft linear logic and polynomial time
• Light affine set theory: A naive set theory of polynomial time
• Intuitionistic Light Affine Logic

This page was built for publication: Type inference for light affine logic via constraints on words