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.
CITATION STYLE
Almendros-Jiménez, J. M. (1998). Improving computations in a typed functional logic language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1548, pp. 438–454). Springer Verlag. https://doi.org/10.1007/3-540-49253-4_31
Mendeley helps you to discover research relevant for your work.