snu-sf / OrdinalLinks
☆15Updated 6 months ago
Alternatives and similar repositories for Ordinal
Users that are interested in Ordinal are comparing it to the libraries listed below
Sorting:
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 3 weeks ago
- Mechanizations of Type Theories☆33Updated 3 weeks ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- GitHub Action using Docker-Coq [maintainers=@Justme0606,@Zimmi48]☆15Updated 10 months ago
- Logical Relation for MLTT in Coq☆29Updated 3 weeks ago
- a version of the 2048 game for Coq☆22Updated last week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Class instances for Coq inductive types with little boilerplate☆27Updated last month
- ♾️ A library for universe levels and universe polymorphism☆36Updated 2 months ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 10 months ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14Updated 8 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated 2 years ago
- antifunext☆38Updated last year
- Relation algebra library for Coq☆50Updated 2 weeks ago
- A Coq library for abstract syntactical reasoning☆24Updated 9 months ago
- Yet Another deep embedding of Linear Logic in Coq☆16Updated this week
- my phd thesis☆26Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 2 weeks ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆21Updated 6 years ago
- ☆15Updated 2 years ago
- ☆19Updated 2 months ago
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆17Updated 3 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- Finite sets and maps for Coq with extensional equality☆30Updated 3 weeks ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- ☆25Updated last year