Alternatives and similar repositories for metaprogramming

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

• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• zydeco-lang / fiddle
  A dynamically-typed CBPV language embedded in Racket
  ☆39Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆79Updated 4 months ago
• Gradual-Typing / Grift
  A compiler for the gradually typed lambda calculus
  ☆76Updated 4 years ago
• jsiek / gradual-typing-in-agda
  Formalizations of Gradually Typed Languages in Agda
  ☆59Updated last week
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• theoremprover-museum / theoremprover-museum.github.io
  ☆56Updated 8 months ago
• kirkedal / rfun-interp
  Interpreter for the reversible functional language rFun
  ☆38Updated 7 years ago
• namin / clpsmt-miniKanren
  CLP(SMT) on top of miniKanren
  ☆38Updated 3 years ago
• jsiek / denotational_semantics
  Denotational semantics based on graph and filter models
  ☆23Updated last year
• JohnWCartmell / Theory
  Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data
  ☆41Updated 3 weeks ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆59Updated 4 years ago
• nick8325 / twee
  An equational theorem prover based on Knuth-Bendix completion
  ☆57Updated last month
• OPLSS / oplss-notes-2018
  Notes and handouts from OPLSS 2018
  ☆55Updated 7 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆84Updated 9 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• andrejbauer / alg
  Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.
  ☆84Updated 4 years ago
• gebner / hott3
  HoTT in Lean 3
  ☆82Updated 5 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 3 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• mit-plv / rupicola
  Gallina to Bedrock2 compilation toolkit
  ☆65Updated 2 weeks ago
• OPLSS / oplss-notes-2019
  Notes and handouts from OPLSS 2019
  ☆34Updated 6 years ago
• rocq-community / topology
  General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]
  ☆51Updated last year
• jsiek / B629-denotational
  Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
  ☆74Updated 7 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated 2 months ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• david-christiansen / dan-scheme
  A very little language
  ☆16Updated 2 years ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 4 months ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆57Updated 5 years ago