joelberkeley / spidrLinks
Accelerated machine learning with dependent types
☆97Updated this week
Alternatives and similar repositories for spidr
Users that are interested in spidr are comparing it to the libraries listed below
Sorting:
- Effective Algebraic Topology in Haskell☆91Updated 10 months ago
- An interactive theorem prover for string diagrams☆119Updated 9 months ago
- A toolkit for enforcing logical specifications on neural networks☆107Updated this week
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆130Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆244Updated 4 months ago
- Staged compilation with dependent types☆177Updated 2 months ago
- LaTeX code for a paper on lean's type theory☆141Updated 3 years ago
- Fast equality saturation in Haskell☆86Updated 3 weeks ago
- Agda lecture notes for the Functional Programming course at TU Delft☆128Updated 3 weeks ago
- A simple raytracer written in Lean 4☆140Updated last year
- A proof assistant for higher-dimensional type theory☆206Updated this week
- Selected Papers of Dana S. Scott☆162Updated last year
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- ☆49Updated last year
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 3 years ago
- A Haskell probabilistic programming library.☆19Updated 3 months ago
- Play/learn/work with me☆106Updated 2 months ago
- ☆117Updated last year
- The agda-unimath library☆261Updated last week
- Total Parser Combinators in Agda☆131Updated 2 years ago
- 😎TT☆231Updated last year
- Lecture notes on realizability☆74Updated 5 months ago
- **(Deprecated: Merged into Lean 4)** Lean 4 build system and package manager with configuration files written in Lean.☆99Updated last year
- Horn Clause Constraint Solving for Liquid Types☆150Updated 2 weeks ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Very controlled natural language tactics for Lean☆64Updated last year
- Write C shims from within Lean code.☆66Updated 3 weeks ago
- Benchmarks for capture-avoiding substitution☆119Updated 2 months ago
- Compiling Agda code to readable Haskell☆190Updated last week