mortberg / yacctt
yacctt: Yet Another Cartesian Cubical Type Theory
☆74Updated 6 years ago
Related projects ⓘ
Alternatives and complementary repositories for yacctt
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- The Software Foundations book, in GHC☆83Updated 3 weeks ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆119Updated 2 months ago
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Unification and type inference algorithms☆123Updated 9 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Where my everyday research happens☆53Updated last week
- being the materials for Summer 2013's course☆110Updated last year
- A TACtic library for Agda☆48Updated 2 months ago
- ☆82Updated 7 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆70Updated 2 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- A language based on homotopy type theory with an interval☆84Updated 9 years ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated 3 weeks ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Agda bindings to SMT-LIB2 compatible solvers.☆95Updated last month
- Various data structures for use in the Idris Language.☆95Updated 4 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- ☆28Updated 6 years ago
- ☆45Updated 5 years ago
- SPLV20 course notes☆106Updated 2 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago