favonia / hdtt2020-notesLinks
☆36Updated 3 years ago
Alternatives and similar repositories for hdtt2020-notes
Users that are interested in hdtt2020-notes are comparing it to the libraries listed below
Sorting:
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- high-performance cubical evaluation☆75Updated 5 months ago
- Formalizations of Gradually Typed Languages in Agda☆58Updated 8 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Finite sets, finite maps, multisets and generic sets☆50Updated this week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- my phd thesis☆26Updated last year
- Monadic effects and equational reasoning in Rocq☆74Updated last week
- Mechanizations of Type Theories☆32Updated 2 months ago
- Extensions to cubical for categorical logic/type theory☆32Updated this week
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- A cost-aware logical framework, embedded in Agda.☆67Updated 2 weeks ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆26Updated 2 weeks ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆78Updated last month
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- A formalization of the theory behind the mugen library☆19Updated last year