41 search results - page 2 / 9 » Product Operations in Strong Monads |
TLCA
2001
Springer
13 years 10 months ago
2001
Springer
We introduce λµ→∧∨⊥ , an extension of Parigot’s λµ-calculus where disjunction is taken as a primitive. The associated reduction relation, which includes the permutati...
ENTCS
2008
13 years 6 months ago
2008
We argue that symmetric (semi)monoidal comonads provide a means to structure context-dependent notions of computation such as notions of dataflow computation (computation on strea...
CERA
2004
13 years 6 months ago
2004
Concurrent engineering (CE) design demands the consideration of product life-cycle issues in the early product design stage. Among various life-cycle issues, this work concentrate...
SOCO
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. In grid-based scientific applications, building a workflow essentially involves composing parameterized services describing families of services and then configuring the ...
IANDC
2006
13 years 6 months ago
2006
We give a coalgebraic formulation of timed processes and their operational semantics. We model time by a monoid called a "time domain", and we model processes by "t...