Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tejon
on April 11, 2017
|
parent
|
context
|
favorite
| on:
Dale – A Lisp-flavoured C
I haven't used any of these, but my understanding is that Agda and Coq are not Turing-complete, nor is Idris with the totality checker on. Never seen anyone dispute these being referred to as "languages."
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: