JacquesCarette / pi-dualLinks
Collaborative work on reversible computing
☆25Updated 4 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 library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Agda to C compiler☆10Updated 2 months ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- ☆16Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 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
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated last month
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆18Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year
- Revised Omega-categorical Typechecker☆27Updated last year
- Intrinsic Verification of Formal Grammar Theory☆27Updated 3 weeks ago
- being an experiment with potato power☆23Updated 5 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago