News for hackers. Stuff that matters.
Re:Typing the technical interview by munin on Monday April 10, 2017 @02:33PM (#14081255)
This is awesome. I didn't even really see what was happening until it was too late.

If you enjoyed that you might enjoy the structure of the proof of the complexity of type inference for \-calculus: http://www.cs.brandeis.edu/~mairson/Papers/jfp02.pdf . They construct arbitrary boolean circuits from simple types and evaluate the circuits through type checking.

Re:Typing the technical interview by binarymax on Monday April 10, 2017 @03:36PM (#14081838)
Not sure if you noticed but your username fits the mythological setting :)