SomewhatML / match-compileLinks
A small example of a source->source pattern matching to decision tree compiler
☆14Updated 4 years ago
Alternatives and similar repositories for match-compile
Users that are interested in match-compile are comparing it to the libraries listed below
Sorting:
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- A WIP little dependently-typed systems language☆41Updated 11 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- An experimental language server for SomewhatML☆24Updated 2 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆46Updated 9 years ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆40Updated 6 months ago
- Implementation of "Sound and Complete Bidirectional Typechecking..." by Dunfield and Krishnaswami, POPL 2019☆11Updated 5 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Type-Level Programming in Rust☆27Updated 3 years ago
- ☆16Updated 3 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated last month
- Type systems written in 1ML☆9Updated 5 years ago
- Tools for MIL, a Monadic Intermediate Language☆21Updated 9 months ago
- A toy dependent typed language.☆30Updated this week
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆68Updated 3 years ago
- Playing with type systems☆51Updated 6 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Abstract binding tree code generator☆37Updated 8 years ago
- ☆37Updated 3 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 5 years ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Ordo: A minimalist language with row polymorphism☆82Updated 3 months ago
- A type checker for the Lean theorem prover☆41Updated 4 years ago
- A safe and efficient target language for functional compilers☆20Updated 7 years ago
- Liquid Types implementation for Rust☆29Updated 2 years ago