Sorted HiLog: Sorts in Higher-Order Logic Data Languages (1994)
| Venue: | In Int’l Conference on Database Theory, number 893 in Lecture Notes in Computer Science |
| Citations: | 4 - 0 self |
BibTeX
@INPROCEEDINGS{Chen94sortedhilog:,
author = {Weidong Chen and Michael Kifer},
title = {Sorted HiLog: Sorts in Higher-Order Logic Data Languages},
booktitle = {In Int’l Conference on Database Theory, number 893 in Lecture Notes in Computer Science},
year = {1994}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
HiLog enhances the modeling capabilities of deductive databases and logic programming with higher-order and meta-data constructs, complex objects, and schema browsing. Its distinctive feature, a higher-order syntax with a first-order semantics, allows for efficient implementation with speeds comparable to Prolog. In fact, HiLog implementation in XSB [30, 26] together with tabulated query evaluation offers impressive performance with negligible penalty for higher-order syntax, thereby bringing the modeling capabilities of HiLog to practical realization. The lack of sorts in HiLog, however, is somewhat of a problem in database applications, which led to a number of HiLog dialects such as DataHiLog [24]. This paper develops a comprehensive theory of sorts for HiLog. It supports HiLog's flexible higher-order syntax via a polymorphic and recursive sort structure, and it offers an easy and convenient mechanism to control the rules of well-formedness. By varying the sort structure we obtain ...
