A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Implementation of a deterministic partial E-unification algorithm for macro tree transducers
During the execution of functional logic programs, particular E-uni cation problems have t o b e s o l v ed quite frequently. In this paper we c o n tribute to the e cient solution of such problems in the case where E is induced by particular term rewriting systems called macro tree transducers. We formalize the implementation of a deterministic partial E-uni cation algorithm on a deterministic abstract machine, called twin uni cation machine. The uni cation algorithm is based on a particulardoi:10.18725/oparu-1679 fatcat:tf7bxkbsfvejldfpthkxa6xdbm