Quantomatic is a tool for doing automated graph rewriting.
☆171Oct 3, 2019Updated 6 years ago
Alternatives and similar repositories for quantomatic
Users that are interested in quantomatic are comparing it to the libraries listed below
Sorting:
- Python library for quantum circuit rewriting and optimisation using the ZX-calculus☆496Feb 26, 2026Updated last week
- Sample projects for Quantomatic☆12Apr 25, 2020Updated 5 years ago
- translations of a lambda abstraction to combinations of operators☆18Sep 6, 2019Updated 6 years ago
- Combinatorial species in HoTT☆12May 23, 2015Updated 10 years ago
- ☆45Dec 6, 2022Updated 3 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Feb 21, 2016Updated 10 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆58Jun 17, 2022Updated 3 years ago
- IO using sized types and copatterns☆36Apr 14, 2021Updated 4 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- A language based on homotopy type theory with an interval☆84Apr 5, 2015Updated 10 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- ☆14Jul 18, 2024Updated last year
- A performance orientated QGL compiler.☆13Dec 19, 2023Updated 2 years ago
- ☆16Feb 18, 2025Updated last year
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated 2 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Dec 21, 2019Updated 6 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Nov 12, 2020Updated 5 years ago
- Typed DSLs for sorting☆20Feb 16, 2018Updated 8 years ago
- The Python toolkit for computing with string diagrams.☆405Feb 26, 2026Updated last week
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- Compositional type checking for Haskell☆38Apr 14, 2011Updated 14 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36May 14, 2017Updated 8 years ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆14Feb 13, 2018Updated 8 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- An Idris type provider for communicating type-checkable protocols.☆26Nov 6, 2017Updated 8 years ago
- A graphical tool for the ZX calculus☆84Updated this week
- Type level algebraic "proofs" using lens combinators☆19Jul 26, 2019Updated 6 years ago
- Orchard Opetopic Proof Assistant☆29May 2, 2016Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago