dlicata335 / hott-agda
☆84Updated 7 years ago
Alternatives and similar repositories for hott-agda:
Users that are interested in hott-agda are comparing it to the libraries listed below
- Summer school on programming in Agda☆68Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 10 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 6 months ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆79Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- ☆29Updated 6 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- ☆45Updated 5 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Where my everyday research happens☆52Updated this week
- being the materials for Summer 2013's course☆112Updated last year
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆44Updated 2 years ago
- Implementing grep in Agda☆32Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Unification and type inference algorithms☆124Updated 9 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆75Updated 6 years ago