Thursday, 13 November 2014, 14:00
Cybernetica Bldg (Akadeemia tee 21), room B101
Abstract: We describe a basic framework for incremental computing in Haskell and develop a notion of change and change application for sequences. Finally, we implement an efficient algorithm for incremental stable sorting of sequences.
(Joint work with Wolfgang Jeltsch.)