Write a Blog >>
Thu 22 Jun 2017 17:00 - 17:30 at Vertex WS215 - Incremental computing 3: Research talks

General purpose incremental computation requires a lot of overhead in memory and time. To address these limitations, programmers often organize functions and data so that dependency tracking and memoization act on groups rather than individual items. I design data structures and higher-order functions in the Rust language with support for tuning these group sizes. I use the most recent, the Giraz, to parse and interpret a reverse-polish-calculator. The Giraz has high initial runtime compared to a native vector-based implementation, but makes up for it with fast change propagation after 10 changes.

Thu 22 Jun

ic-2017-papers
15:50 - 17:30: IC 2017 - Incremental computing 3: Research talks at Vertex WS215
ic-2017-papers15:50 - 16:20
Talk
Rudi HornUniversity of Edinburgh, James CheneyUniversity of Edinburgh, UK
File Attached
ic-2017-papers16:25 - 16:55
Talk
Mirko KohlerTechnical University of Darmstadt, Philipp HallerKTH Royal Institute of Technology, Sebastian ErdwegTU Delft, Mira MeziniTU Darmstadt, Guido SalvaneschiTU Darmstadt
File Attached
ic-2017-papers17:00 - 17:30
Talk
Kyle HeadleyUniversity of Colorado Boulder
File Attached