conal / talk-2021-can-tensor-programming-be-liberated
Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"
☆64Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for talk-2021-can-tensor-programming-be-liberated
- Julia embedded in Haskell☆53Updated 5 years ago
- Template to effortlessly build math-rich websites☆39Updated 2 years ago
- Slides and handwritten notes on the course on models of programming languages☆50Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 2 months ago
- Accelerated machine learning with dependent types☆79Updated this week
- A graphical editor for graph-like structures☆96Updated 11 months ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆83Updated last year
- Operad Programming Language in Haskell, by David Darais☆31Updated 10 years ago
- Tutorial series introducing Agda to the people at BCAM☆26Updated 2 years ago
- Agda category theory library for denotational design☆48Updated 5 months ago
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library based on the paper "Provably correct, asymptotically eff…☆33Updated this week
- Interpret Haskell programs into any cartesian closed category.☆57Updated last week
- A toolkit for higher-dimensional diagram rewriting.☆15Updated 2 years ago
- Fast equality saturation in Haskell☆77Updated 6 months ago
- ☆33Updated 7 months ago
- Theory and Applications of Lenses and Optics☆53Updated 2 years ago
- A talk☆28Updated 3 years ago
- Quantitative Type Theory implementation☆54Updated 3 years ago
- GATlab: a computer algebra system based on generalized algebraic theories (GATs)☆24Updated 3 weeks ago
- Formalizing linear algebra in Agda by representing matrices as functions☆25Updated 10 months ago
- Basics of the dependently-typed functional language Agda ^_^☆38Updated 2 years ago
- An arbitrary-precision differentiable programming language.☆34Updated last year
- being a particular fragment of Haskell, extended to a proof system☆22Updated 2 weeks ago
- Demo for dependent types + runtime code generation☆48Updated this week
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆38Updated 2 years ago
- A mini-book on category theory. Superseded by https://github.com/jonsterling/forest☆51Updated last year
- Dependently Typed Metaprogramming Exercises☆22Updated 6 years ago
- A usable type system for call by push-value☆28Updated 4 years ago