Computational foundations of basic recursive function theory

DOI10.1016/0304-3975(93)90085-8MaRDI QIDQ1314348zbMATH OpenOpenAlexFDO

Authors Robert Constable, Scott F. Smith

Publication date 3 November 1994

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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

zbMATH Keywords

parallel computingunsolvabilityconstructive type theoryNuprlfixed 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)

Recommendations

• Recursive Functionals and Quantifiers of Finite Types Revisited, V
• scientific article; zbMATH DE number 1222088
• scientific article; zbMATH DE number 3987247
• scientific article; zbMATH DE number 3966062

Cites work

• scientific article; zbMATH DE number 3900718 (Why is no real title available?)
• scientific article; zbMATH DE number 3928956 (Why is no real title available?)
• scientific article; zbMATH DE number 3966062 (Why is no real title available?)
• scientific article; zbMATH DE number 4074542 (Why is no real title available?)
• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 3655923 (Why is no real title available?)
• scientific article; zbMATH DE number 3685474 (Why is no real title available?)
• scientific article; zbMATH DE number 3520384 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3349775 (Why is no real title available?)
• scientific article; zbMATH DE number 3418623 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Algebraically Generalized Recursive Function Theory
• Constructive mathematics and computer programming
• Data Types as Lattices
• Domain interpretations of Martin-Löf's partial type theory
• Edinburgh LCF. A mechanized logic of computation
• LCF considered as a programming language
• Recursive Functionals and Quantifiers of Finite Types I
• 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

Cited in

(9)

• scientific article; zbMATH DE number 702378 (Why is no real title available?)
• Formalizing abstract computability: Turing categories in Coq
• Notions of computation and monads
• Constructing type systems over an operational semantics
• Recursive Functions and Constructive Mathematics
• Some Reflections on the Foundations of Ordinary Recursion Theory and a New Proposal
• Validating Brouwer's continuity principle for numbers using named exceptions
• Multi-type recursive functions
• Meaning explanations at higher dimension

Describes a project that uses

Uses Software

• LCF
• Nuprl

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1314348)