julesjacobs / boaLinks
Partition refinement
β15Updated 2 years ago
Alternatives and similar repositories for boa
Users that are interested in boa are comparing it to the libraries listed below
Sorting:
- An itree-like data-structure to additionally support internal non-determinismβ18Updated 2 months ago
- π¦ An experimental elaborator for dependent type theory using effects and handlersβ37Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreterβ26Updated 4 years ago
- Generation of abstract binding treesβ27Updated 11 months ago
- Coq library on rewriting theory and terminationβ36Updated last month
- Experimental type-checker for internally parametric type theoryβ32Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Genericallyβ21Updated last year
- A Coq to Cedille compiler written in Coqβ34Updated 5 years ago
- An enhanced unification algorithm for Coqβ56Updated 5 months ago
- EGraphs in OCamlβ74Updated last year
- Deadlock freedom by type checkingβ20Updated 2 years ago
- The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.β29Updated last year
- Demo for dependent types + runtime code generationβ71Updated 7 months ago
- A monadic library for symbolic evaluationβ69Updated 2 months ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]β30Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.β66Updated 2 weeks ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)β43Updated 6 years ago
- Relation algebra library for Coqβ49Updated last week
- An implementation of a simple Neural network in Idris using category theory.β23Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchaiβ¦β32Updated last year
- Algebraic proof discovery in Agdaβ34Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.β22Updated 4 months ago
- Constructive Galois connectionsβ35Updated 7 years ago
- Typing the linear pi calculus in Agdaβ29Updated 3 years ago
- Graded Dependent Type systemsβ25Updated 2 years ago
- A (formalised) general definition of type theoriesβ57Updated 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theoriesβ25Updated this week
- being bits and pieces I'm inclined to leave lying aroundβ54Updated 2 months ago
- Coq library for tactics, basic definitions, sets, mapsβ49Updated 3 weeks ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Componentsβ35Updated last week