andreypopp / type-systemsLinks
Playing with type systems
☆51Updated last year
Alternatives and similar repositories for type-systems
Users that are interested in type-systems are comparing it to the libraries listed below
Sorting:
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆79Updated 4 years ago
- 🩺 A library for compiler diagnostics☆52Updated 2 months ago
- A pretty-printing combinator library for OCaml☆50Updated last year
- Fωμ type checker and compiler☆56Updated 3 years ago
- A toy language based on LLVM that implements the System Fω type-system☆114Updated 2 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months ago
- A pure type system implemented in OCaml☆78Updated 5 years ago
- A Deductive Verification Tool for OCaml Programs☆76Updated 4 months ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆91Updated 7 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆65Updated 2 months ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- The LLVM tutorial using OCaml☆60Updated 5 years ago
- A fancy diagnostics library that allows your compilers to exit with grace☆88Updated last month
- A deterministic parser with fused lexing☆75Updated 2 years ago
- multi-shot continuations in OCaml☆51Updated 2 months ago
- Efficient binder representation in OCaml☆43Updated last year
- Compile OCaml to standalone ANSI C file☆45Updated 2 months ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆48Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- Match compilation algorithm in OCaml☆34Updated 11 months ago
- Runtime assertion checking based on Gospel specifications☆50Updated last month
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- A formalization of System Fω in Agda☆20Updated last month
- an implementation of Observational Type Theory (OTT) and more☆30Updated 3 years ago
- A collection of programming languages and type systems.☆33Updated 9 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.☆38Updated 3 years ago