joelberkeley / spidr
Accelerated machine learning with dependent types
☆92Updated this week
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☆172Updated this week
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 11 months ago
- Lecture notes on realizability☆73Updated last month
- Demo for dependent types + runtime code generation☆67Updated last month
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆125Updated 11 months ago
- ☆113Updated 8 months ago
- Effective Algebraic Topology in Haskell☆90Updated 6 months ago
- Logical manifestations of topological concepts, and other things, via the univalent point of view.☆247Updated this week
- An interactive theorem prover for string diagrams☆112Updated 5 months 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…☆35Updated this week
- Agda lecture notes for the Functional Programming course at TU Delft☆125Updated last year
- Theory and Applications of Lenses and Optics☆54Updated 2 years ago
- Staged compilation with dependent types☆169Updated 2 weeks ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- The agda-unimath library☆243Updated this week
- Benchmarks for capture-avoiding substitution☆113Updated last week
- A work-in-progress core language for Agda, in Agda☆46Updated last week
- Play/learn/work with me☆100Updated 7 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆70Updated 8 years ago
- High level commands to declare a hierarchy based on packed classes☆97Updated last month
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Categorical Logic Notes☆77Updated 3 years ago
- A toolkit for enforcing logical specifications on neural networks☆86Updated this week
- Total Parser Combinators in Agda☆126Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆217Updated 2 weeks ago
- A Haskell probabilistic programming library.☆18Updated last week
- A monadic library for symbolic evaluation☆59Updated last month
- Selected Papers of Dana S. Scott☆158Updated 9 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆80Updated 8 years ago