The new generic scheme CFLP(D) has been recently proposed in [24] as a logical and semantic framework for lazy constraint functional logic programming over a parametrically given ...
Abstract. This paper introduces a higher-order lazy narrowing calculus (HOLN for short) that solves higher-order equations over the domain of simply typed λ-terms. HOLN is an exte...
Abstract. Using higher-order functions is standard practice in functional programming, but most functional logic programming languages that have been described in the literature la...
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Many functional logic languages are based on narrowing, a unification-based goal-solving mechanism which subsumes the reduction mechanism of functional languages and the resolutio...