statusfailed / cartographer-string-diagrammatic-reasoningLinks
☆44Updated 2 years ago
Alternatives and similar repositories for cartographer-string-diagrammatic-reasoning
Users that are interested in cartographer-string-diagrammatic-reasoning are comparing it to the libraries listed below
Sorting:
- Agda-style equational reasoning in Haskell☆54Updated 5 months ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated last year
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆84Updated 4 months ago
- An efficient graph library for Haskell☆38Updated 3 weeks ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Updated 7 years ago
- topos programming☆31Updated 6 years ago
- ☆32Updated 7 years ago
- Operad Programming Language in Haskell, by David Darais☆31Updated 11 years ago
- Simple Haskell package for efficiently indexable finite and infinite enumerations.☆12Updated 4 months ago
- Haskell library of algebraic topology☆24Updated 13 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Web front UI for interactive Haskell projects☆33Updated 5 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- A geometric algebra implementation in Haskell☆31Updated 5 years ago
- Vector & affine spaces, linear maps, and derivatives☆49Updated 3 months ago
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 6 years ago
- being the programs and code for a paper about general recursion☆26Updated 10 years ago
- Dependently typed elimination functions using singletons☆28Updated 8 months ago
- Lens interface for your filesystem☆22Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Some tools for provability logic☆37Updated 7 years ago
- Recursion schemes for Idris☆64Updated 7 years ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A formal verification of Linear Temporal Logic in Coq☆23Updated last week
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- Provides a type-safe way of working with permutations in Idris☆36Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- An in-memory full text search engine library. It lets you run full-text queries on a collection of your documents.☆49Updated 7 months ago