Bites of Lists - mapping and filtering sublists

Publikation: Konferencebidrag uden forlag/tidsskriftPaper uden forlag/tidsskriftForskningpeer review

Abstrakt

The idea of applying map and filter functions on consecutive sublists instead of on individual list elements is discussed and developed in this paper. A non-empty, consecutive sublist is called a bite. Both map and filter functions accept a function parameter - a bite function - which is responsible for returning a prefix bite of a list. We develop families of bite functions via a collection of higher-order bite generators. On top of the bite generators, a number of bite mapping and bite filtering functions are introduced. We illustrate the usefulness of bite mapping and filtering via examples drawn from a functional programming library that processes music, represented as Standard MIDI Files.
OriginalsprogEngelsk
Publikationsdato31 mar. 2011
Antal sider14
StatusUdgivet - 31 mar. 2011
Begivenhed4th European Lisp Symposium: els2011 - Hamburg, Tyskland
Varighed: 31 mar. 20111 apr. 2011

Konference

Konference4th European Lisp Symposium
Land/OmrådeTyskland
ByHamburg
Periode31/03/201101/04/2011

Citationsformater