Explore >> Select a destination
|
You are here 
|
boxbase.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. | |
| | | | |
www.joachim-breitner.de
|
|
| | | | | [AI summary] A Haskell developer demonstrates how the rec-def library simplifies fixed-point calculation in recursive let bindings for program analysis. | |
| | | | |
www.twanvl.nl
|
|
| | | | | [AI summary] The author presents a Haskell prototype implementation of a type theory using indexed equality based on the homotopy interval. | |
| | | | |
text.marvinborner.de
|
|
| | | The bruijn programming language is pure lambda calculus with some syntactic improvements. It doesn't have any primitive functions - how is that possible? | ||
