choukh / Set-TheoryLinks
A formalization of the textbook Elements of Set Theory
☆60Updated 4 years ago
Alternatives and similar repositories for Set-Theory
Users that are interested in Set-Theory are comparing it to the libraries listed below
Sorting:
- a tutorial implementation on an elaborator of a dependently typed language with pruning☆26Updated 3 years ago
- Coq formalizations and proofs of (data) structures and algorithms.☆47Updated 7 years ago
- EPIT 2020 - Spring School on Homotopy Type Theory☆110Updated 4 years ago
- Mechanized baselines for various type system features☆17Updated last month
- ☆25Updated 6 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆48Updated 3 years ago
- PL conference deadline countdowns☆63Updated last month
- Neon lights in the night tonight and stars that shine in the open sky☆46Updated 2 years ago
- Modeling and Proving in Computational Type Theory☆120Updated 5 months ago
- Communication between Coq and SAT/SMT solvers☆162Updated last week
- Logical Relation for MLTT in Coq☆28Updated last week
- Coq code and exercises from the Coq'Art book [maintainers=@ybertot,@Casteran]☆127Updated 11 months ago
- A function definition package for Coq☆236Updated last week
- Coq集合论中文教程☆46Updated 4 years ago
- Learn Lean 4 with PLFA proofs.☆102Updated 9 months ago
- Programming Language Foundations in Lean☆48Updated 6 months ago
- Constructive Interpretations of HoTT☆36Updated 5 years ago
- Coq plugin embedding elpi☆180Updated last week
- An encoding of Zermelo-Fraenkel Set Theory in Coq☆24Updated 3 years ago
- A library of mechanised undecidability proofs in the Coq proof assistant.☆127Updated 3 weeks ago
- The Penn Locally Nameless Metatheory Library☆76Updated 10 months ago
- ☆22Updated last year
- Towards changing things and see if it proofs☆60Updated 4 years ago
- A verified polyhedral scheduling validator in Coq.☆23Updated last year
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆68Updated this week
- 十分钟魔法练习 in OCaml☆36Updated 3 years ago
- Normalization by evaluation of simply typed combinators.☆26Updated 3 years ago
- Build dependency graphs between Coq objects [maintainers=@Karmaki,@ybertot]☆97Updated 2 weeks ago
- Formal proof of the Four Color Theorem [maintainer=@ybertot]☆226Updated 3 months ago
- Selected Papers of Dana S. Scott☆171Updated last year