650 search results - page 69 / 130 » On Coalgebras over Algebras |
FASE
2000
Springer
14 years 15 days ago
2000
Springer
state-based approach KIV uses abstract state machines (ASMs, [5]) over algebraically specified data types. The semantics of an ASM is the set of
ICDT
1995
ACM
14 years 14 days ago
1995
ACM
We investigate and compare two forms of recursion on sets for querying nested collections. The rst one is called sri and it corresponds to sequential processing of data. The second...
DAGSTUHL
2008
13 years 10 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
BIS
2006
13 years 10 months ago
2006
This paper discusses the applicability of a process algebra, the -calculus, as a formal foundation for Business Process Management (BPM). We therefore investigate the -calculus fro...
FUIN
2008
13 years 9 months ago
2008
We give an algorithmic solution in a simple combinatorial data of Birkhoff s type problem studied in [14], for the category repft(I, K[t]/(tm)) of filtered I-chains of modules over...