fsestini / zsyntaxLinks
Automated theorem prover for a linear logic-based calculus for molecular biology.
☆12Updated 2 years ago
Alternatives and similar repositories for zsyntax
Users that are interested in zsyntax are comparing it to the libraries listed below
Sorting:
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- Haskell port of the Tensor Algebra COmpiler☆16Updated 5 years ago
- Fast parallel calculations in pure mathematics, e.g. Gröbner Bases☆16Updated 10 months ago
- Mathematical stories☆13Updated 4 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- A formalization of finite, constructive log analysis using linear temporal logic☆22Updated last month
- Automated Reasoning for the Working Mathematician☆11Updated 5 years ago
- An implementation of Fibonacci Anyons in Haskell☆22Updated 5 years ago
- A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''☆10Updated 6 years ago
- Compile time CAS(Computer Algebra System) for Haskell☆18Updated 5 years ago
- An Agda library for reasoning about asynchronous iterative algorithms and network routing problems☆27Updated last year
- I/O utilities and datasets for algebraic-graphs☆14Updated 2 years ago
- Monadic Constraint Programming framework☆28Updated 7 years ago
- A typechecker for WebAssembly, written in Agda (WIP)☆17Updated 7 years ago
- ☆23Updated 3 years ago
- ideally, this will become a pure Haskell library for Linear Integer/Mixed Programming☆16Updated 6 years ago
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library based on the paper "Provably correct, asymptotically eff…☆38Updated this week
- LinearOne is a prototype theorem prover for first-order (multiplicative, intuitionistic) linear logic.☆20Updated 4 years ago
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- Proof Object Transformation, Preserving Imp Embeddings: the first proof compiler to be formally proven correct☆16Updated 10 months ago
- Home of the fast-arithmetic library for number theory in ATS and Haskell.☆25Updated 11 months ago
- Paper: The simple essence of automatic differentiation☆22Updated 6 years ago
- Agda-style equational reasoning in Haskell☆53Updated 3 months ago
- Graded Dependent Type systems☆24Updated 2 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- Interactive Theorem Proving for students☆20Updated last year
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆35Updated 8 years ago
- Linear map categories in Agda☆5Updated 2 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