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 6 months ago
- Slides and handwritten notes on the course on models of programming languages☆51Updated 4 years ago
- A graphical editor for graph-like structures☆97Updated last year
- Paper and talk☆54Updated last year
- Generation of abstract binding trees☆28Updated 8 months ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Higher Order Reverse Derivatives Efficiently - Automatic Differentiation library based on the paper "Provably correct, asymptotically eff…☆38Updated this week
- An equational theorem prover based on Knuth-Bendix completion☆52Updated 2 months ago
- A toolkit for higher-dimensional diagram rewriting.☆17Updated 2 years ago
- Datatypes as quotients of polynomial functors☆36Updated 5 years ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆84Updated last month
- An arbitrary-precision differentiable programming language.☆36Updated last year
- (early experiments toward) a version-control system for structured data☆17Updated last year
- Real number computation software☆125Updated 2 years ago
- Two-Level Type Theory☆28Updated 5 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated last year
- Agda category theory library for denotational design☆51Updated last year
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 7 years ago
- GATlab: a computer algebra system based on generalized algebraic theories (GATs)☆29Updated last month
- Idris, make back end, in 15 minutes, reusable, concise: https://bitbucket.org/thautwarm/ppl2020-idris-codegen-backend/src/master☆24Updated 5 years ago
- ☆35Updated last year
- Brent's PhD thesis.☆64Updated 9 years ago
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Reference type checker for the Lean theorem prover☆16Updated 7 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Pull your compiler up with abstract bootstraps.☆31Updated 2 years ago
- Theory and Applications of Lenses and Optics☆54Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 3 years ago