julesjacobs / boa
Partition refinement
☆13Updated last year
Related projects ⓘ
Alternatives and complementary repositories for boa
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.☆27Updated 9 months ago
- Generation of abstract binding trees☆27Updated 3 weeks ago
- Verified C programming in Agda☆16Updated 3 years ago
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆25Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated last month
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆20Updated last week
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- being bits and pieces I'm inclined to leave lying around☆46Updated last month
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆14Updated 5 months ago
- ☆27Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆32Updated last year
- ☆20Updated 6 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 3 months ago
- Work in progress on semi-simplicial types☆23Updated last year
- Constructive Galois connections☆32Updated 6 years ago
- Typing the linear pi calculus in Agda☆29Updated 2 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A formalisation of the Calculus of Constructions☆66Updated 3 months ago
- An Agda library for programming with ternary relations☆16Updated 2 years ago
- A Redex Model of Rust, or more specifically an encoding of Patina, the formal model for rust's type safety☆24Updated 10 years ago
- Demo for dependent types + runtime code generation☆12Updated this week
- Formalization of type theory☆22Updated 3 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago