catseye / PhilomathLinks
MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)
☆16Updated last year
Alternatives and similar repositories for Philomath
Users that are interested in Philomath are comparing it to the libraries listed below
Sorting:
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- A verified Implementation of a mini prolog☆17Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆45Updated 6 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 6 months ago
- PL syntax macros.☆19Updated last week
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Updated last year
- An experimental mutual induction tactic for Lean 4.☆22Updated this week
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Formal Semantics for Why3☆19Updated last month
- Mechanizations of Type Theories☆32Updated this week
- The Waterproof plugin for the Coq proof assistant allows you to write Coq proofs in a style that resembles handwritten mathematical proof…☆44Updated this week
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 3 weeks ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- A Coq development of the theory of Indexed W types with function extensionality.☆11Updated 8 years ago
- Coq library on rewriting theory and termination☆37Updated 2 months ago
- ☆16Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Simply Typed Lambda Calculus with de Bruijn indices☆16Updated 7 months ago
- A style guide for Coq☆18Updated 3 years ago
- ☆21Updated 4 years ago
- ☆25Updated last year
- Tiny verified SAT-solver☆30Updated 3 years ago
- ☆15Updated 2 months ago
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago