joelberkeley / spidrLinks
Accelerated machine learning with dependent types
☆101Updated 3 weeks ago
Alternatives and similar repositories for spidr
Users that are interested in spidr are comparing it to the libraries listed below
Sorting:
- A toolkit for enforcing logical specifications on neural networks☆121Updated this week
- Effective Algebraic Topology in Haskell☆90Updated last year
- Play/learn/work with me☆113Updated last month
- An interactive theorem prover for string diagrams☆124Updated last year
- Agda lecture notes for the Functional Programming course at TU Delft☆132Updated 6 months ago
- A Haskell probabilistic programming library.☆21Updated last month
- ☆126Updated last year
- Staged compilation with dependent types☆187Updated 8 months ago
- Compiling Agda code to readable Haskell☆196Updated last month
- ☆51Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆257Updated last week
- Total Parser Combinators in Agda☆132Updated 5 months ago
- A proof assistant for higher-dimensional type theory☆229Updated 4 months ago
- Fast equality saturation in Haskell☆93Updated last week
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 4 years ago
- A categorical programming language with effects☆291Updated 2 years ago
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- Heterogeneous automatic differentiation ("backpropagation") in Haskell☆193Updated 7 months ago
- Horn Clause Constraint Solving for Liquid Types☆157Updated last week
- A DSL for the internal language of a topos☆66Updated 6 months ago
- SPLV20 course notes☆114Updated 3 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆132Updated 5 months ago
- A simple raytracer written in Lean 4☆143Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆73Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆64Updated last year
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years 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…☆38Updated this week
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆83Updated 8 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 7 months ago