Sciweavers

Share
ICFP
2009
ACM

Causal commutative arrows and their optimization

11 years 15 days ago
Causal commutative arrows and their optimization
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow computations. Most notably, arrows form the basis for a domain specific language called Yampa, which has been used in a variety of concrete applications, including animation, robotics, sound synthesis, control systems, and graphical user interfaces. Our primary interest is in better understanding the class of abstract computations captured by Yampa. Unfortunately, arrows are not concrete enough to do this with precision. To remedy this situation we introduce the concept of commutative arrows that capture a kind of non-interference property of concurrent computations. We also add an init operator, and identify a crucial law that captures the causal nature of arrow effects. We call the resulting computational model causal commutative arrows. To study this class of computations in more detail, we define an extensi...
Hai Liu, Eric Cheng, Paul Hudak
Added 22 Nov 2009
Updated 22 Nov 2009
Type Conference
Year 2009
Where ICFP
Authors Hai Liu, Eric Cheng, Paul Hudak
Comments (0)
books