batterseapower / latticesLinks
Fine-grained lattice primitives for Haskell
☆18Updated 7 years ago
Alternatives and similar repositories for lattices
Users that are interested in lattices are comparing it to the libraries listed below
Sorting:
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- A collection of proofs for some idris class instances - NOT MAINTAINED☆18Updated 10 years ago
- Symbolic logic expressions☆14Updated 4 years ago
- The Java Symbolic Simulator, part of SAW.☆10Updated 4 years ago
- A type theory based theorem proving library☆25Updated 13 years ago
- A categorical framework for circuit construction☆31Updated 8 years ago
- ☆10Updated 12 years ago
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 6 years ago
- The Elements of Statistical Learning in Haskell☆13Updated 7 years ago
- sliding fast fourier transform using haskell streaming☆13Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Combinatorial species in HoTT☆12Updated 10 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Typed DSLs for sorting☆19Updated 7 years ago
- Succinct vectors☆20Updated 6 years ago
- The algebra for formal power series in elements of the Weyl algebra☆18Updated 6 years ago
- An attempt to formalize unix cat in fiat☆12Updated 8 years ago
- Abstactions and concrete implementations of mutable containers☆14Updated 8 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated this week
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Dependently typed elimination functions using singletons☆28Updated 5 months ago
- being the programs and code for a paper about general recursion☆25Updated 10 years ago
- Selective applicative functors laws and theorems☆14Updated 5 years ago
- Build Status A Haskell implementation of the ZKBoo protocol for non-interactive zero-knowledge arguments of boolean circuits.☆18Updated 6 years ago
- Haskell routes using dependent types☆10Updated 8 years ago
- Extensible, Type Safe Error Handling in Haskell☆13Updated 4 years ago
- Auto-parallelizing Pure Functional Language☆27Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆12Updated 6 years ago
- Proof checker for propositional logic☆16Updated 7 years ago
- Interactive-diagrams☆39Updated 10 years ago