Explore >> Select a destination

You are here

 blog.polybdenum.com
Subtype Inference by Example Part 2: Parsing and Biunification | Considerations on Codecrafting
| | slightknack.dev
Mirror: Hindley Milner Type Inference - Isaac Clayton
3.2 parsecs away

Travel
| | A cozy little corner of the web.
| | jawher.me
The Litil chronicle - Chapter 3.1, Introduction to parsing ยท Jawher Moussa's blog
3.6 parsecs away

Travel
| |
| | lambdaland.org
How to write a type checker/type inferrer with good error messages | Lambda Land
3.6 parsecs away

Travel
| | All the source for this may be found on my SourceHut repository. Synopsis # Experimental type checker/inferer for a simple lambda calculus Description # This is a type inference system for a little language. (Described below.) It uses a fusion of type inference algorithms from PLAI, ESP, and ?Kanren. (See Resources) Broadly speaking, our type inference engine works by: generating typing constraints from the program solving those constraints Well describe each of those in more detail.
| | aartaka.me
Making Sense of Lambda Calculus 0: Abstration, Reduction, Substitution?
27.9 parsecs away

Travel
| Lambda Calculus is a fascinating idea, but it's not immediately obvious. In this post, I'm trying to understand and explain the basic terms used in Lambda Calculus.