We give a deterministic, big-step operational semantics for the essential core of the Curry language, including higher-order functions, call-by-need evaluation, nondeterminism, narrowing, and residuation. The semantics is structured in modular monadic style, and is presented in the form of an execut
Distributivity for a monad and a comonad
β Scribed by John Power; Hiroshi Watanabe
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 28 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1571-0661
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Unification in the equational theory of one-sided distributivity and a multiplicative unit is shown to be decidable. The algorithm is a non-deterministic one that eventually uses a decision algorithm for string unification problems with constant restrictions, which was shown to be decidable by K. Sc
We prove that the probability of each second order monadic property of a random mapping u converges as n Βͺ Ο±.
We have built a distributed Ben-Ari Concurrent Interpreter (distributed BACI), which provides easy-touse commands to implement distributed algorithms. In distributed BACI, a send process, receive process, and interpreter process combine to provide the distributed system functionality necessary to im