#3 Dann Toliver on Fast Functional Lists

Dann Toliver (https://twitter.com/dann) will be presenting the paper Fast Functional Lists, Hash-Lists, Deques and Variable Length Arrays (http://infoscience.epfl.ch/record/64410/files/techlists.pdf) by Phil Bagwell.

Note that we have moved the start time an hour earlier based on feedback we got that things were happening too late. Keep that feedback coming!

***

In this paper Bagwell introduces the VList, an alternative to the classic linked list that retains its persistence and easy extensibility while adding in the fast random access indexing typical of arrays.

We'll explore this data structure from a variety of perspectives, and look at several modifications that extend its power: the VArray, a resizable array variant; a catenable deque using the VDList and VCat; and an average constant time hash-list.

We'll also look at the impacts of this data structure on thread safety, garbage collection, Lisps (via Visp, a Lisp using the VList as its basic data structure), and multi-dimensional data structures.

Doors open at 6:30 pm, presentation will begin at 7:00 pm. There will be food and refreshments provided by Shopify.

***

Author of Daimio (http://daimio.org/). Makes things at Bento Box (http://bentobox.net/). Co-founder of Bento Miso (https://bentomiso.com/), a non-profit collaborative workspace focused on lowering barriers to entry in the technology world. Likes math.