conal / talk-2021-can-tensor-programming-be-liberatedLinks
Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"
☆64Updated 3 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 7 months ago
- ☆35Updated last year
- An equational theorem prover based on Knuth-Bendix completion☆52Updated last week
- An elegant implementation of discrete diffgeo in haskell☆33Updated 5 years ago
- Idris, make back end, in 15 minutes, reusable, concise: https://bitbucket.org/thautwarm/ppl2020-idris-codegen-backend/src/master☆24Updated 5 years ago
- Reference type checker for the Lean theorem prover☆16Updated 7 years ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library based on the paper "Provably correct, asymptotically eff…☆38Updated this week
- A talk☆28Updated 4 years ago
- A graphical editor for graph-like structures☆99Updated last year
- A Datalog extension to reason about time with CTL operators☆14Updated 5 years ago
- Generation of abstract binding trees☆28Updated 8 months ago
- An arbitrary-precision differentiable programming language.☆36Updated 2 years ago
- A toolkit for higher-dimensional diagram rewriting.☆17Updated 2 years ago
- Mathematical stories☆13Updated 4 years ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆84Updated 2 months ago
- Real number computation software☆125Updated 2 years ago
- A verified compiler for a lazy functional language☆36Updated 3 weeks ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- ☆23Updated 3 years ago
- An extended typed Lambda Calculus☆21Updated 11 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆40Updated last year
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated last year
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- A mini-book on category theory. Superseded by https://github.com/jonsterling/forest☆52Updated 2 years ago
- an optimizing curry compiler☆14Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- An implementation of Haskell’s MVars in Racket☆29Updated 9 months ago