4 ms·
When I took a programming languages class with Dan Friedman [0], the entire class was taught in scheme. One of our assignments was to implement a typerchecker f
by avhon1 8y ago
When I took a programming languages class with Dan Friedman [0], the entire class was taught in scheme. One of our assignments was to implement a typerchecker for the simply-typed lambda calculus in minikanren [1]. I recall it being a relatively straightforward assignment.
[0] https://en.wikipedia.org/wiki/Daniel_P._Friedman https://en.wikipedia.org/wiki/Daniel_P._Friedman
[1] http://minikanren.org/ http://minikanren.org/
- shawn 8y agoI actually need to do this for my lisp. Do you know if that class is available online? I only found things like http://mullr.github.io/micrologic/literate.html http://mullr.github.io/micrologic/literate.html which doesn’t seem to do type checking.
- avhon1 8y agoThe current version of the course is locked away on Canvas, but an older version (nearly the same as it was in 2017) is at [0]. It has all of the assignments, including the partially-complete type checker. (Look in Assignment 10.) We spent a couple of weeks learning minikanren out of "The Reasoned Schemer", using Will Byrd's implementation of minikanren. [0] https://web.archive.org/web/20070610012057/http://www.cs.indiana.edu/classes/c311/ https://web.archive.org/web/20070610012057/http://www.cs.ind...
- shawn 8y agoI've been studying this for the past day. I just wanted to say: thank you. This is the most helpful and relevant resource for my work that I've come across in some time. I really appreciate that you took the time to send me this.