论文信息 - Compilation of Narrowing

Compilation of Narrowing

Algebraic programming is a good alternative to logic programming. Analogously to SLD-resolution in Prolog, narrowing serves to solve systems of equations with respect to an algebraic program. To speed up current narrowing implementations, one has to find techniques to compile algebraic programs. In the following, we show a compilation technique for narrowing based on partial evaluation of the axioms of an algebraic program.

Andy Mück

[1] Pierre Deransart,et al. An Operational Algebraic Semantics of Prolog Programs , 1983, Logic Programming Workshop.

[2] Laurent Fribourg,et al. Handling Function Definitions through Innermost Superposition and Rewriting , 1985, RTA.

[3] Jean-Marie Hullot,et al. Canonical Forms and Unification , 1980, CADE.

[4] Stéphane Kaplan,et al. A Compiler for Conditional Term Rewriting Systems , 1987, RTA.

[5] Corrado Moiso,et al. An Extension of WAM for K-LEAF: A WAM-based Compilation of Conditional Narrowing , 1989, ICLP.

[6] Corrado Moiso,et al. Narrowing vs. SLD-Resolution , 1988, Theor. Comput. Sci..

[7] Heinrich Hußmann,et al. A Compiler for a Class of Conditional Term Rewriting Systems , 1987, CTRS.

[8] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[9] T. S. E. Maibaum,et al. Equations Compared with Clauses for Specification of Abstract Data Types , 1979, Advances in Data Base Theory.

[10] Claude Kirchner,et al. NARROWER: A New Algorithm for Unification and Its Application to Logic Programming , 1985, RTA.

[11] Heinrich Hußmann,et al. Unification in Conditional Equational Theories , 1985, European Conference on Computer Algebra.