Forums before death by AOL, social media and spammers... "We can't have nice things"
|    comp.compilers    |    Compiler construction, theory, etc. (Mod    |    2,753 messages    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
|    Message 2,486 of 2,753    |
|    David Lovemore to All    |
|    Best language for implementing compilers    |
|    12 Feb 19 03:28:37    |
      From: davidlovemore@gmail.com              One of the things that makes ML good is that it is pretty hard to make       an error that get past the type checker.              It is not only the matching, which allows easy testing and unpacking       of compound data types, but its insistance that every case is checked       that is useful.              Also functional purity has many advantages.              To answer your question though, Haskell is a language you should be looking at.              --- SoupGate-Win32 v1.05        * Origin: you cannot sedate... all the things you hate (1:229/2)    |
[   << oldest   |   < older   |   list   |   newer >   |   newest >>   ]
(c) 1994, bbs@darkrealms.ca