berenoguz / Math
Formalization of Mathematics using Type Theory of Agda Programming Language
☆11Updated 7 years ago
Alternatives and similar repositories for Math
Users that are interested in Math are comparing it to the libraries listed below
Sorting:
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆22Updated 6 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- ☆45Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 2 months ago
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 4 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆24Updated last week
- Agda formalisation of NbE for λ□☆18Updated 7 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- ☆23Updated 10 months ago
- NbE course @ Chalmers☆28Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆19Updated 9 months ago
- An approach to higher algebra in type theory☆23Updated 5 years ago
- Where my everyday research happens☆52Updated 2 weeks ago
- Category theory and algebra☆28Updated 8 years ago
- being the materials for Summer 2013's course☆112Updated 2 years ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- Formal semantics in Agda.☆16Updated 9 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year