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 bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Revised Omega-categorical Typechecker☆27Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- STLC-related snippets in Agda☆16Updated 12 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
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 months ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- Agda to C compiler☆10Updated 3 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Collaborative work on reversible computing☆18Updated 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 4 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆55Updated 6 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated last year