NYFPN Reading Group

Pickler Combinators by Andrew Kennedy.

Here is a LtU entry.

Incremental Algorithms on Lists
Johan Jeuring
http://citeseer.ist.psu.edu/6782.html
Incremental computations can improve the performance of interactive programs such as spreadsheet programs, program development environments, text editors, etc. Incremental algorithms describe how to compute a required value depending on the input, after the input has been edited. By considering the possible different edit actions on the data type lists, the basic data type used in spreadsheet programs and text editors, we define incremental algorithms on lists. Some theory for the construction...

I think we should do something vanilla; something highly practical; something everyone can use.

Click here for the paper.

Oleg recently gave a talk about CGI programming in OCaml using delimited continuations. He put his talk slides annotated with thoughts on what he might say on the web at:

http://okmij.org/ftp/Computation/Fest2008-talk-notes.pdf

Here is an Ocaml list email describing the talk:

http://caml.inria.fr/pub/ml-archives/caml-list/2008/04/3e4b4721d97f23605...

Data Types a la Carte by Wouter Swierstra.

Here is a LtU entry.

Tangible Functional Programming by Conal Elliot.

Here is an LtU entry.

This is a paper that I've been meaning to read: Finger trees: a simple general-purpose data structure. It introduces a data structure to represent sequences. The data structure allows constant-time access to both ends of the sequence and logarithmic-time concatenation and splitting.

The essence of Dataflow Programming by Tarmo Uustalu and Varmo Vene.

Here is an LtU entry.