Higher Types, Finite Domains and Resource-bounded Turing Machines

DOI10.1093/logcom/exq009zbMath1255.68052MaRDI QIDQ2882561

Lars Kristiansen

Publication date: 7 May 2012

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/91ccdad2fa0eb9c0d8db41545fa5f6cc64c452d1

zbMATH Keywords

recursion; PCF; domain theory Gödel's T; higher type

Mathematics Subject Classification ID

68N18: Functional programming and lambda calculus

68Q55: Semantics in the theory of computing

06D35: MV-algebras

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)

03D65: Higher-type and set recursion theory

Related Items

Unnamed Item, Unnamed Item, Non-determinism in Gödel's system \(T\)