The Makam Metalanguage
☆204Mar 7, 2023Updated 3 years ago
Alternatives and similar repositories for makam
Users that are interested in makam are comparing it to the libraries listed below
Sorting:
- An efficient implementation of the higher-order logic programming language Lambda Prolog☆173Apr 21, 2024Updated last year
- Embeddable Lambda Prolog Interpreter☆350Mar 2, 2026Updated last week
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆390Oct 23, 2023Updated 2 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- secret project☆17Mar 14, 2018Updated 7 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Frank compiler☆305Apr 23, 2024Updated last year
- A less devious proof assistant☆231Jan 23, 2023Updated 3 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- A tiny dependent typechecker in Haskell, translated from @andrejbauer's OCaml☆38Jan 18, 2020Updated 6 years ago
- Minimal implementations for dependent type checking and elaboration☆768Jan 30, 2026Updated last month
- Contextual types meet mechanized metatheory!☆207Sep 30, 2025Updated 5 months ago
- Research on integrating datalog & lambda calculus via monotonicity types☆416Jun 21, 2022Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆374Updated this week
- Label dependent dependent session types☆16May 2, 2024Updated last year
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆703Mar 2, 2026Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- A prototype successor to Idris☆541Jul 8, 2019Updated 6 years ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104May 16, 2025Updated 9 months ago
- Fast vectorized bitarrays for OCaml☆16Jul 11, 2023Updated 2 years ago
- Implementation for ICFP 2020 paper☆54Jul 5, 2021Updated 4 years ago
- Functional programming with fewer indirections☆780Aug 20, 2020Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 10 months ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,057Jun 13, 2025Updated 8 months ago
- A collaborative bibliography of work related to the theory and practice of computational effects☆1,117Nov 4, 2025Updated 4 months ago
- Cogent Project☆173Mar 18, 2025Updated 11 months ago
- An interactive theorem prover based on lambda-tree syntax☆99Jan 25, 2026Updated last month