Implementation of higher-order logic in Python
☆67Feb 25, 2023Updated 3 years ago
Alternatives and similar repositories for holpy
Users that are interested in holpy are comparing it to the libraries listed below
Sorting:
- ☆16Jul 3, 2023Updated 2 years ago
- Solver for Constrained Horn Clauses☆50Updated this week
- Datalog + Egg = Good☆66May 31, 2023Updated 2 years ago
- ☆24Feb 26, 2023Updated 3 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Feb 2, 2026Updated 3 weeks ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- Coq library on rewriting theory and termination☆37Jan 27, 2026Updated last month
- sketches for egg: a flexible, high-performance e-graph library☆30Sep 25, 2025Updated 5 months ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- ☆20May 11, 2023Updated 2 years ago
- A tool for proving and organizing general theorems using Python.☆33Feb 22, 2026Updated last week
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 3 years ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Dec 19, 2023Updated 2 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- easter egg is a flexible, high-performance e-graph library with support of multiple additional assumptions at once☆13Mar 27, 2025Updated 11 months ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- Visual graph rewriting platform☆10Jun 3, 2025Updated 8 months ago
- Tools for manipulating CHC and related files☆15Apr 21, 2023Updated 2 years ago
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆14Feb 15, 2025Updated last year
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- Binsec/Haunted is an extension of Binsec to verify speculative constant-time and detect Spectre attacks.☆17Oct 19, 2023Updated 2 years ago
- Type-checker for the λΠ-calculus modulo rewriting☆228Nov 25, 2025Updated 3 months ago
- Horn Clause Constraint Solving for Liquid Types☆159Updated this week
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆13Dec 2, 2025Updated 2 months ago
- ☆13Nov 23, 2019Updated 6 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- ☆13Jan 23, 2022Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- ☆13Jul 24, 2021Updated 4 years ago
- αProlog☆18Jul 9, 2023Updated 2 years ago
- ☆51Jun 27, 2022Updated 3 years ago
- Educational Proof Assistant for Type Theory☆78Jan 18, 2026Updated last month
- Proof assistant based on the λΠ-calculus modulo rewriting☆372Updated this week
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Sep 3, 2020Updated 5 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16May 21, 2025Updated 9 months ago
- A library for non-deterministically parsing natural language expressions into a structured form.☆18Feb 3, 2023Updated 3 years ago
- A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]☆136Oct 2, 2025Updated 4 months ago