conal / talk-2021-can-tensor-programming-be-liberatedView external linksLinks
Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"
☆66Oct 31, 2021Updated 4 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:
- Paper and talk☆55Jul 11, 2023Updated 2 years ago
- Functional Linear Algebra with Block Matrices☆11Feb 17, 2022Updated 3 years ago
- Generalized Convolution and Efficient Language Recognition☆18Jul 20, 2019Updated 6 years ago
- a compiler from a lambda language to an assembly language, as a rewrite system☆16Sep 23, 2025Updated 4 months ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Feb 28, 2019Updated 6 years ago
- ☆41Nov 9, 2023Updated 2 years ago
- Type Your Matrices For Great Good☆29Jul 22, 2020Updated 5 years ago
- I/O utilities and datasets for algebraic-graphs☆14Aug 29, 2022Updated 3 years ago
- Omit fields for instance deriving☆37Jun 5, 2020Updated 5 years ago
- UCI-compatible chess engine in OCaml.☆14Apr 20, 2025Updated 9 months ago
- Haskell implementation of Glumpy☆12Jun 21, 2021Updated 4 years ago
- Optional argument checks allow you to omit them when performance is critical.☆10Aug 31, 2022Updated 3 years ago
- Benchmarking algebraic effect handler implementations☆27Jun 6, 2021Updated 4 years ago
- Extensible sums and products for Haskell☆19Apr 29, 2023Updated 2 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Denotational Semantics of the Untyped Lambda Calculus☆17Feb 5, 2025Updated last year
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆85May 6, 2025Updated 9 months ago
- Staged Streams and other stuff☆19Jul 10, 2022Updated 3 years ago
- A Galilean revolution for computing: Unboundedly scalable reliability and efficiency☆15Aug 6, 2023Updated 2 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- An experiment in functional interface design☆24Oct 29, 2016Updated 9 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Beseder: make impossible state transitions impossible☆31Mar 21, 2020Updated 5 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Jul 11, 2016Updated 9 years ago
- A categorical semantics library in Agda.☆16Dec 22, 2019Updated 6 years ago
- Resumable and copyable functions a.k.a. coroutines for Julia, with optional function-specific globals.☆21Dec 28, 2025Updated last month
- ☆33Jan 14, 2021Updated 5 years ago
- Hedgehog will eat your typeclass bugs☆57Jun 3, 2025Updated 8 months ago
- A Haskell implementation of "Functional pearl: a SQL to C compiler in 500 lines of code"☆46Feb 15, 2019Updated 7 years ago
- Pull your compiler up with abstract bootstraps.☆31Dec 15, 2022Updated 3 years ago
- checkers for algebra driven design☆34Nov 19, 2022Updated 3 years ago
- A compiler to IA32 and REPL for maru in maru under 7k s-expressions☆18Apr 17, 2020Updated 5 years ago
- Haskell bindings for MLIR☆120Jan 5, 2026Updated last month
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Jul 31, 2024Updated last year
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- Quick explanation of eliminating left recursion in Haskell parsers☆57Sep 13, 2021Updated 4 years ago
- An efficient symbolic term rewriting engine☆78Dec 23, 2020Updated 5 years ago
- classical sequent calculus, embedded in Haskell☆21Aug 24, 2025Updated 5 months ago
- Notes of various papers regaridng free monads and extensible effects☆20Oct 10, 2019Updated 6 years ago