bitonic / togLinks
☆26Updated 8 years ago
Alternatives and similar repositories for tog
Users that are interested in tog are comparing it to the libraries listed below
Sorting:
- IO using sized types and copatterns☆35Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆28Updated 3 weeks ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- The Prettiest Printer☆34Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 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
- Mtac in Agda☆28Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- ☆18Updated 3 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- ☆12Updated 3 years ago
- my phd thesis☆26Updated 9 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 7 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Library implementation of "Generic description of well-scoped, well-typed syntaxes"☆12Updated 7 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago