134 search results - page 7 / 27 » An Algebraic View of Program Composition |
ECOOP
1992
Springer
14 years 1 months ago
1992
Springer
This paper introduces a new model, based on so-called object-composition filters, that uniformly integrates database-like features into an object-oriented language. The focus is o...
JDCTA
2010
13 years 4 months ago
2010
The large-granularity Web services are a new form of Web services. In contrast to the traditional Web services, they often have more interfaces, encapsulate more complex business ...
INFORMATICALT
2007
13 years 9 months ago
2007
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
Kleene algebra with tests (KAT) is an equational system for program verification that combines Kleene algebra (KA), or the algebra of regular expressions, with Boolean algebra. I...
CONCUR
1998
Springer
14 years 2 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...