scientific article; zbMATH DE number 1948174
From MaRDI portal
Publication:4411835
zbMath1020.03511MaRDI QIDQ4411835
Publication date: 10 July 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2471/24710367.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Functional programming and lambda calculus (68N18) Logic in computer science (03B70) Complexity of computation (including implicit computational complexity) (03D15) Higher-type and set recursion theory (03D65)
Related Items (4)
Non-Deterministic Functions as Non-Deterministic Processes (Extended Version) ⋮ Type-two polynomial-time and restricted lookahead ⋮ A proof-theoretic characterization of the basic feasible functionals ⋮ Feasible functionals and intersection of ramified types
This page was built for publication:
