|
You are here |
slightknack.dev | ||
| | | | |
www.baturin.org
|
|
| | | | | [AI summary] This blog post tutorial explains advanced OCaml programming concepts including parametric polymorphism, higher-order functions like combinators and composition, and algebraic data types with pattern matching. | |
| | | | |
thunderseethe.dev
|
|
| | | | | Generate Type Constraints with a Bidirectional Type System | |
| | | | |
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. | |
| | | | |
developerlife.com
|
|
| | | Learn how to implement effective Rust polymorphism, using dyn, impl, existing traits, and trait objects for testing and extensibility, in real world projects. | ||