Incremental computing promises to lead to faster and more efficient programs by avoiding unnecessary recomputations, but existing approaches are often ad-hoc. We are interested in a more generic manner of formalizing incrementality, and investigate the capability of viewing data types as poly- nomial functors for defining changes and for constructing incrementalizations.
Fri 20 SepDisplayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
Fri 20 Sep
Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
15:30 - 17:30 | |||
15:30 30mTalk | Disjoint Polymorphism with Intersection and Union Types FTfJP | ||
16:00 30mTalk | Coeffects for MiniJava: Cf-Mj FTfJP | ||
16:30 30mTalk | Dafny vs. Dala: Experience with Mechanising Language Design FTfJP James Noble Independent. Wellington, NZ, Julian Mackay Victoria University of Wellington, Tobias Wrigstad Uppsala University, Andrew Fawcett Victoria University of Wellington, Michael Homer Victoria University of Wellington File Attached | ||
17:00 30mTalk | Incrementalizing Polynomial Functors FTfJP Timon Böhler Technical University of Darmstadt, David Richter Technical University of Darmstadt, Mira Mezini TU Darmstadt; hessian.AI; National Research Center for Applied Cybersecurity ATHENE | ||
Information for Participants
Fri 20 Sep 2024 15:30 - 17:30 at EI 2 Pichelmayer - FTfJP Session 3 Chair(s): Dara MacConville
Info for room EI 2 Pichelmayer: