Paper Info
Title
A demand-driven narrowing calculus with overlapping definitional trees
Abstract
We propose a demand-driven conditional narrowing calculus in which a variant of definitional trees [2] is used to efficiently control the narrowing strategy. This calculus is sound and strongly complete w.r.t. Constructor-based ReWriting Logic (CRWL) semantics [7] for a wide class of constructor-based conditional term rewriting systems. The calculus mantains the optimality properties of the needed narrowing strategy [5]. Moreover, the treatment of strict equality as a primitive rather than a defined function symbol, leads to an improved behaviour w.r.t. needed narrowing.
Year
DOI
Venue
2003
10.1145/888251.888275
PPDP
Keywords
Field
DocType
overlapping definitional tree,demand-driven narrowing calculus,needed narrowing,constructor-based conditional term,constructor-based rewriting logic,calculus mantains,definitional tree,improved behaviour w,complete w,narrowing strategy,demand-driven conditional narrowing calculus,needed narrowing strategy,rewriting logic,functional logic programming
Programming language,Computer science,Symbol,Theoretical computer science,Rewriting,Demand driven,Semantics,Calculus
Conference
ISBN
Citations 
PageRank 
1-58113-705-2
14
0.66
References 
Authors
14
1
Name
Order
Citations
PageRank
Rafael del Vado V́ırseda19713.26