Скачать или смотреть Deriving Pure, Functional One-Pass Operations for Processing Tail-Aligned Lists

by Kathy Gray (on behalf of Jason Hemann and Daniel P. Friedman)

Scheme Workshop 2016
http://scheme2016.snow-fort.org/
paper: http://scheme2016.snow-fort.org/stati...
Sun 18 Sep 2016
Nara Kasugano International Forum
Nara, Japan


Abstract

We present a pattern of programming useful for creating naturally recursive solutions to a class of problems over linked lists of possibly different lengths, and perhaps even of unknown relative size. Our problems all require these lists be viewed as tail-aligned, rather than head aligned as is usual. These problems are simply-stated operations over familiar, benign data structures but they appear to require sophisticated programming techniques in order to achieve reasonable and elegant solutions.


Note that Kathy Gray bravely stepped in to give this talk on behalf of Jason Hemann when his arrival in Japan was delayed.