Abstract. In this paper, we propose more flexible applicability conditions for the folding rule that increase the power of existing unfold/fold systems for normal logic programs. O...
Abstract. We present a lightweight, automated tool for specificationbased testing of declarative programs written in the functional logic programming language Curry and emphasize t...
Dependent types are useful for statically checking detailed specifications of programs and detecting pattern match or array bounds errors. We propose a novel approach to applicatio...
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
Abstract. The paper introduces a collection of knowledge representation languages, V(C), parametrised over a class C of constraints. V(C) is an extension of both CR-Prolog and CASP...
Bundy and Richardson [7] presented a technique for reasoning about lists using ellipsis (the dots in 1+2+...+10), where a polymorphic function, denoted by 2, is used to encapsulate...
Narrowing extends rewriting with logic capabilities by allowing free variables in terms and replacing matching with unification. Narrowing has been widely used in different context...
Abstract. We study the dynamic control operators for delimited continuations, control and prompt. Based on recent developments on purely functional CPS translations for them, we in...
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...