TY - GEN
T1 - Logical closures
AU - Duggan, Dominic
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1994.
PY - 1994
Y1 - 1994
N2 - Uniform proof procedures for hereditary Harrop formulae have been proposed as a foundation for logic programming. A non-standard approach to defining hereditary Harrop formula is given, allowing quantification over predicate variables but distinguishing the forms of predicate quantification. The benefits of this approach include a treatment of higher order procedures which avoids some scoping problems with languages such as λ-Prolog, and the possibility of extending the language straightforwardly with a module system such as that developed for Standard ML. To enable a style of programming found in existing logic programming languages, a form of implementation inheritance is introduced into the language. Combining this with explicit type quantification provides a form of dynamic dispatching similar to CLOS generic procedures in a statically typed language.
AB - Uniform proof procedures for hereditary Harrop formulae have been proposed as a foundation for logic programming. A non-standard approach to defining hereditary Harrop formula is given, allowing quantification over predicate variables but distinguishing the forms of predicate quantification. The benefits of this approach include a treatment of higher order procedures which avoids some scoping problems with languages such as λ-Prolog, and the possibility of extending the language straightforwardly with a module system such as that developed for Standard ML. To enable a style of programming found in existing logic programming languages, a form of implementation inheritance is introduced into the language. Combining this with explicit type quantification provides a form of dynamic dispatching similar to CLOS generic procedures in a statically typed language.
UR - http://www.scopus.com/inward/record.url?scp=84947974137&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84947974137&partnerID=8YFLogxK
U2 - 10.1007/3-540-58216-9_33
DO - 10.1007/3-540-58216-9_33
M3 - Conference contribution
AN - SCOPUS:84947974137
SN - 9783540582168
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 114
EP - 128
BT - Logic Programming and Automated Reasoning - 5th International Conference, LPAR 1994, Proceedings
A2 - Pfenning, Frank
T2 - 5th International Conferenceon Logic Programming and Automated Reasoning, LPAR 1994
Y2 - 16 July 1994 through 22 July 1994
ER -