willcrichton / rabbotView external linksLinks
Abstract binding tree code generator
☆37Oct 31, 2016Updated 9 years ago
Alternatives and similar repositories for rabbot
Users that are interested in rabbot are comparing it to the libraries listed below
Sorting:
- 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
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Writeup that goes along with this:☆16Apr 19, 2018Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 2 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- My PhD thesis, titled "Reasonably Programmable Syntax"☆15Aug 28, 2018Updated 7 years ago
- ☆18May 10, 2022Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Standard ML compiler based on typed intermediate languages.☆51Aug 22, 2014Updated 11 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated 3 weeks ago
- ☆12Jan 25, 2022Updated 4 years ago
- Hakyll support for Agda literate files☆19Jul 20, 2021Updated 4 years ago
- An interactive interpreter for asynchronous algebraic effects☆14Jun 19, 2024Updated last year
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆46Dec 3, 2024Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- NbE course @ Chalmers☆28Sep 24, 2024Updated last year
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated last month
- Resin: high performance variable binder and ast manipulation lib☆13Jan 1, 2019Updated 7 years ago
- ☆10May 3, 2017Updated 8 years ago