tomprimozic/type-systems resource

Health v2 · maintenance only

Flags: no_releases

Adoption not part of the score

1603 stars · 75 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A collection of minimal, well-commented OCaml implementations of various advanced type systems, including Algorithm W, extensible rows, first-class polymorphism, gradual typing, and refined types. It is designed as an educational resource for learning about type inference and experimenting with type system design.

Use cases

• learn how Hindley-Milner type inference works
• study implementations of Algorithm W in OCaml
• understand extensible records with scoped labels
• explore type inference for higher-rank polymorphism
• see how gradual typing can be implemented
• experiment with extending a type system
• prepare for programming languages coursework or research

When to choose

• you want clear, minimal reference implementations of type inference algorithms
• you are learning programming language theory and want runnable code
• you want a starting point to build or extend your own type system
• you need to understand papers like Leijen's extensible rows or HMF concretely

When to avoid

• you need a production-ready type checker or compiler
• you want a maintained library with API stability and releases
• you need type system implementations in a language other than OCaml
• you want comprehensive documentation or tutorials beyond the code

Facets

learning-resource · maturity maintenance

type-system interpreter programming-language programming-languages education tutorials cross-platform ocaml type-inference hindley-milner algorithm-w gradual-typing extensible-records polymorphism dependent-types academic type-systems algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="tomprimozic/type-systems")