An implementation of narrowing

Barbuti, 1986, leaf: A Language Which Integrates Logic, Equations and Functions, 201 Boyer, 1972, The Sharing of Structure in Theorem Proving Programs, 7, 101 Chew, 1980, An Improved Algorithm for Computing with Equations, Proceedings of the Twenty-First Conference on Foundations of Computer Science, 108 Darlington, 1986, The Unification of Functional and Logic languages, 37 1986 Dershowitz, 1985, Computing with Rewrite Systems, Inform. and Control, 64, 122, 10.1016/S0019-9958(85)80003-6 Dershowitz, 1981, Termination of Linear Rewriting Systems, Proceedings of the Eighth EATCS International Colloquium on Automata, Languages and Programming, 448 Dershowitz, 1981, Applications of the Knuth-Bendix Completion Procedure, Proceedings of the Seminaire d'Informatique Théorique, 95 Dershowitz, 1985, Logic Programming cum Applicative Programming, Proceedings of the 1985 Symposium on Logic Programming Dershowitz, 1988, Equational Programming, 11, 21 Foderaro, 1984, The franz lisp Manual Fribourg, 1985, slog: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting, Proceedings of the 1985 Symposium on Logic Programming, 172 Futatsugi, 1985, Principles of obj2, Conference Record of the Twelfth Annual ACM Symposium on Principles of Programming Languages, 52 Goguen, 1984, Equality, Types, Modules and (Why Not?) Generics for Logic Programming, J. Logic Programming, 179, 10.1016/0743-1066(84)90004-9 Hoffmann, 1984, Implementation of an Interpreter for Abstract Equations, Conference Record of the Eleventh Annual ACM Symposium on the Principles of Programming Languages, 111 Hsiang, 1985, Refutational Theorem Proving Using Term Rewriting Systems, J. Artificial Intelligence, 25, 255, 10.1016/0004-3702(85)90074-8 Jayaraman, 1986, Equations, Sets and Reduction Semantics for Functional and Logic Programming, 1986 ACM Conference on lisp and Functional Programming, 320, 10.1145/319838.319873 Kamin, 1983, The Role of Executable Specifications: The fase System, Proceedings of the IEEE Symposium on Application and Assessment of Automated Tools for Software Development, 14 Knuth, 1970, Simple Word Problems in Universal Algebras, 263 Marcus, 1984, SDVS User's Manual Martelli, 1982, An efficient unification algorithm, Trans. Programming Languages and Systems, 4, 258, 10.1145/357162.357169 Naish, 1985, All Solutions Predicates in PROLOG, Proceedings of the 1985 Symposium on Logic Programming, 73 Purdom, 1985, Fast Many-to-One Matching Algorithms, Vol. 202, 407 Reddy, 1985, Narrowing as the Operational Semantics of Functional Languages, Proceedings of the 1985 Symposium on Logic Programming, 138 Reddy, 1986, On the Relationship Between Logic and Functional Languages, 3 Rémy, 1984, Reveur4: A System for Validating Conditional Algebraic Specifications of Abstract Data Types Réty, 1985, narrower: A New Algorithm for Unification and Its Application to Logic Programming, Proceedings of the First International Conference on Rewriting Techniques and Applications, 141, 10.1007/3-540-15976-2_7 Robinson, 1988, Beyond loglisp—Combining Functional and Relational Programming in a Reduction Setting, 11, 57 1987, Vols. 1 and 2 Slagle, 1974, Automated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity, J. Assoc. Comput. Mach., 21, 622, 10.1145/321850.321859 Warren, 1983, An Abstract PROLOG Instruction Set, SRI Technical Note No. 309