Quantcast
Channel: Active questions tagged ocaml - Stack Overflow
Viewing all articles
Browse latest Browse all 591

Why are dependently typed languages often not Turing complete? [closed]

$
0
0

For example, Agda and Coq.

Compared with say, Idris2 and Fstar.

Also, are there practical disadvantages to dependently typed programming languages such as Agda not being Turing complete, or is it in a mostly theoretical sense, i.e., not known to impact on usability for programming.


Viewing all articles
Browse latest Browse all 591

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>