Total Functional Programming.¶
Turner, D. A. (2004). Total Functional Programming. Journal of Universal Computer Science, 10(7), 751-768.
Cited by¶
2 citations across 2 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Span
- The primitive-recursive-versus-Turing-complete distinction moved into the design of total-functional languages and of domain-specific languages that deliberately restrict the span for tractability.
This sourceArgues for total-functional languages that deliberately restrict recursion (giving up Turing-completeness) so that the reachable span of programs is the provably-terminating ones — restricting the span for tractability.
Supported in partVerified against the work's full text
Turner proposes total functional languages that restrict recursion to primitive recursion and give up Turing completeness, but says nothing about DSLs or tractability.
“The rule to allow recursion only by syntactic descent on data constructors... restricts us to primitive recursion, which is guaranteed to terminate.”
- The primitive-recursive-versus-Turing-complete distinction moved into the design of total-functional languages and of domain-specific languages that deliberately restrict the span for tractability.
Domain-specific¶
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Read against the text for 1 of 2 citations: 1 supported in part. Each verdict is shown under its citation below, with what in the work backs the sentence.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:276699737bab · see in the full table