Path: csiph.com!news.mixmin.net!newsreader4.netcologne.de!news.netcologne.de!peer02.ams1!peer.ams1.xlned.com!news.xlned.com!peer02.am4!peer.am4.highwinds-media.com!peer01.iad!feed-me.highwinds-media.com!news.highwinds-media.com!border1.nntp.dca1.giganews.com!nntp.giganews.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: David Lovemore Newsgroups: comp.compilers Subject: Best language for implementing compilers? Date: Tue, 12 Feb 2019 03:28:37 -0800 (PST) Organization: Compilers Central Lines: 10 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <19-02-007@comp.compilers> References: <19-02-002@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="UTF-8" Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="145"; mail-complaints-to="abuse@iecc.com" Keywords: ML, Haskell Posted-Date: 12 Feb 2019 09:44:32 EST X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com In-Reply-To: <19-02-002@comp.compilers> X-Received-Bytes: 1498 X-Received-Body-CRC: 3401627767 Xref: csiph.com comp.compilers:2159 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.