A reflection-based proof tactic for lattices in Coq
☆21Oct 15, 2023Updated 2 years ago
Alternatives and similar repositories for coq-lattice
Users that are interested in coq-lattice are comparing it to the libraries listed below
Sorting:
- ☆17Oct 16, 2018Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Nov 10, 2017Updated 8 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Mechanizing Types and Programming Languages using Beluga☆21May 29, 2020Updated 5 years ago
- A self-contained implementation of forward and backward inference for intuitionistic propositional logic☆18Oct 10, 2017Updated 8 years ago
- System F implemented in Haskell☆24Mar 15, 2012Updated 13 years ago
- Transducers in OCaml. About as Haskelly as you can manage. Hoping to fix that.☆16Feb 14, 2015Updated 11 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
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆47Updated this week
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Jun 8, 2025Updated 9 months ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- ☆30Jun 7, 2014Updated 11 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- A protoc plugin for generating OCaml code from protobuf (.proto) files.☆17Nov 30, 2019Updated 6 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- Monadic effects and equational reasoning in Rocq☆75Dec 19, 2025Updated 2 months ago
- Combinatorial species in HoTT☆12May 23, 2015Updated 10 years ago
- Cryptographic Constructions in the Type Theory of Agda☆52Aug 8, 2015Updated 10 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Jul 13, 2017Updated 8 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Apr 4, 2022Updated 3 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- ☆19Nov 24, 2025Updated 3 months ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- *DEPRECATED: See ocaml-multicore/ocaml-multicore* OCaml effects handlers☆27Apr 29, 2016Updated 9 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- A fornalisation of Grobner basis in ssreflect☆12Jan 29, 2026Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Nov 28, 2024Updated last year
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- Unicode text for OCaml☆14Feb 19, 2018Updated 8 years ago
- HoTT Book formalisations in Rzk.☆20Dec 15, 2023Updated 2 years ago
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago