Re:Rust's Type System Is Turing-Complete: Type-Level Program...
by Drup on Friday March 10, 2017 @09:21PM
(#13843804)
Agda's type system is not turing complete, you can only run on the type-level functions that are proven to be terminating [1] (using well-founded induction or co-induction).
Same for Coq, and probably Idris.
[1]: http://wiki.portal.chalmers.se/agda/pmwiki.php?n=ReferenceMa...
Re:Rust's Type System Is Turing-Complete: Type-Level Program...
by tathougies on Saturday March 11, 2017 @03:05AM
(#13844730)
You are right about agda. Idris however is not total by default.
Thanks for the obvious point that rust isn't agda. However, certainly you can agree that agdas type system is able to capture a strictly greater set of constraints than a typed language without a Turing complete type system