Implementation of a deterministic partial E-unification algorithm for macro tree transducers

Heinz Faßbender, Heiko Vogler, Andrea Wedel, Universität Ulm
<span title="2016-03-15">2016</span>
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 particular
more &raquo; ... rrowing strategy which c o m bines leftmost outermost narrowing with a local constructor consistency check and a particular occur check. The twin uni cation machine uses two runtime stacks it is an extension of an e cient leftmost outermost reduction machine for macro tree transducers. The feasibility of the presented implementation technique is proved by an implementation which has been developed on a SPARCstation SLC.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="">doi:10.18725/oparu-1679</a> <a target="_blank" rel="external noopener" href="">fatcat:tf7bxkbsfvejldfpthkxa6xdbm</a> </span>
<a target="_blank" rel="noopener" href=";jsessionid=6D9A12B06722C5A014E11FDDAF2EE10A?sequence=1" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href=""> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / </button> </a>