/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

 thunderseethe.dev
Part 1: Bidirectional Constraint Generation ยท thunderseethe's devlog
| | lambdaland.org
How to write a type checker/type inferrer with good error messages | Lambda Land
9.6 parsecs away

Travel
| | 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.
| | slightknack.dev
Mirror: Hindley Milner Type Inference - Isaac Clayton
10.9 parsecs away

Travel
| | A cozy little corner of the web.
| | blog.polybdenum.com
X Design Notes: Pattern Matching I | Considerations on Codecrafting - words are my own, not an LLM's
10.4 parsecs away

Travel
| | This post is part 5 of a series. Click here to go to the beginning of the series.
| | javascript.crockford.com
Top Down Operator Precedence
27.5 parsecs away

Travel
| [AI summary] The provided text outlines the implementation of a parser and interpreter for a custom programming language, using a Pratt parsing approach. It details the structure of tokens, the handling of expressions, statements, and control flow, as well as the implementation of functions, objects, and arrays. The text also discusses potential extensions and enhancements to the language.