Explore >> Select a destination
|
You are here 
|
xnacly.me | ||
| | | | |
gilmi.me
|
|
| | | | | ?m.me - Giml's type inference engine | |
| | | | |
blog.sylver.dev
|
|
| | | | | Sylver is a language agnostic platform for building custom source code analyzers (think eslint for every language). This might be a lot to unpack, so let us explore this tool by solving a real-world problem: our application's configuration is stored ... | |
| | | | |
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. | |
| | | | |
jdh.hamkins.org
|
|
| | | I'd like to share a simple proof I've discovered recently of a surprising fact: there is a universal algorithm, capable of computing any given function! Wait, what? What on earth do I ... | ||
