The role of polymorphism in the characterisation of complexity by soft types
DOI10.1016/J.IC.2015.12.011zbMATH Open1339.68098OpenAlexW2230975172MaRDI QIDQ276263FDOQ276263
Aleksy Schubert, Jacek Chrząszcz
Publication date: 3 May 2016
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2015.12.011
Recommendations
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)
Cites Work
- Lectures on the Curry-Howard isomorphism
- The undecidability of the semi-unification problem
- The typed lambda-calculus is not elementary recursive
- Light linear logic
- Typability and type checking in System F are equivalent and undecidable
- Soft linear logic and polynomial time
- Title not available (Why is that?)
- Soft linear logic and polynomial complexity classes
- The Role of Polymorphism in the Characterisation of Complexity by Soft Types
- A logical account of pspace
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Soft Type Assignment System for λ-Calculus
- Type Inference for a Polynomial Lambda Calculus
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Verification of Ptime Reducibility for system F Terms: Type Inference in Dual Light Affine Logic
- On light logics, uniform encodings and polynomial time
- Theoretical Computer Science
- Theoretical Computer Science
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 Q276263)
