2436 search results - page 113 / 488 » Comonadic Notions of Computation |
113
click to vote
ENTCS
2002
15 years 3 months ago
2002
We show that the basic feasible functions of Cook and Urquhart's BFF [8,9] are precisely the functionals definable in a natural system of ramified recurrence that uses type i...
102
click to vote
TVLSI
2002
15 years 3 months ago
2002
Abstract--We introduce the notion of energy-scalable systemdesign. The principal idea is to maximize computational quality for a given energy constraint at all levels of the system...
164
click to vote
ENTCS
2011
14 years 7 months ago
2011
We revisit the connection between three notions of computation: Moggi’s monads, Hughes’s arrows and McBride and Paterson’s idioms (also called applicative functors). We show...
107
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Circulant matrices play a central role in a recently proposed formulation of three-way data computations. In this setting, a three-way table corresponds to a matrix where each “...
185
click to vote
DAM
2011
14 years 11 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...