Publication:4281479
From MaRDI portal
zbMath0788.68051MaRDI QIDQ4281479
Daniel Leivant, Jean-Yves Marion
Publication date: 10 March 1994
polytime functions; computational complexity classes; typed \(\lambda\)-calculi; \(\lambda\)-representability; word algebra
03D15: Complexity of computation (including implicit computational complexity)
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
03B40: Combinatory logic and lambda calculus
Related Items
Higher-order interpretations and program complexity, The role of polymorphism in the characterisation of complexity by soft types, Functions over free algebras definable in the simply typed lambda calculus, Realizability models for a linear dependent PCF, An arithmetic for polynomial-time computation, A Short Introduction to Implicit Computational Complexity, Parsimonious Types and Non-uniform Computation