Scalable symbolic-numeric set computations in Julia

A small package to simplify partial function application

Lazy, structured, and efficient operations with kernel matrices.

An efficient implementation of Thunk types for Julia enabling sophisticated lazy evaluation and deferred computation techniques

Provides an implementation of lazily represented Kronecker products with efficient in-place multiplies and solves.

Example package for the Julia Montreal meetup

Contains an implementation of lazily represented matrix structures that allow for the application of the Woodbury Identity.

LazyInverses provides a lazy wrapper for a matrix inverse, akin to Adjoint in Julia Base. See the README for example use cases.