The role of polymorphism in the characterisation of complexity by soft types

DOI10.1007/978-3-642-22993-0_22MaRDI QIDQ3088041zbMATH OpenOpenAlexFDO

Authors Jacek Chrząszcz, Aleksy Schubert

Publication date 17 August 2011

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

Full work available at URL https://doi.org/10.1007/978-3-642-22993-0_22

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Complexity of computation (including implicit computational complexity) (03D15)

Recommendations

• The role of polymorphism in the characterisation of complexity by soft types
• Type Inference for a Polynomial Lambda Calculus
• A Soft Type Assignment System for λ-Calculus
• Soft linear logic and polynomial complexity classes
• ML with PTIME complexity guarantees

Cited in

(3)

• ML with PTIME complexity guarantees
• The role of polymorphism in the characterisation of complexity by soft types
• Type Inference for a Polynomial Lambda Calculus

This page was built for publication: The role of polymorphism in the characterisation of complexity by soft types

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