An Improved Extensionality Criterion for Higher-Order Logic Programs

Authors:
Marc Bezem
Affiliations:
-
Venue:
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Year:
2001

Citing 2
Cited 1

Logic programming

Handbook of theoretical computer science (vol. B)
Extensionality of simply typed logic programs

Proceedings of the 1999 international conference on Logic programming

Extensional Higher-Order Logic Programming

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

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].