@inproceedings{200, author = {Jan Christiansen and Michael Hanus and Fabian Reck and Daniel Seidel}, title = {A Semantics for Weakly Encapsulated Search in Functional Logic Programs}, abstract = {Encapsulated search is a key feature of (functional) logic languages. It allows the programmer to access and process different results of a non-deterministic computation within a program. Unfortunately, due to advanced operational features (lazy evaluation, partial values, infinite structures), there is no straightforward definition of the semantics of encapsulated search in functional logic languages. As a consequence, various proposals and implementations are available but a rigorous definition covering all semantical aspects does not exist. In this paper, we analyze the requirements of encapsulated search in a functional logic language like Curry and provide a comprehensive definition that covers weak encapsulation, a modular form of encapsulation, as well as nested applications of search operators. We set up a denotational semantics that distinguishes non-termination and different levels of failures in a computation. The semantics is also the basis of a practical implementation of search operators in the functional logic language Curry.}, year = {2013}, booktitle = {Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP 13}, journal = {Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP 13}, pages = {49-60}, publisher = {ACM Press}, isbn = {978-1-4503-2154-9}, doi = {10.1145/2505879.2505896}, }