Abstract
Extensionality means, very roughly, that the semantics of a logic program can be explained in terms of the set-theoretic extensions of the relations involved. This allows one to reason about the program by ordinary extensional logic. First-order logic programming is extensional. Due to syntactic equality tests in the unification procedure, higher-order logic programming is generally not extensional. Extensionality is a highly undecidable property. We give a decidable extensionality criterion for simply typed logic programs, improving both on Wadge’s definitional programs from [9] and on our good programs from [2].
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
K. R. Apt. Logic programming. In J. van Leeuwen (ed.) Handbook of Theoretical Computer Science, Vol. B, pp. 493–574. Elsevier, Amsterdam, 1990.
M.A. Bezem. Extensionality of Simply Typed Logic Programs. In D. de Schreye (ed.) Proceedings ICLP’99, pp. 395–410. MIT Press, Cambridge, Massachusetts, 1999.
L. Henkin. Completeness in the theory of types. Journal of Symbolic Logic, 15:81–91, 1950.
J.R. Hindley. The principal type-scheme of an object in combinatory logic. Transactions of the AMS, 146:29–60, 1969.
D.A. Miller. A logic programming language with lambda-abstraction, function variables, and simple unification. Journal of logic and computation, 2(4):497–536, 1991.
G. Nadathur and D.A. Miller. Higher-order logic programming. In D. Gabbay e.a. (eds.) Handbook of logic in artificial intelligence, Vol. 5, pp. 499–590. Clarendon Press, Oxford, 1998.
G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223–256, 1977.
A.S. Troelstra. Metamathematical Investigation of Intuitionistic Arithmetic and Analysis. Number 344 in Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1973.
W.W. Wadge. Higher-order Horn logic programming. In V. Saraswat and K. Ueda (eds.) Proceedings of the 1991 International Symposium on Logic Programming, pp. 289–303. MIT Press, Cambridge, Massachusetts, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bezem, M. (2001). An Improved Extensionality Criterion for Higher-Order Logic Programs. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_15
Download citation
DOI: https://doi.org/10.1007/3-540-44802-0_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42554-0
Online ISBN: 978-3-540-44802-0
eBook Packages: Springer Book Archive