Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus

DOI10.1007/978-3-662-43951-7_26zbMath1433.03039OpenAlexW312307718MaRDI QIDQ5167847

Damiano Mazza

Publication date: 1 July 2014

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43951-7_26

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Parsimonious Types and Non-uniform Computation ⋮ Infinitary affine proofs ⋮ Implicit computation complexity in higher-order programming languages

This page was built for publication: Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus