PeaCoq is a pretty Coq, isn't it?
☆105Jul 26, 2021Updated 4 years ago
Alternatives and similar repositories for PeaCoq
Users that are interested in PeaCoq are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- 🐣 A blog engine written and proven in Coq☆183Dec 1, 2019Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- A curated list of awesome Coq frameworks, libraries and software.☆233Mar 3, 2026Updated 3 weeks ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- A Coq IDE build on top of Proof General's Coq mode☆359Feb 23, 2026Updated last month
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Companion code for "Why Dependent Types Matter" paper.☆60Jun 14, 2018Updated 7 years ago
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆168Jan 9, 2026Updated 2 months ago
- A simple XML module for Idris.☆13May 22, 2020Updated 5 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 3 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Generates natural language versions of Coq proofs☆51Feb 11, 2018Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Template repo for theorem proving in Liquid Haskell☆33Sep 19, 2018Updated 7 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Mindless, verified (erasably) coding using dependent types☆104Dec 17, 2015Updated 10 years ago
- A framework for formally verifying distributed systems implementations in Coq☆620Jan 27, 2026Updated last month
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- A library of Coq definitions, theorems, and tactics. [maintainers=@gmalecha,@liyishuai]☆136Updated this week
- The Rocq Prover bot☆26Jan 30, 2026Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- A library for effects in Coq.☆65May 28, 2022Updated 3 years ago
- Coq formalizations of functional languages.☆145Jul 2, 2020Updated 5 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Derive editors for data types.☆29Oct 5, 2014Updated 11 years ago
- Rocq RFCs: documents to discuss changes to the Rocq Prover☆61Jan 15, 2025Updated last year
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Robots powered by Constructive Reals☆34Nov 3, 2017Updated 8 years ago
- Mostly Automated Synthesis of Correct-by-Construction Programs☆157Jan 27, 2026Updated last month
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆74Mar 6, 2026Updated 2 weeks ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- Link to preprints for POPL'18 and colocated events☆86Jun 16, 2018Updated 7 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- Lightweight Haskell dynamic loading library originally written by Copyright © 2004 Hampus Ram.☆24Feb 28, 2018Updated 8 years ago