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
  ☆167Updated this week
• gelisam / klister
  an implementation of stuck macros
  ☆145Updated last month
• standardml / twelf
  The Twelf Programming Language
  ☆143Updated 3 weeks ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆75Updated 8 years ago
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆132Updated 5 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆174Updated 7 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆265Updated last year
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆142Updated 6 years ago
• rossberg / 1ml
  1ML prototype interpreter
  ☆286Updated 5 years ago
• RedPRL / redtt
  "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory
  ☆210Updated 3 years ago
• LPCIC / elpi
  Embeddable Lambda Prolog Interpreter
  ☆324Updated last week
• stchang / macrotypes
  ☆138Updated 3 years ago
• teyjus / teyjus
  An efficient implementation of the higher-order logic programming language Lambda Prolog
  ☆156Updated last year
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 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.
  ☆60Updated last year
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆308Updated last month
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆180Updated 4 months ago
• Deducteam / Dedukti
  Implementation of the λΠ-calculus modulo rewriting
  ☆213Updated 2 weeks ago
• cedille / cedille
  Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
  ☆383Updated last year
• stedolan / mlsub
  Prototype type inference engine
  ☆204Updated 7 months ago
• VictorTaelin / Cedille-Core
  A minimal proof language.
  ☆209Updated 6 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• ats-lang / ATS-Postiats-release
  ATS2: Unleashing the Potentials of Types and Templates
  ☆45Updated 5 years ago
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆228Updated 2 years ago
• david-christiansen / pie-hs
  An implementation of Pie in Haskell
  ☆209Updated 5 years ago
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆111Updated last month
• ekmett / guanxi
  Relational programming in Haskell. Mostly developed on twitch.
  ☆264Updated last year