525 search results - page 14 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
LOPSTR
1998
Springer
13 years 11 months ago
1998
Springer
Based on a variable-free combinatory form of definite clause logic programs we outline a methodology and supporting program environment CombInduce for inducing well-moded logic pro...
ESOP
2001
Springer
13 years 11 months ago
2001
Springer
Abstract. In logic programming, dynamic scheduling refers to a situation where the selection of the atom in each resolution (computation) step is determined at runtime, as opposed ...
BTW
2005
Springer
14 years 8 days ago
2005
Springer
: The Web Services architecture defines various specifications that applications may wish to use in combination. In this paper, we investigate the composition of the Web services s...
ENTCS
2007
13 years 6 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
PPDP
2004
Springer
14 years 2 days ago
2004
Springer
We introduce the theoretical basis for tracing lazy functional logic computations in a declarative multi-paradigm language like Curry. Tracing computations is a difficult task due...