Causal commutative arrows (CCA) extend arrows with additional constructs and laws that make them suitable for modelling domains such as functional reactive programming, differential equations and synchronous dataflow.
Earlier work has revealed that a syntactic transformation of CCA computations into normal form can result in significant performance improvements, sometimes increasing the speed of programs by orders of magnitude.
In this work we reformulate the normalization as a type class instance and derive optimized observation functions via a specialization to stream transformers to demonstrate that the same dramatic improvements can be achieved without leaving the language.
Thu 22 Sep Times are displayed in time zone: Osaka, Sapporo, Tokyo change
|10:35 - 11:00|
|Causal Commutative Arrows Revisited|
|11:00 - 11:25|
|Functional Reactive Programming, Refactored|