An equational theorem prover based on Knuth-Bendix completion
☆57Feb 11, 2026Updated 3 weeks ago
Alternatives and similar repositories for twee
Users that are interested in twee are comparing it to the libraries listed below
Sorting:
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Feb 28, 2019Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Synthetic Differential Geometry in Agda☆13Jan 14, 2015Updated 11 years ago
- ☆18May 10, 2022Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- 🔙 Backward lists for OCaml☆22Nov 21, 2025Updated 3 months ago
- VERified asSembler for cryptographic primitives☆12Jul 15, 2023Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- High level commands to declare a hierarchy based on packed classes☆104Feb 24, 2026Updated last week
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆36Oct 28, 2025Updated 4 months ago
- being bits and pieces I'm inclined to leave lying around☆56Jan 22, 2026Updated last month
- experiments with pext/pdep and codebruijn syntax☆17Nov 17, 2019Updated 6 years ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆12Feb 3, 2026Updated last month
- An automated theorem prover for intuitionistic propostional logic☆14Sep 21, 2020Updated 5 years ago
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Mar 25, 2018Updated 7 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Higher Algebra with Opetopic Types☆16Mar 30, 2023Updated 2 years ago
- non-extensible/hardcoded pattern matching, core of MLStyle☆16Jun 10, 2021Updated 4 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 17, 2026Updated 2 weeks ago
- Finite sets, finite maps, multisets and generic sets☆51Updated this week
- A monadic (and pretty) pretty printer for Haskell☆39Jul 12, 2023Updated 2 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆390Oct 23, 2023Updated 2 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆28Nov 12, 2025Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- Experiments with Realizability in Univalent Type Theory☆19Oct 21, 2024Updated last year
- ☆15Oct 31, 2023Updated 2 years ago