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. | |
| | | | |
gilmi.me
|
|
| | | | | ?m.me - Giml's type inference engine | |
| | | | |
www.baturin.org
|
|
| | | | | [AI summary] The user has provided a comprehensive guide to OCaml programming, covering basic syntax, expressions, bindings, functions, and arithmetic operations. The guide includes examples of how to structure programs, use let-bindings, handle multiple expressions, and perform conversions between temperature units. It also touches on concepts like variable shadowing and the importance of type consistency in OCaml. The user has included exercises at the end, asking the reader to write programs for squaring integers and converting Celsius to Fahrenheit. | |
| | | | |
deniskyashif.com
|
|
| | | In this article, we'll define a basic regular expression language using a context-free grammar and learn how to parse its strings in linear time using the recursive descent method. | ||
