Sorted HiLog: Sorts in Higher-Order Logic Data Languages

@inproceedings{Chen1995SortedHS,
  title={Sorted HiLog: Sorts in Higher-Order Logic Data Languages},
  author={W. Chen and M. Kifer},
  booktitle={ICDT},
  year={1995}
}
HiLog enhances the modeling capabilities of deductive data bases 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 [29, 25] together with tabulated query evaluation offers impressive performance with negligible penalty for higher-order syntax, thereby bringing… Expand
6 Citations

References

SHOWING 1-10 OF 48 REFERENCES
XSB as an efficient deductive database engine
  • 401
A first-order theory of types and polymorphism in logic programming
  • M. Kifer, J. Wu
  • Computer Science
  • [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
  • 1991
  • 24
HILOG: A Foundation for Higher-Order Logic Programming
  • 430
  • PDF
Higher-order Horn clauses
  • 110
  • PDF
On Negation in HiLog
  • K. A. Ross
  • Computer Science, Mathematics
  • J. Log. Program.
  • 1994
  • 26
Logical foundations of object-oriented and frame-based languages
  • 1,825
  • PDF
Parametric Order-Sorted Types in Logic Programming
  • M. Hanus
  • Computer Science
  • TAPSOFT, Vol.2
  • 1991
  • 22
  • PDF
COL: A Logic-Based Language for Complex Objects
  • 167
  • PDF
...
1
2
3
4
5
...