namin / metaprogrammingLinks
Course on Metaprogramming
☆75Updated 7 months ago
Alternatives and similar repositories for metaprogramming
Users that are interested in metaprogramming are comparing it to the libraries listed below
Sorting:
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- HoTT in Lean 3☆81Updated 5 years ago
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- miniKanren with a first-order representation of the search space☆17Updated last year
- A (formalised) general definition of type theories☆59Updated 4 years ago
- ☆56Updated 9 months ago
- Interpreter for the reversible functional language rFun☆38Updated 7 years ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- CLP(SMT) on top of miniKanren☆39Updated 3 years ago
- Papers on aspects of Generalised Algebraic Theories, Contextual Categories and Mathematical Theory Of Data☆41Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- Notes and handouts from OPLSS 2018☆55Updated 7 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆74Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 3 weeks ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Educational Proof Assistant for Type Theory☆80Updated 3 weeks ago
- A very little language☆16Updated 2 years ago
- Algebraic Combinatorics in Coq☆39Updated last week
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- Coq course at Chalmers CSE☆38Updated 8 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 5 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆87Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year