Theoretical Computer Science

DOI10.1007/B13810zbMATH Open1257.03089OpenAlexW3144329707MaRDI QIDQ5897362FDOQ5897362

Authors: Ugo Dal Lago 

Publication date: 23 February 2010

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

Full work available at URL: https://doi.org/10.1007/b13810

Recommendations

• Light affine logic as a programming language: a first contribution
• Intuitionistic light affine logic
• Light logics and higher-order processes
• Light logics and higher-order processes
• A semantic proof of polytime soundness of light affine logic
• A Semantic Proof of Polytime Soundness of Light Affine Logic
• Light logics and optimal reduction: completeness and complexity
• On light logics, uniform encodings and polynomial time
• Type inference for light affine logic via constraints on words
• On an interpretation of safe recursion in light affine logic

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Proof-theoretic aspects of linear logic and other substructural logics (03F52)

Cited In (11)

• Title not available (Why is that?)
• The role of polymorphism in the characterisation of complexity by soft types
• A semantic proof of polytime soundness of light affine logic
• On light logics, uniform encodings and polynomial time
• Light logics and higher-order processes
• Typing a core binary-field arithmetic in a light logic
• On an interpretation of safe recursion in light affine logic
• Algebras and coalgebras in the light affine lambda calculus
• Intuitionistic light affine logic
• A Semantic Proof of Polytime Soundness of Light Affine Logic
• Light affine logic as a programming language: a first contribution

This page was built for publication: Theoretical Computer Science

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