Computational foundations of basic recursive function theory

DOI10.1016/0304-3975(93)90085-8zbMath0798.03046OpenAlexW2103838550MaRDI QIDQ1314348

Scott F. Smith, Robert L. Constable

Publication date: 3 November 1994

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6744

zbMATH Keywords

parallel computingconstructive type theoryunsolvabilityNuprlfixed point ruleindexing-free theory of computing

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Other constructive mathematics (03F65) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (5)

Meaning explanations at higher dimension ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Constructing type systems over an operational semantics ⋮ Notions of computation and monads ⋮ Formalizing abstract computability: Turing categories in Coq

Uses Software

• Nuprl
• LCF

Cites Work

• Domain interpretations of Martin-Löf's partial type theory
• LCF considered as a programming language
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Edinburgh LCF. A mechanized logic of computation
• Recursive Functionals and Quantifiers of Finite Types I
• Constructive mathematics and computer programming
• Data Types as Lattices
• Algebraically Generalized Recursive Function Theory
• Shorter Notes: A Note on the Failure of the Relativized Enumeration Theorem in Recursive Function Theory
• Uniformly Reflexive Structures: On the Nature of Godelizations and Relative Computability
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational foundations of basic recursive function theory