joelberkeley / spidr
Accelerated machine learning with dependent types
☆87Updated 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☆168Updated this week
- Fast equality saturation in Haskell☆83Updated 2 weeks ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 10 months ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆70Updated 8 years ago
- Demo for dependent types + runtime code generation☆66Updated 3 weeks ago
- Staged compilation with dependent types☆168Updated 2 weeks ago
- A Language with Dependent Data and Codata Types☆86Updated this week
- Theory and Applications of Lenses and Optics☆55Updated 2 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- A Haskell probabilistic programming library.☆18Updated last month
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆217Updated 3 weeks ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Benchmarks for capture-avoiding substitution☆113Updated 3 weeks ago
- A monadic library for symbolic evaluation☆59Updated 2 weeks ago
- 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
- being an operating system for typechecking processes☆124Updated last year
- 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 3 months ago
- Effective Algebraic Topology in Haskell☆90Updated 6 months ago
- Prototype of the system described in "Trace Types and Denotational Semantics for Sound Programmable Inference in Probabilistic Languages"☆10Updated 5 years ago
- high-performance cubical evaluation☆70Updated 3 months ago
- Lecture notes on realizability☆71Updated 2 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆123Updated 9 months ago
- A toolkit for enforcing logical specifications on neural networks☆86Updated last week
- 😎TT☆225Updated last year
- A minimal proof checker.☆74Updated 6 months ago
- Selected Papers of Dana S. Scott☆157Updated 8 months ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆64Updated 3 years ago
- Parser Combinator Library for Lean 4☆48Updated last week
- LaTeX code for a paper on lean's type theory☆131Updated 2 years ago
- A core language and API for dependently typed languages☆90Updated 3 weeks ago