Re:Show HN: Dependently typed language for proofs that you c...
by caotic123 on Saturday October 02, 2021 @01:47AM
(#28726281)
I think you misunderstood, I have just made an analogy with BASiC. BASIC is normally a language that students used to implement when they are dealing with compiler topics. The fact is because BASIC is simple to learn and implement in the universe of structural languages. So, what I am saying is that you can do the same thing with Pompom, but of course, aiming at people that have at least a little experience with functional programming and type systems.
[ Parent
| on HN ]
Re:Show HN: Dependently typed language for proofs that you c...
by tluyben2 on Saturday October 02, 2021 @01:50AM
(#28726296)
It is nicely done; the implementation is indeed simple and easy to read! It hopefully will make more language implementors understand.
I guess comparing it to BASIC is not good as this is complex matter: languages like Idris that have a vastly more complex implementation but therefore also a nice (imho) syntax, are still hard for most without theoretical background (I was raised and educated by Dijkstra pupils so it was pounded into me from very young); I found The Little Typer a good read on the subject, but that might be impossible for people without background as well; I cannot really estimate that.