Total Functional Programming.

Turner, D. A. (2004). Total Functional Programming. Journal of Universal Computer Science, 10(7), 751-768.

Type

Journal article

Intellectual base

Primary research

Year

2004

DOI

10.3217/jucs-010-07-0751

Link

https://doi.org/10.3217/jucs-010-07-0751

Cited from

mathematics

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.

Domain-specific

• Total functional programming
  • The paradigm intentionally gives up unrestricted Turing completeness to gain strong normalization or a comparable termination guarantee.

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:276699737bab · see in the full table