andreypopp / type-systemsLinks
Playing with type systems
☆51Updated 11 months ago
Alternatives and similar repositories for type-systems
Users that are interested in type-systems are comparing it to the libraries listed below
Sorting:
- A pretty-printing combinator library for OCaml☆51Updated last year
- 🩺 A library for compiler diagnostics☆47Updated last month
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆77Updated 3 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- A toy language based on LLVM that implements the System Fω type-system☆113Updated 2 years ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated last month
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 7 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- A Deductive Verification Tool for OCaml Programs☆75Updated 2 months ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A deterministic parser with fused lexing☆75Updated 2 years ago
- Efficient binder representation in OCaml☆43Updated last year
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆66Updated last month
- A fancy diagnostics library that allows your compilers to exit with grace☆87Updated last week
- A ML-like pure functional language that can be used as a template for creating your own language☆30Updated 11 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 7 months ago
- The LLVM tutorial using OCaml☆60Updated 5 years ago
- A collection of programming languages and type systems.☆33Updated 7 months ago
- A formalization of System Fω in Agda☆20Updated 10 months ago
- multi-shot continuations in OCaml☆51Updated last month
- Runtime assertion checking based on Gospel specifications☆50Updated last week
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- OCaml linter☆84Updated 3 weeks ago
- C-style preprocessor for OCaml☆110Updated last week
- Compile OCaml to standalone ANSI C file☆45Updated 2 weeks ago
- An implementation of "A Pretty Expressive Printer" in OCaml☆26Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆84Updated 4 years ago