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 library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 2 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Collaborative work on reversible computing☆18Updated 3 years ago
- STLC-related snippets in Agda☆16Updated 12 years ago
- being an experiment with potato power☆23Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 3 months ago
- ☆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 3 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- F-omega with interval kinds mechanized in Agda☆14Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- ☆17Updated 6 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆21Updated last year
- Agda to C compiler☆10Updated 2 years ago
- Miller/pattern unification in Agda☆65Updated 11 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year