Explore >> Select a destination
|
You are here 
|
boxbase.org | ||
| | | | |
www.baturin.org
|
|
| | | | | ||
| | | | |
lambdaland.org
|
|
| | | | | 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. | |
| | | | |
gilmi.me
|
|
| | | | | ?m.me - Giml's type inference engine | |
| | | | |
typesanitizer.com
|
|
| | | A discussion of different developer tools which (can) build on top of a compiler, and how those affect compiler design. | ||
