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:
- An elegant implementation of discrete diffgeo in haskell☆34Updated 6 years ago
- 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
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library. See http://arxiv.org/abs/2507.12640.☆43Updated last week
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆85Updated 8 months ago
- A talk☆29Updated 4 years ago
- ☆44Updated 3 years ago
- Operad Programming Language in Haskell, by David Darais☆33Updated 11 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆27Updated 2 years ago
- An extended typed Lambda Calculus☆21Updated last year
- A graphical editor for graph-like structures☆103Updated 2 years ago
- ☆37Updated last year
- Slides and handwritten notes on the course on models of programming languages☆53Updated 5 years ago
- Template to effortlessly build math-rich websites☆40Updated 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
- Real number computation software☆129Updated 3 years ago
- Automated Reasoning for the Working Mathematician☆11Updated 6 years ago
- Generation of abstract binding trees☆27Updated 4 months ago
- I/O utilities and datasets for algebraic-graphs☆14Updated 3 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- Reference type checker for the Lean theorem prover☆17Updated 7 years ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated 3 weeks ago
- Higher-order, higher-order automatic differentiation☆30Updated 6 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Updated last year
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A Datalog extension to reason about time with CTL operators☆14Updated 6 years ago
- Agda category theory library for denotational design☆57Updated last week
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- A mini-book on category theory. Superseded by https://github.com/jonsterling/forest☆53Updated 3 years ago
- Two-Level Type Theory☆28Updated 6 years ago