rocq-community / dedekind-realsLinks
A formalization of the Dedekind real numbers in Coq [maintainer=@andrejbauer]
☆43Updated last year
Alternatives and similar repositories for dedekind-reals
Users that are interested in dedekind-reals are comparing it to the libraries listed below
Sorting:
- An enhanced unification algorithm for Coq☆56Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- HoTT in Lean 3☆80Updated 4 years ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆54Updated 6 years ago
- ☆22Updated 9 years ago
- ☆36Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆52Updated 8 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 7 months ago
- ☆84Updated 7 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Algebraic Combinatorics in Coq☆38Updated 6 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- MetaML and MetaOCaml bibliography☆94Updated 7 months ago
- An interactive theorem prover based on lambda-tree syntax☆96Updated 2 months ago
- ☆46Updated 6 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 3 months ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆83Updated 5 years ago
- An equational theorem prover based on Knuth-Bendix completion☆52Updated 3 weeks ago
- A formalization of M-types in Agda☆34Updated 5 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Two-Level Type Theory☆28Updated 5 years ago