News for hackers. Stuff that matters.
Re:Typing the technical interview by carterschonwald on Monday April 10, 2017 @07:18PM (#14083413)
This is decent prolog code ;)
Re:Typing the technical interview by _qc3o on Monday April 10, 2017 @07:29PM (#14083490)
Any sophisticated enough type system contains an ad-hoc, informally-specified, bug-ridden, slow implementation of half of Prolog.
Re:Typing the technical interview by marcosdumay on Monday April 10, 2017 @09:36PM (#14084177)
It's quite formally specified.

Seems to not be very bug-ridden either. But maybe somebody should code a non-backtracking operator extension for GHC. This way, next time he could claim Haskell is a dynamically typed, interpreted, lazy and not-pure language.

Re:Typing the technical interview by harpocrates on Tuesday April 11, 2017 @12:01AM (#14084755)
> It's quite formally specified.

Haha, that's a good one. Haskell, unlike SML, is _not_ formally specified. If only, if only... sobs

Re:Typing the technical interview by carterschonwald on Tuesday April 11, 2017 @11:08AM (#14088549)
Way to cut to the conclusion:)

I do think datalog semantics composes way nicer than prolog though.

I think some of the type class stuff was formalized in the papers on HM(X) , though the combination of extensions in this post hasn't. But perhaps should be on the table for formalization.