msr-quarc / ReVerC
Verified compilation of space-efficient reversible circuits
☆19Updated 5 years ago
Related projects ⓘ
Alternatives and complementary repositories for ReVerC
- An approach to higher algebra in type theory☆23Updated 4 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- Notes and handouts from OPLSS 2019☆34Updated 5 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆42Updated 7 years ago
- STLC-related snippets in Agda☆15Updated 11 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- Collaborative work on reversible computing☆17Updated 2 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆29Updated 3 weeks ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 5 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A quick reference for mapping Coq tactics to Lean tactics☆69Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- ☆13Updated 5 years ago
- F-omega with interval kinds mechanized in Agda☆13Updated 3 months ago
- A mechanized proof of type safety for Featherweight Java using Coq☆16Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆16Updated 7 years ago
- A quantum circuit language and formal verification tool☆92Updated 11 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Generation of abstract binding trees☆27Updated last month
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- Work in progress☆34Updated 4 months ago
- A (formalised) general definition of type theories☆56Updated 3 years ago
- A Henkin-style completeness proof for the modal logic S5☆13Updated 3 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- Access hint databases from tactics.☆12Updated 4 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- HoTT in Lean 3☆75Updated 4 years ago