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:
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Datalog + Egg = Good☆66May 31, 2023Updated 2 years ago
- ☆16Jul 3, 2023Updated 2 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- Type inference algorithms and intuitionistic propositional theorem provers solving type inhabitation problems☆34Feb 2, 2026Updated last month
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45May 31, 2022Updated 3 years ago
- ☆24Feb 26, 2023Updated 3 years ago
- Type-checker for the λΠ-calculus modulo rewriting☆230Nov 25, 2025Updated 3 months ago
- Supplement of the ICFP'22 paper "‘do’ Unchained: Embracing Local Imperativity in a Purely Functional Language"☆14Feb 15, 2025Updated last year
- Coq library on rewriting theory and termination☆37Jan 27, 2026Updated last month
- Polynomial semantics of linear logic☆13Apr 15, 2018Updated 7 years ago
- Horn Clause Constraint Solving for Liquid Types☆160Updated this week
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- A verified Implementation of a mini prolog☆17Nov 27, 2022Updated 3 years ago
- Solver for Constrained Horn Clauses☆50Updated this week
- Tools for manipulating CHC and related files☆15Apr 21, 2023Updated 2 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
- ☆13Jan 23, 2022Updated 4 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- A Self-Interpreter for F-omega☆16Dec 6, 2015Updated 10 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Sep 3, 2020Updated 5 years ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆377Mar 14, 2026Updated last week
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆16Mar 10, 2026Updated last week
- Visual graph rewriting platform☆10Jun 3, 2025Updated 9 months ago
- A language-generic implementation of equality saturation in Haskell☆22Dec 4, 2018Updated 7 years ago
- Course Website for CS6225: Programs and Proofs @ IIT Madras☆13Apr 28, 2021Updated 4 years ago
- A cost-aware logical framework, embedded in Agda.☆78Feb 23, 2026Updated 3 weeks ago
- ☆13Nov 23, 2019Updated 6 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16May 21, 2025Updated 10 months ago
- Coq Protocol Playground with Se(xp)rialization of Internal Structures.☆137Nov 27, 2025Updated 3 months ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Interactive, web-based visual math assistant☆12Mar 14, 2026Updated last week
- sketches for egg: a flexible, high-performance e-graph library☆30Sep 25, 2025Updated 5 months ago
- A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]☆136Feb 26, 2026Updated 3 weeks ago
- OCaml library to transform an Llvm control flow graph in an SMT formula.☆13Apr 20, 2018Updated 7 years ago
- ☆20May 11, 2023Updated 2 years ago