News for hackers. Stuff that matters.
Re:The limits of type theory: computation vs. interaction by ngrilly on Monday June 08, 2015 @11:18AM (#9679618)
How can you compare that code with the Python one liner in the original article? It's interesting, of course, but it's not "easy to work with".
Re:The limits of type theory: computation vs. interaction by TheCoelacanth on Tuesday June 09, 2015 @12:13PM (#9686735)
Only the two lines starting with ex1 for heterogeneous if and the two lines starting with ex2 for heterogeneous lists are directly comparable to the Python examples. The rest is just defining what a boolean is, what a natural number is, what a character is, what if is, what a list is, what a heterogeneous list is, etc., to provide a full foundation for the examples.
Re:The limits of type theory: computation vs. interaction by Dewie3 on Monday June 08, 2015 @12:53PM (#9680359)
He explicitly gives standard machinery like the a boolean type and natural numbers, presumably to show more clearly what the parts are built up from. You probably wouldn't need to write all of that to use HList at a later point.
Re:The limits of type theory: computation vs. interaction by danghica on Tuesday June 09, 2015 @04:33AM (#9684641)
You would still need to program in Agda though :) Cheers!