joelberkeley / spidr
Accelerated machine learning with dependent types
☆93Updated 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☆190Updated this week
- Demo for dependent types + runtime code generation☆69Updated 2 months ago
- Effective Algebraic Topology in Haskell☆90Updated 7 months ago
- A Haskell probabilistic programming library.☆19Updated last week
- 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
- Staged compilation with dependent types☆171Updated 3 weeks ago
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆224Updated last month
- Agda lecture notes for the Functional Programming course at TU Delft☆125Updated last year
- Agda formalisation of the Introduction to Homotopy Type Theory☆123Updated 3 years ago
- Lecture notes on realizability☆72Updated 2 months ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆125Updated last year
- Fast equality saturation in Haskell☆84Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆58Updated last year
- A work-in-progress core language for Agda, in Agda☆52Updated 3 weeks ago
- Benchmarks for capture-avoiding substitution☆113Updated this week
- LaTeX code for a paper on lean's type theory☆132Updated 2 years ago
- A monadic library for symbolic evaluation☆60Updated this week
- Ground Zero: Lean 4 HoTT Library☆60Updated last month
- ☆47Updated 11 months ago
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- LLVM code generation in Haskell☆54Updated 6 months ago
- Functional Programming in Lean☆78Updated last week
- Logical manifestations of topological concepts, and other things, via the univalent point of view.☆254Updated this week
- A Language with Dependent Data and Codata Types☆104Updated this week
- Bologna Optimal Higher-Order Machine, Version 1.1☆70Updated 8 years ago
- Materials for the course "theorem prover lab: applications in programming languages" at KIT, SS2022 edition☆19Updated 2 years ago
- Compiling Agda code to readable Haskell☆187Updated last week
- A toolkit for enforcing logical specifications on neural networks☆90Updated last week
- High level commands to declare a hierarchy based on packed classes☆99Updated last week
- A bidirectional type checker☆63Updated 7 years ago