andrejbauer / higher-rank-syntaxLinks
☆17Updated 2 months ago
Alternatives and similar repositories for higher-rank-syntax
Users that are interested in higher-rank-syntax are comparing it to the libraries listed below
Sorting:
- A Lean 4 formalization of partial combinatory algebras.☆14Updated 7 months ago
- ☆18Updated 3 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 7 months ago
- ☆12Updated 5 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Experiments with Realizability in Univalent Type Theory☆18Updated 10 months ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated last month
- Meta-programming utilities for Agda.☆19Updated 3 weeks ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 2 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- ☆15Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated last month
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Multimode simple type theory as an Agda library.☆23Updated 11 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- 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
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Quasi-quoting library for agda☆18Updated 9 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Files related to my paper "Continuity of Godel's system T functionals via effectful forcing". MFPS'2013. Electronic Notes in Theoretical …☆11Updated 3 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- Spartan implementation of H.O.T.T.☆25Updated 3 years ago