dspivak / dependent-typesLinks
☆12Updated 7 months ago
Alternatives and similar repositories for dependent-types
Users that are interested in dependent-types are comparing it to the libraries listed below
Sorting:
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 10 months ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Updated last year
- ☆15Updated 2 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- ☆17Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- my phd thesis☆26Updated last year
- Quasi-quoting library for agda☆18Updated 11 months ago
- Correctness of normalization-by-evaluation for STLC☆24Updated 6 years ago
- antifunext☆34Updated last year
- Organize mathematical thoughts☆20Updated 2 years ago
- Mechanizations of Type Theories☆32Updated last week
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Updated 5 months ago
- Extensions to cubical for categorical logic/type theory☆34Updated this week
- Research material of Erik Palmgren (1963–2019)☆21Updated 7 months ago
- ☆29Updated 3 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆23Updated 2 weeks ago
- ☆23Updated last year
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- ☆21Updated 3 years ago
- ☆30Updated 2 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 4 months ago
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- Verified NbE via gluing in Agda☆11Updated last year