SomewhatML / match-compile
A small example of a source->source pattern matching to decision tree compiler
☆14Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for match-compile
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆25Updated 2 years ago
- A statically-typed compiled language defined by a simple grammar☆23Updated 2 years ago
- An experimental language server for SomewhatML☆24Updated last year
- Dependently typed programming language written in Haskell☆22Updated 2 years ago
- A simple prolog implementation in Rust☆26Updated 4 years ago
- A (nearly) pure functional programming language.☆24Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 3 years ago
- Garbage collector implementation in Rust for Rust☆13Updated 4 years ago
- dependently-typed lisp with flexible compiler backends☆25Updated 5 years ago
- A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines☆36Updated 4 years ago
- ☆22Updated 8 years ago
- ☆11Updated 2 years ago
- A type-safe, stack-based functional programming language☆15Updated 2 years ago
- Implementation of "Sound and Complete Bidirectional Typechecking..." by Dunfield and Krishnaswami, POPL 2019☆11Updated 4 years ago
- An LLVM compiler for an ML-like language (written in Rust)☆57Updated 2 years ago
- A safe and efficient target language for functional compilers☆19Updated 6 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- language verification, construction, and analysis☆20Updated 2 years ago
- experiments with Martin-Löf type theory ⋃ erasure ⋃ Rust☆23Updated 8 months ago
- A WIP little dependently-typed systems language☆37Updated 3 months ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆55Updated 2 years ago
- An interpreter of F-ing modules☆18Updated 5 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.☆13Updated 4 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆19Updated last month
- Implementing the type system described in the paper "Complete and Easy Bidirectional Type Inference" in Rust☆45Updated 8 years ago
- A basic implementation of Hindley-Milner type inference via Algorithm W in Rust.☆42Updated 8 years ago
- A simple term-rewriting interpreter that displays intermediate expressions.☆14Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆30Updated 2 years ago
- A programming language somewhat resembling cellular processes.☆34Updated 2 years ago