You are here |
thunderseethe.dev | ||
| | | |
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. | |
| | | |
boxbase.org
|
|
| | | | These ideas and thoughts have converged towards type theory, and I remembered familiar patterns so I did a closer study at the Hindley-Milner, to understand it much better than before. | |
| | | |
gilmi.me
|
|
| | | | ?m.me - Implementing kind inference | |
| | | |
logr.cogley.info
|
|
| | I love the zsh configuration framework «prezto». Browse the runcoms folder for all the basic rc-type config files, and the modules folder for functions that you can load. ?? Switch into a module folder to display its readme. Edit the zpreztorc runcom to select modules to load and make settings. Run the built-in function zprezto-update to update. It: enriches the command line interface environment with sane defaults, aliases, functions, auto completion, and prompt themes. |