philzook58 / fib-anyonLinks
An implementation of Fibonacci Anyons in Haskell
☆22Updated 6 years ago
Alternatives and similar repositories for fib-anyon
Users that are interested in fib-anyon are comparing it to the libraries listed below
Sorting:
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Collaborative work on reversible computing☆25Updated 4 years ago
- A Haskell library for Approximating Exact Real Numbers (AERN) based on interval computation. (aern2 is a rewrite of aern.)☆23Updated 4 months ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Updated 6 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated 3 weeks ago
- A topological data analysis library for Haskell☆29Updated 4 years ago
- Haskell library for representing and manipulating Symbolic Regression Tree☆15Updated 2 weeks ago
- topos programming☆31Updated 7 years ago
- The Elements of Statistical Learning in Haskell☆13Updated 8 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 2 weeks ago
- Coordinate-free hypersurfaces as Haskell types☆41Updated 8 months ago
- An arbitrary-precision differentiable programming language.☆36Updated 2 years ago
- Synthetic Differential Geometry in Agda☆13Updated 10 years ago
- A categorical framework for circuit construction☆31Updated 9 years ago
- Finite field and algebraic extension field arithmetic☆53Updated last year
- Combinatorial species in HoTT☆12Updated 10 years ago
- Encoding of GHC Core inside MLIR☆19Updated 5 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Updated 4 years ago
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 6 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- Logical relation for predicative CC omega with booleans and an intensional identity type☆12Updated 7 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- Formal specification of the Haskell Language Report☆28Updated last month
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Code repository for our work on Quantum Pi☆10Updated last year