plum-umd / abstracting-definitional-interpretersView external linksLinks
Abstracting Definitional Interpreters
☆74Nov 25, 2017Updated 8 years ago
Alternatives and similar repositories for abstracting-definitional-interpreters
Users that are interested in abstracting-definitional-interpreters are comparing it to the libraries listed below
Sorting:
- Prolog-Style Meta-Interpreters in miniKanren☆33Mar 9, 2025Updated 11 months ago
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- ☆12Jun 13, 2023Updated 2 years ago
- Offline partial evaluation system for Prolog written using the cogen approach☆21Jul 19, 2016Updated 9 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- exploration of reflective architectures in Scheme☆20May 20, 2022Updated 3 years ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Feb 5, 2025Updated last year
- Generic implementation of different CFA families based on monadic decomposition☆23Jan 16, 2013Updated 13 years ago
- Racket Equivalence Graph Library☆19May 24, 2022Updated 3 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Apr 7, 2025Updated 10 months ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- Library for Classical Coq☆40Jan 20, 2026Updated 3 weeks ago
- An implementation of MacroML [Ganz, Sabry & Taha 2001]☆33Dec 21, 2018Updated 7 years ago
- A miniKanren interpreter... in miniKanren. Relationally run your relations relationally!☆24May 1, 2016Updated 9 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- CLP(SMT) on top of miniKanren☆39Feb 26, 2022Updated 3 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆139Nov 29, 2025Updated 2 months ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 2 years ago
- Implementations of various toy programming languages☆12Apr 19, 2018Updated 7 years ago
- Category Theory in Programming☆13Jan 22, 2026Updated 3 weeks ago
- A fast implementation of miniKanren with disequality and absento, compatible with Racket and Chez.☆167Feb 4, 2025Updated last year
- Experiments with Realizability in Univalent Type Theory☆19Oct 21, 2024Updated last year
- A simple Racket package to display text tables with utf-8 boxes☆12Jun 28, 2023Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- Patricia Tree data structure in OCaml for maps and sets, supports generic (GADT) keys☆16Jan 19, 2026Updated 3 weeks ago
- Collapsing Towers of Interpreters☆93Jun 21, 2025Updated 7 months ago
- my phd thesis☆26Aug 7, 2024Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- ☆41Jun 9, 2025Updated 8 months ago
- ☆12Jul 1, 2025Updated 7 months ago
- A toolkit for building multi-result supercompilers☆32Oct 23, 2021Updated 4 years ago
- Course on Metaprogramming☆75Feb 5, 2026Updated last week
- WASP was superseded by: https://github.com/OCamlPro/owi☆16Aug 28, 2024Updated last year
- Code for "Staged Generic Programming" (ICFP 2017)☆28Sep 2, 2023Updated 2 years ago
- A graduate seminar on SMT solving and solver-aided systems☆28Jul 17, 2022Updated 3 years ago
- Haskell library implementing "Data Types a la Carte"☆92Oct 20, 2023Updated 2 years ago
- A static analysis tool for C.☆29Oct 29, 2019Updated 6 years ago
- Staged Abstract Interpreters☆69Mar 13, 2023Updated 2 years ago