4 ms·
Weren't a lot of functional languages, like ML and it's descendants, created specifically to write parsers and compilers?
by golergka 3y ago
Weren't a lot of functional languages, like ML and it's descendants, created specifically to write parsers and compilers?
- JonChesterfield 3y agoI've seen it claimed that ML was originally written, in lisp, in order to have a better language to write compilers in.
- lispm 3y agoML was written as the language used by the theorem prover LCF. It was written in Lisp.
- JonChesterfield 3y agoI didn't know that link, searches seem to confirm. Thank you. The LCF style provers rely on the host language type system. A theorem instance can only be created by the trusted kernel. Lisp doesn't obviously lend itself to that - you could represent the proof, but I'm not clear how you'd prevent forging one.
- deleted 3y ago[deleted]
- peterfirefly 3y agoNo. ML was the meta language for a theorem prover (LCF). https://en.wikipedia.org/wiki/Logic_for_Computable_Functions https://en.wikipedia.org/wiki/Logic_for_Computable_Functions