Extensional Higher-Order Logic Programming

Details Extensional Higher-Order Logic Programming Extensional Higher-Order Logic Programming

2011-06-17

arxiv.org/abs/1106.3457v1

Computer Science

Programming Languages

45 pages

Scientific paper

We propose a purely extensional semantics for higher-order logic programming. In this semantics program predicates denote sets of ordered tuples, and two predicates are equal iff they are equal as sets. Moreover, every program has a unique minimum Herbrand model which is the greatest lower bound of all Herbrand models of the program and the least fixed-point of an immediate consequence operator. We also propose an SLD-resolution proof procedure which is proven sound and complete with respect to the minimum model semantics. In other words, we provide a purely extensional theoretical framework for higher-order logic programming which generalizes the familiar theory of classical (first-order) logic programming.

Affiliated with

Also associated with

No associations

Rating

Extensional Higher-Order Logic Programming does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extensional Higher-Order Logic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extensional Higher-Order Logic Programming will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-695892