JacquesCarette / pi-dual
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
- A bare-bones LCF-style proof assistant☆22Updated 5 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 11 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 5 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 7 months ago
- ☆17Updated 6 years ago
- a version of the 2048 game for Coq☆22Updated last year
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- ☆18Updated 2 years ago
- A certified semantics for relational programming workout.☆26Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- Monoidal Toposes of Grammars and Semantic Actions☆19Updated this week
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- ☆15Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Experimental type-checker for internally parametric type theory☆32Updated this week
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Collaborative work on reversible computing☆18Updated 2 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- being bits and pieces I'm inclined to leave lying around☆49Updated 3 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago