Sciweavers

525 search results - page 1 / 105
» Composing Programs in a Rewriting Logic for Declarative Prog...
Sort
View
CORR
2002
Springer
119views Education» more  CORR 2002»
13 years 4 months ago
Composing Programs in a Rewriting Logic for Declarative Programming
Juan M. Molina-Bravo, Ernesto Pimentel
PPDP
2004
Springer
13 years 10 months ago
A lazy narrowing calculus for declarative constraint programming
The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Francisco Javier López-Fraguas, Mario Rodr&...
RTA
2010
Springer
13 years 8 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
AMAST
2008
Springer
13 years 6 months ago
A Declarative Debugger for Maude
Abstract. Declarative debugging has been applied to many declarative programming paradigms; in this paper, a declarative debugger for rewriting logic specifications, embodied in th...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
AGP
1994
IEEE
13 years 8 months ago
A Compositional Semantics for Conditional Term Rewriting Systems
This paper considers compositions of conditional term rewriting systems as a basis for a modular approach to the design and analysis of equational logic programs. In this context,...
María Alpuente, Moreno Falaschi, Marí...