by Michael Hanus, Björn Peemöller, Fabian Reck
Proc. of the 5th Working Conference on Programming Languages (ATPS 2012), Springer LNI 199, pp. 61-74, 2012
© Springer-Verlag
In this paper we discuss our practical experiences with the use of different search strategies in functional logic programs. In particular, we show that complete strategies, like breadth-first search or iterative deepening search, are a viable alternative to incomplete strategies, like depth-first search, that have been favored in the past for logic programming languages.
Preprint (PDF) BibTeX-Entry Online