Generation of abstract binding trees
☆27Sep 26, 2025Updated 7 months ago
Alternatives and similar repositories for abbot
Users that are interested in abbot are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- PL syntax macros.☆21Apr 24, 2026Updated last week
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Standard ML autoformatter☆15Dec 25, 2021Updated 4 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- secret project☆17Mar 14, 2018Updated 8 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Apr 5, 2026Updated 3 weeks ago
- A collection of mechanised proofs☆19Feb 4, 2020Updated 6 years ago
- Intrinsic Verification of Formal Grammar Theory☆28Updated this week
- ☆65Jun 24, 2019Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Harper's Modernized ALGOL in SML using multi-sorted nominal abstract binding trees☆15Jul 21, 2017Updated 8 years ago
- ☆10May 3, 2017Updated 8 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆56Sep 11, 2025Updated 7 months ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated last year
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆21Updated this week
- Standard ML compiler based on typed intermediate languages.☆51Aug 22, 2014Updated 11 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Synthetic Topology in Homotopy Type Theory for probabilstic programming☆13Feb 2, 2018Updated 8 years ago
- ☆26Feb 7, 2017Updated 9 years ago
- The Definition of Standard ML, Revised (1997)☆117May 13, 2017Updated 8 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 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 version of the 1997 SML definition with corrections and some proposed Successor ML features added.☆207Aug 15, 2024Updated last year
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 9 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆33Oct 22, 2024Updated last year
- ☆12Jan 25, 2022Updated 4 years ago
- An experimental formalization of Knot Theory in Agda, with specific attention paid to Legendrian Knot Theory☆15Oct 15, 2018Updated 7 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Feb 9, 2016Updated 10 years ago