UniMath / Schools
☆82Updated 6 months ago
Alternatives and similar repositories for Schools:
Users that are interested in Schools are comparing it to the libraries listed below
- A slow-paced introduction to reflection in Agda. ---Tactics!☆100Updated 2 years ago
- An experimental category theory library for Lean☆49Updated last year
- Categorical logic from a categorical point of view☆77Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Lecture notes on realizability☆73Updated last month
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Total Parser Combinators in Agda☆126Updated last year
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Categorical Logic Notes☆77Updated 3 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆114Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆62Updated 3 years ago
- Documentation on goals of the coq-community organization, the shared contributing guide and code of conduct.☆68Updated 10 months ago
- Programming library for Agda☆127Updated 7 months ago
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆56Updated 6 months ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- High level commands to declare a hierarchy based on packed classes☆97Updated last month
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- EPIT 2020 - Spring School on Homotopy Type Theory☆104Updated 3 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- An interactive theorem prover based on lambda-tree syntax☆94Updated last month
- ☆36Updated 3 years ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- Compiling Agda code to readable Haskell☆183Updated this week
- LaTeX code for a paper on lean's type theory☆132Updated 2 years ago