-
Notifications
You must be signed in to change notification settings - Fork 26
References
Saul Shanabrook edited this page Dec 1, 2018
·
7 revisions
-
Other repos
- https://github.com/davidbrochart/uarray
- https://github.com/saulshanabrook/moa
- https://github.com/hameerabbasi/arrayish
- https://github.com/mrocklin/symbolic-array
- https://github.com/coneoproject/COFFEE
- https://github.com/cornellius-gp/gpytorch/blob/01cf8a298fc53fb77d30ee649fbac6cb8c54826e/gpytorch/lazy/lazy_tensor.py#L16
- http://tensorly.org/stable/home.html
-
NEP 18 — A dispatch mechanism for NumPy’s high level array functions
-
[Numpy-discussion] Proposal to accept NEP-18, array_function protocol
-
Blog posts by Matthew Rocklin
-
Massiv: Efficient Haskell Arrays featuring Parallel computation
-
Lenore Mullin
-
MatchPy, pattern matching
-
Magne Haveraaen - head of Bergen Language Design Laboratory
-
Specification of Generic APIs, or: Why Algebraic May Be Better Than Pre/Post
- algebraic specifications have history in CS
-
Specification techniques for data abstractions - 1975
- groups of operations can be partitioned by whether they create class we care about, transform it, or create other class. This corresponds to some of our taxonomy of NP methods, those operations which create NP arrays, transform them, or turn them into something else. Another good way to think about array library. We have operations that take things external and turn them into abstract arrays (reading existing data, creating lazily from sequence), operations that transform arrays (MoA operations), and then operations which leave the system (writing to storage, making concrete).
- An array API for finite difference methods.
-
Specification of Generic APIs, or: Why Algebraic May Be Better Than Pre/Post