konn / smoothLinks
Exploring connections between automatic differentiation and smooth infinitesimal analysis, or smooth algebras
☆17Updated 4 years ago
Alternatives and similar repositories for smooth
Users that are interested in smooth are comparing it to the libraries listed below
Sorting:
- ☆23Updated 3 years ago
- A toolkit for higher-dimensional diagram rewriting.☆17Updated 3 years ago
- Schemes in Lean (v2)☆44Updated 5 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆65Updated 3 years ago
- Reverse-mode automatic differentiation with delimited continuations☆15Updated 2 years ago
- General-Purpose Computer Algebra System as an EDSL in Haskell☆93Updated last year
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆52Updated 3 weeks ago
- Simple theorem prover for the tope layer of Riehl and Shulman type theory with shapes.☆18Updated 2 years ago
- Notes on how to use the internal language of toposes in algebraic geometry☆60Updated last month
- Two-Level Type Theory☆28Updated 5 years ago
- Effective Algebraic Topology in Haskell☆90Updated last year
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆70Updated last year
- HoTT in Lean 3☆82Updated 5 years ago
- An arbitrary-precision differentiable programming language.☆36Updated 2 years ago
- A formalization of ML kernel languages☆28Updated last week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Building group theory from scratch in Lean☆60Updated 4 years ago
- Real number computation software☆127Updated 3 years ago
- M4 algebraic geometry course in Lean☆59Updated 5 years ago
- ☆47Updated 2 years ago
- A book about functional programming in Lean☆42Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆56Updated 2 weeks ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A Probability Theory Library for the Coq Theorem Prover☆54Updated 2 years ago
- A formalization of M-types in Agda☆35Updated 5 years ago
- A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]☆25Updated last month
- An Experiment in Haskell Symbolic Algebra☆73Updated 13 years ago
- HoTT Book formalisations in Rzk.☆19Updated last year
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library. See http://arxiv.org/abs/2507.12640.☆40Updated this week