Typed Higher-Order Narrowing without Higher-Order Strategies [chapter]

Sergio Antoy, Andrew Tolmach
1999 Lecture Notes in Computer Science  
We describe a new approach to higher-order narrowing computations in a class of systems suitable for functional logic programming. Our approach is based on a translation of these systems into ordinary (£rst-order) rewrite systems and the subsequent application of conventional narrowing strategies. Our translation is an adaptation to narrowing of Warren's translation, but unlike similar previous work, we preserve static type information, which has a dramatic effect on the size of the narrowing
more » ... ace. Our approach supports sound, complete, and ef£cient higher-order narrowing computations in classes of systems larger than those previously proposed.
doi:10.1007/10705424_22 fatcat:5dszg4x7jjhknp54oq4saswvay