Abstract
This paper is a continuation of [10]. It presents soundness and completeness results for a higher-order (HO) functional logic language which has a domain-based declarative semantics and uses conditional narrowing (for applicative, constructor based rewriting systems) as operational semantics. HO-unification is avoided by for bidding λ-abstractions in the language. However, narrowing must include a mechanism for binding HO logic variables to simple functional patterns built by partial application. A deeper investigation of lazy strategiees and infinite narrowing derivations is foreseen.
Research supported by the national project TIC 89/0104 and the ESPRIT BR Working Group N. 6028 CCL
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
H.Aït-Kaci, R.Nasr: Integrating Logic and Functional Programming. In Lisp and Symbolic Computation, 2, 1989, pp. 51–89.
K.R.Apt: Logic Programming. In J.van Leeuwen (ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier Science Publishers, 1990, pp. 493–574.
M.Bellia, G.Levi: The Relation between Logic and Functional Languages: a Survey. In J. Logic Programming 3, 1986, pp. 217–236.
M.Bellia, P.G.Bosco, E.Giovannetti, G.Levi, C.Moiso, C.Palamidessi: A two-level approach to logic and functional programming. In Procs. PARLE '87, Springer Verlag, 1987, pp. 374–393.
P.G. Bosco and E. Giovannetti: IDEAL: An Ideal Deductive Applicative Language. In Procs. 1986 Symp. on Logic Programming, IEEE Comp. Soc. Press, 1986, pp. 89–94.
D. de Groot, G. Lindstrom (eds): Logic Programming: Functions, Relations and Equations, Prentice Hall, 1986.
N.Dershowitz, J.P.Jouannaud: Rewrite Systems. In J. van Leeuwen (ed.), Hand-book of Theor. Comp. Sci., vol B, Elsevier Publishers, 1990, pp. 243–320.
E.Giovannetti, G.Levi, C. Moiso and C. Palamidessi: Kernel-LEAF: a Logic plus Functional Language. In JCSS, 42, 2, 1992, pp. 139–185.
J.A.Goguen, J.W.Thatcher, E.G. Wagner, J.B. Wright: On Initial Algebra Semantics and Continuous Algebras. In J. ACM 24, 1, 1977, pp. 68–95.
J.C.González-Moreno, M.T.Hortalá-González, M.Rodríguez-Artalejo: Denotational Versus Declarative Semantics for Functional Programming. In Procs. CSL'91, Springer LNCS, 1992, pp. 134–148.
A.Middeldorp, E.Hamoen: Counterexamples to Completeness Results for Basic Narrowing. In Procs. ALP'92, Springer LNCS 632, 1992, pp. 244–258
J.J.Moreno-Navarro & M.Rodríguez-Artalejo: Logic Programming with Functions and Predicates: The Language BABEL. In J.Logic Programming 12, 1992, pp. 191–223.
G.Nadathur, D.Miller: An overview of λ-PROLOG. In Procs. ICLP'88, the MIT Press, 1988, pp. 810–827.
D.S.Scott: Domains for denotational semantics. In Procs. ICALP'82, Springer LNCS 140, 1982, pp. 577–613.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González-Moreno, J.C., Hortalá-González, M.T., Rodríguez-Artalejo, M. (1993). On the completeness of narrowing as the operational semantics of functional logic programming. In: Börger, E., Jäger, G., Kleine Büning, H., Martini, S., Richter, M.M. (eds) Computer Science Logic. CSL 1992. Lecture Notes in Computer Science, vol 702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56992-8_14
Download citation
DOI: https://doi.org/10.1007/3-540-56992-8_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56992-3
Online ISBN: 978-3-540-47890-4
eBook Packages: Springer Book Archive