joelberkeley / spidrLinks
Accelerated machine learning with dependent types
☆98Updated last month
Alternatives and similar repositories for spidr
Users that are interested in spidr are comparing it to the libraries listed below
Sorting:
- An interactive theorem prover for string diagrams☆120Updated 10 months ago
- A toolkit for enforcing logical specifications on neural networks☆110Updated this week
- Effective Algebraic Topology in Haskell☆91Updated last year
- Staged compilation with dependent types☆180Updated 4 months ago
- ☆50Updated last year
- A Haskell probabilistic programming library.☆19Updated last month
- ☆118Updated last year
- Fast equality saturation in Haskell☆87Updated 2 months ago
- Demo for dependent types + runtime code generation☆71Updated 7 months ago
- A proof assistant for higher-dimensional type theory☆213Updated 2 weeks ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 2 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆76Updated 8 years ago
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆247Updated last month
- Play/learn/work with me☆109Updated last week
- Ground Zero: Lean 4 HoTT Library☆66Updated 3 weeks ago
- Natty is a natural-language proof assistant with an embedded automatic prover for higher-order logic. It is in an early stage of develop…☆37Updated this week
- Theory and Applications of Lenses and Optics☆56Updated 3 years ago
- LaTeX code for a paper on lean's type theory☆147Updated 3 years ago
- Total Parser Combinators in Agda☆132Updated last month
- **(Deprecated: Merged into Lean 4)** Lean 4 build system and package manager with configuration files written in Lean.☆99Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- WIP collections library for Lean 4☆32Updated 4 months ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆130Updated 3 weeks ago
- A monadic library for symbolic evaluation☆69Updated 2 months ago
- A simple raytracer written in Lean 4☆140Updated last year
- 😎TT☆231Updated last month
- Functional Programming in Lean☆108Updated last week
- Compiling Agda code to readable Haskell☆192Updated last week
- Heterogeneous automatic differentiation ("backpropagation") in Haskell☆191Updated 3 months ago