A Smart View on Datatypes

MAURO JASKELIOFF; EXEQUIEL RIVAS

Vancouver

Conferencia; Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming; 2015

Left-nested list concatenations, left-nested binds on the free monad, and left-nested choices in many non-determinism monads have an algorithmically bad performance. Can we solve this problem without losing the ability to pattern-match on the computation? Surprisingly, there is a deceptively simple solution: use a smart view to pattern-match on the datatype. We introduce the notion of smart view and show how it solves the problem of slow left- nested operations. In particular, we use the technique to obtain fast and simple implementations of lists, of free monads, and of two non-determinism monads.