Do any programming languages use general recursive functions as their basis?
Question
This is a naïve and, therefore, possibly malformed question, so apologies in advance!
My view is that a Turing Machine can be seen as the computational basis for procedural/imperative programming languages. Similarly, the lambda calculus is the foundation for functional programming languages.
I have recently learnt that the Church-Turing Thesis also shows mutual equivalence with a third model of computation: general recursive functions. Are there any programming languages that use this as their model of computation? If not, is there a technical reason why; i.e., besides "No one's tried yet"?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange