525 search results - page 5 / 105 » Composing Programs in a Rewriting Logic for Declarative Prog... |
PPDP
2007
Springer
14 years 21 days ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
ICLP
1992
Springer
13 years 10 months ago
1992
Springer
We discuss a declarative characterization of inheritance in logic programming. Our approach is inspired both by existing literature on denotational models for inheritance and by e...
ERSHOV
2001
Springer
13 years 11 months ago
2001
Springer
A general semantics-based framework for the analysis of logic programs with delay declarations is presented. The framework incorporates well known refinement techniques based on r...
ENTCS
2002
13 years 6 months ago
2002
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
LPAR
1994
Springer
13 years 10 months ago
1994
Springer
In this paper we develop a generic declarative diagnoser for normal logic programs that is based on tree search. The soundness and the completeness of the diagnoser are proved. The...