منابع مشابه
Causal commutative arrows revisited Causal commutative arrows revisited
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 o...
متن کاملCausal commutative arrows
Arrows are a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and, in particular, are 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, ...
متن کاملThe Graphical Condition for Identifying Arrows in Recovering Causal Structure
This paper deals with problems of recovering a causal structure by using not only conditional independence relationships but also prior knowledge when data are generated according to the causal structure among variables. Although some algorithms for recovering a causal structure based on independencies have been developed, the influence of prior knowledge on the recovery algorithms has not been...
متن کاملGeneralized Arrows
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission....
متن کاملBroken Arrows
This paper makes an account of the design and investigations done for the still image watermarking technique used in the 2nd edition of the BOWS challenge. This technique is named “broken arrows” for some reasons given later on, and abbreviated “BA.” This zero-bit algorithm is an implementation of a recent theoretical result by Merhav and Sabbag (2008) with precautions taken with respect to rob...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2011
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796811000153