2011/12/16 by Abdulla Alqaddoumi, Enrico Pontelli, Alqaddoumi, Abdulla +1
Computer Science · #D.1.6 #D.3 #FOS: Computer and information sciences #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Programming Languages (cs.PL)
paper · pdf · doi:10.48550/arxiv.1112.3789
openalex publication_date 2011/12/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.