eashanhatti / peridotLinks
A fast functional language based on two level type theory
☆391Updated 2 years ago
Alternatives and similar repositories for peridot
Users that are interested in peridot are comparing it to the libraries listed below
Sorting:
- The cuteness implementation of a dependently typed language.☆190Updated 2 years ago
- A categorical programming language with effects☆278Updated 2 years ago
- A language with lexical effect handlers and lightweight effect polymorphism☆377Updated this week
- A declarative concatenative programming language☆164Updated 8 months ago
- Compiler for the Mirth programming language.☆471Updated last month
- Dependent type checker using normalisation by evaluation☆262Updated 9 months ago
- Demo for high-performance type theory elaboration☆556Updated last year
- A modern supercompiler for call-by-value functional languages☆415Updated 2 months ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆618Updated last month
- An ML-like functional programming language☆334Updated 3 years ago
- The adventures of a Haskell compiler☆226Updated last month
- Inpla: Interaction nets as a programming language (the current version)☆306Updated 7 months ago
- A compiler for Standard ML, somewhat☆203Updated 3 years ago
- A friendly little systems language with first-class types. Very WIP! 🚧 🚧 🚧☆621Updated 4 years ago
- Haskell implemented with combinators☆514Updated this week
- 1ML prototype interpreter☆282Updated 4 years ago
- Functional programming with fewer indirections☆765Updated 4 years ago
- Bootstrapping ATS3☆221Updated this week
- A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR☆222Updated last year
- A garden of small programming language implementations 🪴☆268Updated this week
- Minimal implementations for dependent type checking and elaboration☆678Updated 3 weeks ago
- ☆207Updated 11 months ago
- The MaPLe compiler: efficient and scalable parallel functional programming☆382Updated 3 months ago
- ☆220Updated 2 months ago
- A simple ML-like programming language with subtyping and full type inference.☆176Updated 6 months ago
- Staged compilation with dependent types☆174Updated last month
- Frank compiler☆296Updated last year
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆378Updated last year
- Par (⅋) is an experimental concurrent programming language. It's an attempt to bring the expressive power of linear logic into practice.☆266Updated this week
- A series of down-to-earth articles on implementing type inference☆156Updated 5 years ago