An Implementation of Bubbling
Abstract
Non-determinism is of great importance in functional logic programming. It provides expressiveness and efficiency to functional logic computations. In this paper we describe an implementation of the multi-paradigm functional logic language Curry. The evaluation strategy employed by the implementation is based on definitional trees and needed narrowing for deterministic operations, while non-deterministic operations will depend on the graph transformation, bubbling. Bubbling preserves the completeness of non-deterministic operations and avoids unnecessary large-scale reconstruction of expressions done by other approaches.
Cite
@article{arxiv.1112.3789,
title = {An Implementation of Bubbling},
author = {Abdulla Alqaddoumi and Enrico Pontelli},
journal= {arXiv preprint arXiv:1112.3789},
year = {2011}
}
Comments
Online Proceedings of the 11th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2011), Lexington, KY, U.S.A., July 10, 2011