Heinz Faßbender

Learn More
We formalize a universal uniication algorithm for the class of equational theories which is induced by the class of canonical, totally-deened, not strictly subuniiable term rewriting systems (for short: ctn-trs). For a ctn-trs R and for two t e r m s t and s, the algorithm computes a ground-complete set of E R-uniiers of t and s, where E R is the set of(More)
c 1998 Massachusetts Institute of Technology. Subscribers are licensed to use journal articles in a variety of ways, limited only as required to insure fair attribution to authors and the journal, and to prohibit use in a competing commercial product. See the journal's World Wide Web site for further details. The Journal of Functional and Logic Programming(More)
We describe the concepts and experiences we have made in an ongoing project by modeling and reengineering an experimental command and control information system which is nearly completely implemented in Ada95. For this purpose, we use the UML tool <i>Software through Pictures</i> from Aonix which includes a reengineering component that produces class(More)
During the execution of functional logic programs, particular E-uniication problems have t o b e s o l v ed quite frequently. In this paper we c o n tribute to the eecient 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 deter-ministic partial(More)
  • 1