Polynomial Time in the Parametric Lambda Calculus.

DOI10.4230/LIPICS.TLCA.2015.288zbMath1367.68054OpenAlexW2295950492MaRDI QIDQ5277846

Brian F. Redmond

Publication date: 12 July 2017

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5170/

zbMATH Keywords

nondeterminismcombinatorsimplicit computational complexitypolynomial-time complexityexplicit productsparametric lambda-calculus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functional programming and lambda calculus (68N18) Proof-theoretic aspects of linear logic and other substructural logics (03F52) Combinatory logic and lambda calculus (03B40)

Related Items (1)

Implicit computation complexity in higher-order programming languages

This page was built for publication: Polynomial Time in the Parametric Lambda Calculus.