psg-mit / tower-oopsla22
OOPSLA'22 Artifact for "Tower: Data Structures in Quantum Superposition".
☆11Updated 11 months ago
Alternatives and similar repositories for tower-oopsla22:
Users that are interested in tower-oopsla22 are comparing it to the libraries listed below
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- Formalization of 2LTT in Agda☆14Updated last year
- Software Foundations using the Lean Theorem Prover☆23Updated 4 years ago
- Rust bindings for the Lean 4 proof assistant☆19Updated 7 months ago
- Racket Equivalence Graph Library☆18Updated 2 years ago
- Interpreter for the reversible functional language rFun☆36Updated 6 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆33Updated last year
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆32Updated 4 months ago
- A Small Quantum Intermediate Representation☆81Updated last week
- Library implementing type inference/checking functionality based on the Lean theorem prover☆50Updated 7 months ago
- Faceted execution in Racket☆12Updated 6 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 4 months ago
- SPSC: A Small Positive Supercompiler☆33Updated 8 months ago
- Distributions of Agda executable compiled into WebAssembly.☆16Updated 6 months ago
- Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]☆30Updated last month
- ☆13Updated 3 years ago
- Coq library for reasoning about quantum programs☆35Updated last week
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- EGraphs in OCaml☆63Updated last year
- Lean 4 port of Iris, a higher-order concurrent separation logic framework☆73Updated this week
- Formalization of type theory☆22Updated 3 years ago
- This package provides an interface and foundation for verified SAT reasoning☆51Updated 5 months ago
- An LLVM interface for Lean 4. (WIP)☆18Updated last year
- Code samples for Lean 4☆71Updated last year
- H.O.T.T. using rewriting in Agda☆40Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 6 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- ☆24Updated last week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago