Show HN: Crafting Interpreters – A handbook for making programming languages

Re:Show HN: Crafting Interpreters – A handbook for making pr... by harpocrates on Sunday January 15, 2017 @09:02PM (#13407797)

Writing a type-checker is fun and pretty interesting. For that, I recommend you get acquainted with formal semantics and judgements (that's just the language for describing type-systems). You'll probably be interested in then looking up

  * simply typed lambda calculus
  * Hindley-Milner type inference
  * bidirectional typing

After that, there are all sorts of cool things like linear/affine types, system F, dependent types, etc. which can be picked up.

All of this (except maybe the first part) is easily learnable either from Wikipedia, the original papers, or recent tutorials.

[ Parent | on HN ]

Re:Show HN: Crafting Interpreters – A handbook for making pr... by krat0sprakhar on Sunday January 15, 2017 @10:19PM (#13408011)

Shameless plug: If you know OCaml, then I wrote this tiny implementation of Hindley-Milner[0] for a tiny functional language.

It's (hopefully) very well commented, so it should clarify a bunch of concepts for newcomers.

[0] - https://github.com/prakhar1989/type-inference

[ Parent | on HN ]

Re:Show HN: Crafting Interpreters – A handbook for making pr... by AlphaSite on Sunday January 15, 2017 @09:20PM (#13407847)

Notes only tell half the story, but these are good notes on the first two topics.

https://www.cs.cornell.edu/courses/cs4110/2016fa/schedule.ht...

[ Parent | on HN ]

Re:Show HN: Crafting Interpreters – A handbook for making pr... by jnbiche on Sunday January 15, 2017 @09:28PM (#13407875)

Those are very good notes that have come up frequently in my Google searches.

[ Parent | on HN ]