JacquesCarette / pi-dualLinks
Collaborative work on reversible computing
☆25Updated 3 years ago
Alternatives and similar repositories for pi-dual
Users that are interested in pi-dual are comparing it to the libraries listed below
Sorting:
- A Unifying Cartesian Cubical Set Model☆34Updated 5 years ago
- Intrinsic Verification of Formal Grammar Theory☆26Updated this week
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- ☆19Updated 3 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- ☆15Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- ☆17Updated 6 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 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
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 7 months ago
- ☆18Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years 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
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Normalization for Gödel's system T using a glueing model construction☆9Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Revised Omega-categorical Typechecker☆26Updated 8 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year