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
Sorting:
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library based on the paper "Provably correct, asymptotically eff…☆37Updated this week
- Julia embedded in Haskell☆53Updated 5 months ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆84Updated last week
- Paper and talk☆54Updated last year
- A toolkit for higher-dimensional diagram rewriting.☆17Updated 2 years ago
- Real number computation software☆124Updated 2 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated 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
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Combinators and types for easily building trainable neural networks using the backprop library☆33Updated 5 years ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated last month
- A graphical editor for graph-like structures☆98Updated last year
- Agda category theory library for denotational design☆50Updated 11 months ago
- Dependently Typed Metaprogramming Exercises☆23Updated 7 years ago
- Reference type checker for the Lean theorem prover☆16Updated 7 years ago
- ☆43Updated 3 years ago
- ☆44Updated last year
- Generation of abstract binding trees☆28Updated 6 months ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago
- Interpret Haskell programs into any cartesian closed category.☆60Updated 4 months ago
- A talk☆28Updated 4 years ago
- Fast equality saturation in Haskell☆84Updated 2 months ago
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆21Updated last year
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- ☆23Updated 2 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago