scientific article
From MaRDI portal
Publication:3322086
zbMath0537.03028MaRDI QIDQ3322086
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Complexity of computation (including implicit computational complexity) (03D15) Combinatory logic and lambda calculus (03B40)
Related Items
A By-Level Analysis of Multiplicative Exponential Linear Logic, Strong normalization from weak normalization in typed \(\lambda\)-calculi, Natural language semantics and computability, Linearity and iterator types for Gödel's system \(\mathcal T\), Decidability of bounded higher-order unification, Herbrand's theorem as higher order recursion, A formal system of reduction paths for parallel reduction, Extracting Herbrand disjunctions by functional interpretation, Complexity Hierarchies beyond Elementary, Perpetual reductions in \(\lambda\)-calculus, Parallel beta reduction is not elementary recursive, A quantitative model for simply typed λ-calculus
