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:
- Files related to my paper "Continuity of Godel's system T functionals via effectful forcing". MFPS'2013. Electronic Notes in Theoretical …☆11Updated 4 years ago
- ☆18Updated 3 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 8 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Quasi-quoting library for agda☆18Updated 9 months ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 11 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆28Updated 3 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
- Meta-programming utilities for Agda.☆19Updated last month
- A Lean 4 formalization of partial combinatory algebras.☆14Updated 8 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 2 months ago
- my phd thesis☆26Updated last year
- Verified NbE via gluing in Agda☆11Updated last year
- ☆15Updated last year
- ☆29Updated 3 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- ☆21Updated 3 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆25Updated this week
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated 2 months ago
- ☆12Updated 6 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- ☆17Updated 3 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 4 months ago
- ☆13Updated last month