Generation of abstract binding trees
☆27Sep 26, 2025Updated 5 months ago
Alternatives and similar repositories for abbot
Users that are interested in abbot are comparing it to the libraries listed below
Sorting:
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- PL syntax macros.☆21Nov 30, 2025Updated 3 months ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- 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
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- ☆64Jun 24, 2019Updated 6 years ago
- ☆10May 3, 2017Updated 8 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 2 months ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- Standard ML autoformatter☆15Dec 25, 2021Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A collection of mechanised proofs☆19Feb 4, 2020Updated 6 years ago
- Standard ML compiler based on typed intermediate languages.☆51Aug 22, 2014Updated 11 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- STLC-related snippets in Agda☆16May 1, 2013Updated 12 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- Writeup that goes along with this:☆16Apr 19, 2018Updated 7 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 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
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Coherence typechecker for infinity categories☆20Dec 29, 2025Updated 2 months ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Lexer and parser generators for Standard ML, OCaml, and Haskell.☆38Aug 19, 2022Updated 3 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆32Oct 22, 2024Updated last year