bmsherman / topologyView external linksLinks
Formal topology (and some probability) in Coq
☆31Nov 30, 2018Updated 7 years ago
Alternatives and similar repositories for topology
Users that are interested in topology are comparing it to the libraries listed below
Sorting:
- Topology library for Coq☆12Dec 24, 2015Updated 10 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Jun 5, 2019Updated 6 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- An abstract machine using indexed containers and their zippers☆13Dec 29, 2016Updated 9 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- ☆18May 10, 2022Updated 3 years ago
- HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)☆17Dec 9, 2020Updated 5 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 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
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆168Jan 9, 2026Updated last month
- ☆11Jul 20, 2016Updated 9 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- An attempt to formalize unix cat in fiat☆11May 28, 2017Updated 8 years ago
- ☆21Mar 15, 2016Updated 9 years ago
- A formalization of category theory in the Coq proof assistant.☆100Nov 4, 2024Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated last month
- ☆11Jul 8, 2020Updated 5 years ago
- ☆10May 3, 2017Updated 8 years ago
- being the materials from my YOW LambdaJam 2016 talk☆11Jun 11, 2016Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- A monadic (and pretty) pretty printer for Haskell☆39Jul 12, 2023Updated 2 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- RISC-V Specification in Coq☆13Sep 17, 2018Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆27Mar 28, 2025Updated 10 months ago
- A reflection-based proof tactic for lattices in Coq☆21Oct 15, 2023Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- ☆17Oct 16, 2018Updated 7 years ago