Alternatives and similar repositories for abstracting-definitional-interpreters

Users that are interested in abstracting-definitional-interpreters are comparing it to the libraries listed below

• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆84Updated 9 years ago
• jsiek / B629-denotational
  Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University
  ☆74Updated 7 years ago
• OPLSS / oplss-notes-2018
  Notes and handouts from OPLSS 2018
  ☆55Updated 7 years ago
• gasche / popl2018-papers
  Link to preprints for POPL'18 and colocated events
  ☆86Updated 7 years ago
• clf / celf
  ☆62Updated 6 years ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated 3 weeks ago
• pa-ba / calc-comp
  Coq proofs for the paper "Calculating Correct Compilers"
  ☆31Updated 2 years ago
• mmirman / caledon
  higher order dependently typed logic programing
  ☆173Updated 7 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• sweirich / tal
  An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)
  ☆150Updated 4 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆66Updated last month
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆36Updated 7 years ago
• mit-plv / fiat
  Mostly Automated Synthesis of Correct-by-Construction Programs
  ☆154Updated last month
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 3 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆34Updated 8 years ago
• dvanhorn / redex-aam-tutorial
  An Introduction to Redex with Abstracting Abstract Machines
  ☆104Updated last year
• 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
• ilya-klyuchnikov / ttlite
  A SuperCompiler for Martin-Löf's Type Theory
  ☆123Updated 3 years ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆47Updated 5 months ago
• theoremprover-museum / theoremprover-museum.github.io
  ☆56Updated 7 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• mietek / epigram2
  Mirror of Epigram 2, by Conor McBride, et al.
  ☆55Updated 5 years ago
• SMLFamily / The-Mechanization-of-Standard-ML
  The Mechanization of Standard ML
  ☆74Updated 3 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆131Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆79Updated 3 months ago
• UlfNorell / agda-summer-school
  Summer school on programming in Agda
  ☆68Updated 2 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 3 years ago
• wouter-swierstra / xmonad
  xmonad in Coq
  ☆46Updated 13 years ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 4 months ago