thunderseethe / making-a-languageLinks
Full Source Code for Making a Language series
☆48Updated last month
Alternatives and similar repositories for making-a-language
Users that are interested in making-a-language are comparing it to the libraries listed below
Sorting:
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆53Updated 5 months ago
- Ordo: A minimalist language with row polymorphism☆82Updated 3 months ago
- Pure functional programming with whole-program mutability inference☆72Updated this week
- Fir programming language☆64Updated this week
- Match compilation algorithm in OCaml☆27Updated 4 months ago
- Admiran, a pure, lazy, functional language and self-hosting compiler based upon Miranda☆63Updated this week
- Fωμ type checker and compiler☆54Updated 2 years ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 5 months ago
- A functional programming language with shell scripting capabilities☆117Updated this week
- A fancy diagnostics library that allows your compilers to exit with grace☆76Updated 3 months ago
- Playing with type systems☆51Updated 6 months ago
- A bidirectional type checker☆63Updated 8 years ago
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆69Updated 3 years ago
- Kempe is a compiled stack-based language☆58Updated 9 months ago
- A WIP little dependently-typed systems language☆41Updated 11 months ago
- A minimal pure functional language based on self dependent types.☆73Updated 3 years ago
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆222Updated last year
- Prototype for https://github.com/Innf107/vega☆19Updated 11 months ago
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆62Updated last year
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆40Updated 7 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Changes and Pinafore projects. Pull requests not accepted.☆34Updated last month
- Purely Functional, Real-Time Deques with Catenation (Kaplan & Tarjan)☆121Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- An interpreter of F-ing modules☆19Updated 6 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- an implementation of stuck macros☆144Updated 2 weeks ago