| From: Matthias Felleisen (matthias at ccs.neu.edu) Date: Fri Dec 9 17:14:25 EST 2011 |
|
On Dec 9, 2011, at 3:32 PM, Jay McCarthy wrote: > but clearly some of us want to write quasi-ML in TR, but we can't without hacks like this. ML's match plays a very different role in the process of type inference. We would have to change the language in HUGE way. If you really want quasi-ML, consider implementing the 17th version of parenthesized ML. Everyone who did abandoned it eventually. Perhaps that's a hint.
| Posted on the dev mailing list. |
|
![[logo]](/logo.png){kind=logo}