choener / ADPfusionLinks
Efficient, high-level dynamic programming
☆28Updated 2 years ago
Alternatives and similar repositories for ADPfusion
Users that are interested in ADPfusion are comparing it to the libraries listed below
Sorting:
- Real number computation software☆129Updated 3 years ago
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 6 years ago
- A Haskell probabilistic programming library.☆21Updated this week
- A Haskell library for Approximating Exact Real Numbers (AERN) based on interval computation. (aern2 is a rewrite of aern.)☆23Updated 5 months ago
- ☆52Updated last year
- ☆50Updated 2 years ago
- Lean4 port of Arduino balance car controller☆50Updated 4 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated this week
- ☆86Updated 8 years ago
- HoTT in Lean 3☆81Updated 5 years ago
- General-Purpose Computer Algebra System as an EDSL in Haskell☆95Updated last year
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- Datatypes as quotients of polynomial functors☆41Updated 5 years ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆85Updated 4 years ago
- Parallel Environment for optimal Lambda Calculus Reduction☆28Updated 3 years ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆17Updated last month
- Agda category theory library for denotational design☆57Updated 2 weeks ago
- Schemes in Lean (v2)☆43Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 3 years ago
- ☆32Updated 7 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆73Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆57Updated this week
- ☆27Updated last year
- Notes on how to use the internal language of toposes in algebraic geometry☆60Updated last month
- Operad Programming Language in Haskell, by David Darais☆33Updated 11 years ago
- Simple theorem prover for the tope layer of Riehl and Shulman type theory with shapes.☆18Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆74Updated 3 months ago