conal / talk-2021-can-tensor-programming-be-liberatedLinks
Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"
☆66Updated 4 years ago
Alternatives and similar repositories for talk-2021-can-tensor-programming-be-liberated
Users that are interested in talk-2021-can-tensor-programming-be-liberated are comparing it to the libraries listed below
Sorting:
- Julia embedded in Haskell☆52Updated last year
- Idris, make back end, in 15 minutes, reusable, concise: https://bitbucket.org/thautwarm/ppl2020-idris-codegen-backend/src/master☆24Updated 5 years ago
- An elegant implementation of discrete diffgeo in haskell☆34Updated 6 years ago
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library. See http://arxiv.org/abs/2507.12640.☆42Updated this week
- A toolkit for higher-dimensional diagram rewriting.☆18Updated 3 years ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆85Updated 8 months ago
- Generation of abstract binding trees☆27Updated 3 months ago
- Reverse-mode automatic differentiation with delimited continuations☆15Updated 2 years ago
- Operad Programming Language in Haskell, by David Darais☆33Updated 11 years ago
- A graphical editor for graph-like structures☆102Updated 2 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated last month
- GATlab: a computer algebra system based on generalized algebraic theories (GATs)☆38Updated 2 weeks ago
- Brent's PhD thesis.☆69Updated 9 years ago
- Paper: The simple essence of automatic differentiation☆23Updated 7 years ago
- Combinators and types for easily building trainable neural networks using the backprop library☆34Updated 5 years ago
- The Brown Benchmark for Table Types (B2T2)☆65Updated 5 months ago
- Slides and handwritten notes on the course on models of programming languages☆52Updated 5 years ago
- An arbitrary-precision differentiable programming language.☆36Updated 2 years ago
- An extended typed Lambda Calculus☆21Updated 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
- Real number computation software☆129Updated 3 years ago
- Automatic Differentiation using Pseudo Lenses. Neat.☆20Updated 5 years ago
- A Datalog extension to reason about time with CTL operators☆14Updated 6 years ago
- I/O utilities and datasets for algebraic-graphs☆14Updated 3 years ago
- Interpret Haskell programs into any cartesian closed category.☆68Updated last month
- Reference type checker for the Lean theorem prover☆17Updated 7 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆27Updated 2 years ago
- A verified compiler for a lazy functional language☆37Updated last week
- A talk☆29Updated 4 years ago
- Two-Level Type Theory☆28Updated 6 years ago