mortberg / yacctt
yacctt: Yet Another Cartesian Cubical Type Theory
☆75Updated 6 years ago
Alternatives and similar repositories for yacctt:
Users that are interested in yacctt are comparing it to the libraries listed below
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆70Updated 5 years ago
- ☆84Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆109Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- The Software Foundations book, in GHC☆82Updated 2 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 2 months ago
- Where my everyday research happens☆52Updated this week
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 4 years ago
- Recursion schemes for Idris☆64Updated 6 years ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- SPLV20 course notes☆108Updated 2 years ago
- Organization and planning for the Initial Types Club☆73Updated 2 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆43Updated 5 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 11 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Simplified Observational Type Theory☆81Updated last year
- TParsec - Total Parser Combinators in Idris☆93Updated last year
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- Generic Programming using True Sums of Products☆161Updated 2 months ago
- A language based on homotopy type theory with an interval☆85Updated 9 years ago
- A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2☆80Updated 4 years ago