astampoulis / makam
The Makam Metalanguage
☆194Updated last year
Related projects ⓘ
Alternatives and complementary repositories for makam
- A compiler for functional programs on serialized data☆158Updated this week
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆129Updated 4 years ago
- Dependent type checker using normalisation by evaluation☆254Updated 2 months ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆204Updated 2 years ago
- 1ML prototype interpreter☆270Updated 4 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- an implementation of stuck macros☆132Updated 2 weeks ago
- A pure type system implemented in OCaml☆77Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- Embeddable Lambda Prolog Interpreter☆290Updated this week
- Relational programming in Haskell. Mostly developed on twitch.☆256Updated 2 months ago
- Implementation of the λΠ-calculus modulo rewriting☆200Updated this week
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Dependently Typed Lambda Calculus in Haskell☆112Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 5 months ago
- Prototype type inference engine☆197Updated 3 months ago
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆151Updated 6 months ago
- An implementation of Pie in Haskell☆204Updated 5 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆133Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆368Updated last year
- A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell☆212Updated last year
- higher order dependently typed logic programing☆170Updated 6 years ago
- A proof assistant for general type theories☆297Updated last month
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- A less devious proof assistant☆222Updated last year
- Staged compilation with dependent types☆163Updated 2 weeks ago
- Strongly-typed System F in Haskell☆117Updated 2 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆67Updated 7 years ago