Alternatives and similar repositories for makam

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

• gibbon-compiler / gibbon
  A compiler for functional programs on serialized data
  ☆173Updated last week
• gelisam / klister
  an implementation of stuck macros
  ☆149Updated 2 weeks ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆83Updated 8 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆133Updated 5 years ago
• teyjus / teyjus
  An efficient implementation of the higher-order logic programming language Lambda Prolog
  ☆158Updated last year
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆212Updated 3 years ago
• LPCIC / elpi
  Embeddable Lambda Prolog Interpreter
  ☆332Updated last week
• Deducteam / Dedukti
  Type-checker for the λΠ-calculus modulo rewriting
  ☆223Updated 3 weeks ago
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆308Updated 4 months ago
• standardml / twelf
  The Twelf Programming Language
  ☆147Updated last week
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• rossberg / 1ml
  1ML prototype interpreter
  ☆289Updated 5 years ago
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• stchang / macrotypes
  ☆137Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆143Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• stedolan / mlsub
  Prototype type inference engine
  ☆205Updated 10 months ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆269Updated last year
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆271Updated 3 months ago
• VictorTaelin / Cedille-Core
  A minimal proof language.
  ☆211Updated 6 years ago
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆44Updated 6 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 10 months ago
• cedille / cedille
  Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
  ☆383Updated 2 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 5 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆211Updated 6 years ago
• chrisdone-archive / duet
  A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell
  ☆216Updated 2 years ago
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆228Updated 2 years ago