Explore >> Select a destination
|
You are here 
|
slightknack.dev | ||
| | | | |
www.baturin.org
|
|
| | | | | [AI summary] The text provides an in-depth exploration of functional programming concepts in OCaml, focusing on type systems, pattern matching, and data structures. It covers topics such as unit and boolean values as sum types, polymorphic types like option and result, and the use of match expressions for pattern matching. The text also includes exercises for practicing these concepts, such as defining functions, writing sum types, and implementing pattern matching. | |
| | | | |
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 | |
| | | | |
bartoszmilewski.com
|
|
| | | Abstract: I derive a free monoidal (applicative) functor as an initial algebra of a higher-order functor using Day convolution. I thought I was done with monoids for a while, after writing my Monoids on Steroids post, but I keep bumping into them. This time I read a paper by Capriotti and Kaposi about Free Applicative... | ||
