conal / talk-2021-can-tensor-programming-be-liberated
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
- Julia embedded in Haskell☆53Updated last month
- A graphical editor for graph-like structures☆98Updated last year
- A framework for applied category theory in the Julia language☆11Updated 2 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆55Updated 9 months ago
- Slides and handwritten notes on the course on models of programming languages☆50Updated 4 years ago
- An equational theorem prover based on Knuth-Bendix completion☆49Updated 2 months ago
- Generation of abstract binding trees☆27Updated 3 months ago
- Monadic expressions and sequences for Julia☆32Updated 4 months ago
- Real number computation software☆123Updated 2 years ago
- Reference type checker for the Lean theorem prover☆14Updated 6 years ago
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- GATlab: a computer algebra system based on generalized algebraic theories (GATs)☆25Updated this week
- BQN implementation in Julia☆17Updated 2 years ago
- Paper and talk☆50Updated last year
- Operad Programming Language in Haskell, by David Darais☆31Updated 10 years ago
- An arbitrary-precision differentiable programming language.☆34Updated last year
- A toolkit for higher-dimensional diagram rewriting.☆17Updated 2 years ago
- Implementations of algebraic rewriting techniques like DPO, SPO, SqPO.☆28Updated 2 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆33Updated last year
- Idris, make back end, in 15 minutes, reusable, concise: https://bitbucket.org/thautwarm/ppl2020-idris-codegen-backend/src/master☆24Updated 4 years ago
- A talk☆28Updated 3 years ago
- A verified compiler for a lazy functional language☆33Updated last week
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- ☆33Updated 9 months ago
- Combinators and types for easily building trainable neural networks using the backprop library☆33Updated 4 years ago
- Automatic Differentiation using Pseudo Lenses. Neat.☆19Updated 4 years ago
- (early experiments toward) a version-control system for structured data☆17Updated last year
- Apple array system☆60Updated this week
- source code for the bondi programming language☆40Updated 5 years ago