Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 1499100 - MaRDI portal

scientific article; zbMATH DE number 1499100

From MaRDI portal

Publication:4501154

Jump to:navigation, search

zbMath0947.03065MaRDI QIDQ4501154

Daniel Leivant

Publication date: 3 September 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

free algebra computable functions applicative programs equational recurrence higher-order functional higher-type programs higher-type recurrence predicative recurrence

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65)

Related Items

Algorithmically broad languages for polynomial time and space, Intrinsic theories and computational complexity, Theories with self-application and computational complexity., A proof-theoretic characterization of the basic feasible functionals, A note on complexity measures for inductive classes in constructive type theory, On the computational complexity of imperative programming languages, Higher type recursion, ramification and polynomial time, Ramified recurrence and computational complexity. III: Higher type recurrence and elementary complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4501154&oldid=18593880"