General recursive functions of natural numbers.¶
Kleene, S. C. (1936). General recursive functions of natural numbers. Mathematische Annalen, 112(1), 727-742.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Well-Foundedness (Well-Ordering)
- … infinite structures via productivity (the dual of termination); dependently-typed languages (Coq, Agda, Lean) require a termination check for recursive definitions, implemented via structural or well-founded recursion combined with totality checking, with the underlying recursion theory tracing back to Kleene (1936).
This sourceFoundational definition of the general-recursive functions, the basis for later termination and well-founded-recursion theory.
- … infinite structures via productivity (the dual of termination); dependently-typed languages (Coq, Agda, Lean) require a termination check for recursive definitions, implemented via structural or well-founded recursion combined with totality checking, with the underlying recursion theory tracing back to Kleene (1936).
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:98cd1d2d9208 · see in the full table