Improving computations in a typed functional logic language

Abstract

We propose an implementation of a functional logic language with parametric order sorted types by translating typed lazy narrowing into Prolog, and establishing a reasonable strategy of combination of data and type constraints solving. By means of this translation, we describe how types can be used at run-time to prune the search space of solutions of a goal. Moreover, we present type inference and checking compile-time tools for the language showing its usefulness for improving computations.