Title
Dynamic-Cut with Definitional Trees
Abstract
The detection of deterministic computations at run-time can be used to introduce dynamic cuts pruning the search space and thus increasing the efficiency of Functional-Logic systems. This idea was introduced in an early work of R. Loogen and S. Winkler. However the proposal of these authors cannot be used in current implementations because it did not consider non-deterministic functions and was not oriented to the demand driven strategy. Our work adapts and extends the technique, both showing how to deal with non-deterministic computations and how definitional trees can be employed to locate the places where the cuts will be introduced. An implementation based on a Prolog-translation is proposed, making the technique easy to implement in current systems generating Prolog code. Some experiments showing the effectiveness of the cut are presented.
Year
DOI
Venue
2002
10.1007/3-540-45788-7_15
FLOPS
Keywords
Field
DocType
definitional trees,work adapts,non-deterministic function,s. winkler,non-deterministic computation,dynamic cuts pruning,current system,early work,prolog code,functional-logic system,current implementation,search space
Functional programming,Computer science,Concrete syntax,Algorithm,Theoretical computer science,Implementation,Prolog,Execution time,Demand driven,Distributed computing,Computation
Conference
ISBN
Citations 
PageRank 
3-540-44233-2
1
0.39
References 
Authors
5
2
Name
Order
Citations
PageRank
Rafael Caballero1274.02
Francisco Javier López-fraguas243625.21