Alternatives and similar repositories for makam

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

• iu-parfunc / gibbon
  A compiler for functional programs on serialized data
  ☆164Updated last month
• Andromedans / andromeda
  A proof assistant for general type theories
  ☆306Updated 8 months 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
• ollef / Bidirectional
  Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"
  ☆131Updated 4 years ago
• gelisam / klister
  an implementation of stuck macros
  ☆144Updated last week
• standardml / twelf
  The Twelf Programming Language
  ☆137Updated 5 months ago
• effect-handlers / effects-rosetta-stone
  A comparison of how computational effects and handlers are implemented in various programming languages.
  ☆141Updated 6 years ago
• ollef / sixty
  Dependent type checker using normalisation by evaluation
  ☆262Updated 10 months ago
• cedille / cedille
  Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations
  ☆379Updated last year
• rossberg / 1ml
  1ML prototype interpreter
  ☆283Updated 5 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• andrejbauer / spartan-type-theory
  Spartan type theory
  ☆268Updated last year
• zehaochen19 / vanilla-lang
  An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types
  ☆90Updated 2 years ago
• teyjus / teyjus
  An efficient implementation of the higher-order logic programming language Lambda Prolog
  ☆155Updated last year
• chrisdone-archive / duet
  A tiny language, a subset of Haskell aimed at aiding teachers teach Haskell
  ☆214Updated 2 years ago
• stedolan / mlsub
  Prototype type inference engine
  ☆202Updated 5 months ago
• Deducteam / Dedukti
  Implementation of the λΠ-calculus modulo rewriting
  ☆209Updated 2 months ago
• LPCIC / elpi
  Embeddable Lambda Prolog Interpreter
  ☆313Updated last month
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• VictorTaelin / Cedille-Core
  A minimal proof language.
  ☆207Updated 6 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆128Updated last year
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆73Updated 8 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 6 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆177Updated 2 months ago
• RedPRL / sml-redprl
  The People's Refinement Logic
  ☆229Updated 2 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆83Updated 9 years ago
• RedPRL / cooltt
  😎TT
  ☆230Updated last year
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆90Updated 3 years ago