I think it's a tie
1) Gilles: Higher order matching with dependent types is undecidable.
Jason: Really? Who proved that?
Gilles: I did.
2) Derek: Have you looked at how I do it in MixML? How do the methods compare?
Florian: I haven't looked, but I'd be surprised if they are different. If you do it right, it ends up like this.
Derek: I was going to say, if you do it right, it ends up like MixML.
Sunday, August 02, 2009
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment