Light types for polynomial time computation in lambda-calculus
arXiv:cs/0402059
Abstract
We propose a new type system for lambda-calculus ensuring that well-typed programs can be executed in polynomial time: Dual light affine logic (DLAL). DLAL has a simple type language with a linear and an intuitionistic type arrow, and one modality. It corresponds to a fragment of Light affine logic (LAL). We show that contrarily to LAL, DLAL ensures good properties on lambda-terms: subject reduction is satisfied and a well-typed term admits a polynomial bound on the reduction by any strategy. We establish that as LAL, DLAL allows to represent all polytime functions. Finally we give a type inference procedure for propositional DLAL.
20 pages (including 10 pages of appendix). (revised version; in particular section 5 has been modified). A short version is to appear in the proceedings of the conference LICS 2004 (IEEE Computer Society Press)
References in corpus (1)
Cited by in corpus (9)
- Linear Logic by Levels and Bounded Time Complexity
- Verification of Ptime Reducibility for system F Terms: Type Inference in<br> Dual Light Affine Logic
- Light Logics and the Call-by-Value Lambda Calculus
- Polygraphic programs and polynomial-time functions
- A tier-based typed programming language characterizing Feasible Functionals
- Weak Affine Light Typing: Polytime intensional expressivity, soundness and completeness
- An extended and more practical mwp flow analysis
- A type system for PSPACE derived from light linear logic
- Verification of Ptime reducibility for system F terms via Dual Light Affine Logic