An Introduction to Redex with Abstracting Abstract Machines
☆104Mar 21, 2024Updated last year
Alternatives and similar repositories for redex-aam-tutorial
Users that are interested in redex-aam-tutorial are comparing it to the libraries listed below
Sorting:
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34May 27, 2017Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- This github repository hosts the code used within my thesis work and my last publication.☆12Jul 20, 2017Updated 8 years ago
- ☆12Jul 1, 2025Updated 8 months ago
- ☆18May 10, 2022Updated 3 years ago
- Collection of syntax/parse macros☆31Nov 1, 2022Updated 3 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated this week
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- WebAssembly model in Redex☆16May 16, 2019Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated last year
- Link to preprints for POPL'18 and colocated events☆86Jun 16, 2018Updated 7 years ago
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year
- A Redex tutorial with a focus on how to do work in Redex☆11Oct 21, 2024Updated last year
- ☆12Jun 13, 2023Updated 2 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Writeup that goes along with this:☆16Apr 19, 2018Updated 7 years ago
- A Scala-style magic function application form☆43Jul 31, 2022Updated 3 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- ☆17Oct 31, 2025Updated 4 months ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Sep 22, 2020Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Jul 10, 2015Updated 10 years ago
- Racket bindings for Z3☆24May 11, 2019Updated 6 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- ☆15Jul 7, 2022Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Proof-of-concept, mostly safe multimethods in Racket☆12Sep 9, 2020Updated 5 years ago
- ☆17Oct 16, 2018Updated 7 years ago