thunderseethe / making-a-languageLinks
Full Source Code for Making a Language series
☆62Updated 2 weeks ago
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☆66Updated last month
- Pure functional programming with whole-program mutability inference☆79Updated 3 weeks ago
- Ordo: A minimalist language with row polymorphism☆85Updated 9 months ago
- Match compilation algorithm in OCaml☆34Updated 10 months ago
- Fir programming language☆90Updated this week
- A pure type system implemented in OCaml☆78Updated 5 years ago
- A WIP little dependently-typed systems language☆41Updated last year
- Admiran is a pure, lazy, functional language and self-hosting compiler based upon Miranda☆81Updated 2 weeks ago
- a functional programming language with algebraic effects and handlers☆82Updated 10 months ago
- Kempe is a compiled stack-based language☆58Updated last year
- A simple ML-like programming language with subtyping and full type inference.☆187Updated last year
- A minimal implementation of Hindley-Milner's Algorithm J in OCaml☆77Updated 3 years ago
- Fωμ type checker and compiler☆56Updated 2 years ago
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆70Updated last year
- A functional programming language with shell scripting capabilities☆130Updated 3 weeks ago
- A general purpose statically-typed concatenative programming language.☆56Updated 2 years ago
- A bidirectional type checker☆66Updated 8 years ago
- A declarative concatenative programming language☆170Updated 3 months ago
- A simple functional programming language.☆22Updated 4 years ago
- A fancy diagnostics library that allows your compilers to exit with grace☆87Updated 3 weeks ago
- Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"☆48Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- Purely Functional, Real-Time Deques with Catenation (Kaplan & Tarjan)☆123Updated last year
- Tina, a programming language with typed algebraic effects and handlers.☆13Updated 4 years ago
- Playing with type systems☆51Updated last year
- A MinCaml compiler implemented in Rust☆44Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆62Updated last year
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 4 years ago
- Implementation of "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism"☆118Updated 6 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago