scientific article; zbMATH DE number 512786
From MaRDI portal
Publication:4281479
zbMath0788.68051MaRDI QIDQ4281479
Daniel Leivant, Jean-Yves Marion
Publication date: 10 March 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polytime functionscomputational complexity classestyped \(\lambda\)-calculi\(\lambda\)-representabilityword algebra
Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Combinatory logic and lambda calculus (03B40)
Related Items (9)
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ Higher-order interpretations and program complexity ⋮ The role of polymorphism in the characterisation of complexity by soft types ⋮ A Short Introduction to Implicit Computational Complexity ⋮ Parsimonious Types and Non-uniform Computation ⋮ A characterization of functions over the integers computable in polynomial time using discrete ordinary differential equations ⋮ An arithmetic for polynomial-time computation ⋮ Realizability models for a linear dependent PCF ⋮ Functions over free algebras definable in the simply typed lambda calculus
This page was built for publication:
