Abstract
SLOG is a language integrating logic and functional programming that is based on innermost narrowing and rewriting. Although innermost narrowing can be simulated by Prolog, the same is not true for rewriting. This has motivated a weaker notion of rewriting, called simplification, in the proposal of “Prolog with Simplification”. In this paper, we address the issue of efficiently integrating simplification into Prolog.
This work has been partially supported by ESPRIT project BRA 3020.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P.G. Bosco, C. Cecchi, and C. Moiso. An extension of WAM for K-LEAF. In Proceedings of the 6th International Conference on Logic Programming, Lisboa, pages 318–333, 1989.
P.G. Bosco, E. Giovannetti, and G. Moiso. Refined strategies for semantic unification. In TAPSOFT'87, LNCS 150, pages 276–290, 1987.
M. Bellia and G. Levi. The relation between logic and functional languages. Journal of Logic Programming, 3:217–236, 1986.
P.H. Cheong. Compiling lazy narrowing into prolog. Technical Report 25, LIENS, 1990. To appear in Journal of New Generation Computing.
P. Deransart. An operational semantics of prolog programs. In Programmation Logique, Perros-Guirec, CNET-lannion, 1983.
L. Fribourg. SLOG: A logic programming language interpreter based on clausal superposition and rewriting. In Proceedings of the IEEE Symposium on Logic Programming, Boston, pages 172–184, 1985.
L. Fribourg. Prolog with simplification. In K. Fuchi and M. Nivat, editors, Programming of future generation computers, pages 161–183. Elsevier Science Publishers B.V. (North Holland), 1988.
M. Hanus. Compiling logic programs with equality. In PLILP'90, LNCS 456, pages 387–401, 1990.
S. Hölldobler. From paramodulation to narrowing. In Proceedings of the 5th International Conference on Logic Programming, Seattle, pages 327–342, 1988.
H. Kuchen, R. Loogen, J.J. Moreno, and M. Rodríguez. Graph-based implementation of a functional logic language. In ESOP' 90, LNCS 432, pages 279–290, 1990.
G. Levi, C. Palamidessi, P.G. Bosco, E. Giovannetti, and C. Moiso. A complete semantic characterization of K-LEAF, a logic language with partial functions. In Proceedings of the IEEE Symposium on Logic Programming, pages 318–327, 1987.
A. Mück. The compilation of narrowing. In PLILP'90, Springer LNCS 456, 1990.
U.S. Reddy. Narrowing as the operational semantics of functional languages. In Proceedings of the IEEE Symposium on Logic Programming, Boston, pages 138–151, 1985.
M.H. van Emdem and K. Yukawa. Logic programming with equations. Journal of Logic Programming, 4:265–288, 1987.
Y.H. You. Enumerating outer narrowing derivations for constructor-based term rewriting systems. Journal of Symbolic Computation, 7:319–343, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheong, P.H., Fribourg, L. (1991). Efficient integration of simplification into Prolog. In: Maluszyński, J., Wirsing, M. (eds) Programming Language Implementation and Logic Programming. PLILP 1991. Lecture Notes in Computer Science, vol 528. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54444-5_112
Download citation
DOI: https://doi.org/10.1007/3-540-54444-5_112
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54444-9
Online ISBN: 978-3-540-38362-8
eBook Packages: Springer Book Archive