joelberkeley / spidr
Accelerated machine learning with dependent types
☆93Updated 3 weeks ago
Alternatives and similar repositories for spidr:
Users that are interested in spidr are comparing it to the libraries listed below
- A proof assistant for higher-dimensional type theory☆178Updated this week
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Staged compilation with dependent types☆171Updated this week
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated 11 months ago
- A Haskell probabilistic programming library.☆19Updated last month
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆125Updated last year
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 3 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 6 months ago
- Fast equality saturation in Haskell☆84Updated 2 months ago
- A monadic library for symbolic evaluation☆60Updated last week
- Lecture notes on realizability☆72Updated 2 months ago
- Effective Algebraic Topology in Haskell☆90Updated 7 months ago
- 😎TT☆225Updated last year
- Ground Zero: Lean 4 HoTT Library☆57Updated last week
- Categorical Logic Notes☆78Updated 3 years ago
- LaTeX code for a paper on lean's type theory☆132Updated 2 years ago
- Logical manifestations of topological concepts, and other things, via the univalent point of view.☆253Updated this week
- Very controlled natural language tactics for Lean☆62Updated last year
- A work-in-progress core language for Agda, in Agda☆51Updated this week
- A toolkit for enforcing logical specifications on neural networks☆88Updated this week
- Benchmarks for capture-avoiding substitution☆113Updated last week
- Agda lecture notes for the Functional Programming course at TU Delft☆125Updated last year
- Bologna Optimal Higher-Order Machine, Version 1.1☆70Updated 8 years ago
- ☆126Updated 3 years ago
- ☆47Updated 11 months ago
- HoTT in Lean 3☆79Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆97Updated 6 months ago
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆219Updated last month
- ☆21Updated 3 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago