Talk:Total functional programming

Computing Start‑class Mid‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Start	This article has been rated as Start-class on Wikipedia's content assessment scale.
Mid	This article has been rated as Mid-importance on the project's importance scale.

Computer science Start‑class Mid‑importance

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Start

This article has been rated as Start-class on Wikipedia's content assessment scale.

Mid

This article has been rated as Mid-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Misconception Regarding "Turing Complete"

This article repeats a common misconception regarding total programming languages: that they are not Turing complete. The question of Turing completeness with regards to total languages like Agda is subtle (it involves codata as mentioned in the article), but it is certainly not true to say that Agda is not Turing complete (yes, even with all of the checks on termination and safety turned on).

In particular, it is possible to write a Turing machine or lambda calculus interpreter in Agda, using methods like corecursion (although corecursion is not strictly necessary).

More details are available in this paper. — Preceding unsigned comment added by Doisin (talk • contribs) 02:03, 29 July 2020 (UTC)[reply]

Missing material

I'm sorry, but without descriptions of codata and dependent type systems the article is not even worth looking at. --141.228.106.148 (talk) 18:42, 20 January 2015 (UTC)[reply]

Bad example

There are various manners in which tooling can prove termination of quicksort and there are provers where quicksort can be shown to be trivially terminating. Some writer seems to have lifted some tool-specific behaviour to a general quality. I suggest to either clarify the problem of automated termination checking or remove the example completely. — Preceding unsigned comment added by Marco devillers (talk • contribs) 09:34, 15 August 2022 (UTC)[reply]