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:
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆28Updated last year
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- A Haskell library for Approximating Exact Real Numbers (AERN) based on interval computation. (aern2 is a rewrite of aern.)☆23Updated 3 months ago
- Mathematical stories☆13Updated 4 years ago
- Haskell library for representing and manipulating Symbolic Regression Tree☆15Updated 3 weeks ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- Haskell port of the Tensor Algebra COmpiler☆16Updated 6 years ago
- An experimental category theory library for Lean☆50Updated 2 years ago
- A topological data analysis library for Haskell☆29Updated 4 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Code repository for our work on Quantum Pi☆10Updated last year
- Formal specification of the Haskell Language Report☆28Updated 3 weeks ago
- ☆32Updated 7 years ago
- The Elements of Statistical Learning in Haskell☆13Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Coordinate-free hypersurfaces as Haskell types☆41Updated 7 months ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 2 weeks ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- A certified semantics for relational programming workout.☆26Updated 5 years ago
- Implementation of books from Bourbaki's Elements of Mathematics in Coq [maintainer=@thery]☆31Updated 4 months ago
- Collaborative work on reversible computing☆25Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Verified compilation of space-efficient reversible circuits☆23Updated 6 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year