Alternatives and similar repositories for makam:

Users that are interested in makam are comparing it to the libraries listed below

• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆129Updated 4 years ago
• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆158Updated last month
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆255Updated 4 months ago
• gelisam / klister
  an implementation of stuck macros
  ☆136Updated 2 months ago
• LPCIC / elpi
  Embeddable Lambda Prolog Interpreter
  ☆296Updated this week
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆261Updated 7 months ago
• rossberg / 1ml
  1ML prototype interpreter
  ☆275Updated 4 years ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆204Updated 2 years ago
• jozefg / higher-order-unification
  A small implementation of higher-order unification
  ☆184Updated 7 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated last year
• chrisdone-archive / duet
  A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell
  ☆212Updated last year
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• teyjus / teyjus
  An efficient implementation of the higher-order logic programming language Lambda Prolog
  ☆151Updated 8 months ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆165Updated last month
• cedille / cedille
  Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
  ☆370Updated last year
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆122Updated 7 months ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆134Updated 5 years ago
• RedPRL / cooltt
  😎TT
  ☆221Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆55Updated 8 months ago
• Deducteam / Dedukti
  Implementation of the λΠ-calculus modulo rewriting
  ☆200Updated 2 months ago
• wilbowma / cur
  A less devious proof assistant
  ☆222Updated last year
• mmirman / caledon
  higher order dependently typed logic programing
  ☆170Updated 6 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆67Updated 7 years ago
• ekmett / guanxi
  Relational programming in Haskell. Mostly developed on twitch.
  ☆259Updated 4 months ago
• luc-tielen / eclair-lang
  A minimal, fast Datalog implementation in Haskell that compiles to LLVM IR
  ☆222Updated 11 months ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆204Updated 5 years ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆125Updated last year
• AndrasKovacs / flatparse
  Fast parsing from bytestrings
  ☆154Updated last week
• grin-compiler / ghc-grin
  GRIN backend for GHC
  ☆144Updated 3 years ago