Explore >> Select a destination
|
You are here 
|
thunderseethe.dev | ||
| | | | |
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. | |
| | | | |
slightknack.dev
|
|
| | | | | A cozy little corner of the web. | |
| | | | |
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. | |
| | | | |
tenthousandmeters.com
|
|
| | | Mark functions as async. Call them with await. All of a sudden, your program becomes asynchronous - it can do useful things while it waits for... | ||
