License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.TLCA.2015.288
URN: urn:nbn:de:0030-drops-51705
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5170/
Redmond, Brian F.
Polynomial Time in the Parametric Lambda Calculus
Abstract
In this paper we investigate Implicit Computational Complexity via the parametric lambda calculus of Ronchi Della Rocca and Paolini. We show that a particular instantiation of the set of input values leads to a characterization of polynomial time computations in a similar way to Lafont’s Soft Linear Logic. This characterization is manifestly type-free and does not require any ad hoc extensions to the pure lambda calculus. Moreover, there is a natural extension to nondeterminism with the addition of explicit products.
BibTeX - Entry
@InProceedings{redmond:LIPIcs:2015:5170,
author = {Brian F. Redmond},
title = {{Polynomial Time in the Parametric Lambda Calculus}},
booktitle = {13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015)},
pages = {288--301},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-87-3},
ISSN = {1868-8969},
year = {2015},
volume = {38},
editor = {Thorsten Altenkirch},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5170},
URN = {urn:nbn:de:0030-drops-51705},
doi = {10.4230/LIPIcs.TLCA.2015.288},
annote = {Keywords: Parametric Lambda Calculus, Polynomial Time Complexity, Combinators, Nondeterminism and Explicit Products, Implicit Computational Complexity}
}
Keywords: |
|
Parametric Lambda Calculus, Polynomial Time Complexity, Combinators, Nondeterminism and Explicit Products, Implicit Computational Complexity |
Collection: |
|
13th International Conference on Typed Lambda Calculi and Applications (TLCA 2015) |
Issue Date: |
|
2015 |
Date of publication: |
|
15.06.2015 |