bitonic / tog
☆26Updated 8 years ago
Alternatives and similar repositories for tog:
Users that are interested in tog are comparing it to the libraries listed below
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- The Prettiest Printer☆35Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- 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 tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- System F in coq.☆19Updated 10 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- ☆18Updated 2 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- Correctness of normalization-by-evaluation for STLC☆22Updated 5 years ago
- Mtac in Agda☆28Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- NbE course @ Chalmers☆28Updated 5 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months 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
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago