uds-psl / coq-synthetic-computabilityLinks
☆15Updated 2 months ago
Alternatives and similar repositories for coq-synthetic-computability
Users that are interested in coq-synthetic-computability are comparing it to the libraries listed below
Sorting:
- ☆33Updated 2 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 2 weeks ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- ☆38Updated 8 months ago
- The Waterproof plugin for the Coq proof assistant allows you to write Coq proofs in a style that resembles handwritten mathematical proof…☆47Updated this week
- ☆24Updated 2 weeks ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆38Updated 3 months ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆47Updated last year
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- Ltac2 tutorial☆46Updated 3 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Relation algebra library for Coq☆49Updated 2 weeks ago
- ☆37Updated last year
- Monadic effects and equational reasoning in Rocq☆73Updated 3 weeks ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Tiny verified SAT-solver☆30Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated last month
- ☆15Updated 4 months ago
- A modular parametricity plugin for proof transfer in Coq [maintainers=@CohenCyril,@ecranceMERCE,@amahboubi,@lweqx]☆27Updated last month
- Coq development for the course "Mechanized semantics", Collège de France, 2019-2020☆69Updated last year
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- Python bindings for the Coq interactive proof assistant☆57Updated 3 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆78Updated 2 weeks ago
- Solutions of the exercises of the HoTT book☆23Updated 9 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- ☆24Updated 4 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 7 months ago
- High level commands to declare a hierarchy based on packed classes☆103Updated last week
- Coq library on rewriting theory and termination☆37Updated 2 weeks ago
- A (formalised) general definition of type theories☆58Updated 4 years ago