Contents

• Abstract
• Introduction
• Relations Defined by Hornish Clauses
  • Open-World DATALOG
  • PROLOG-like Structures and Lists
  • Varying-Arity Structures
  • Varying-Arity Relationships
  • Higher-Order Constructors and Relations
• Functions Defined by Footed Clauses
  • DATAFUN as a Functional Database Language
    • Footed Facts and Non-Ground Functions
    • Footed Rules and the density Example
    • Non-Determinism, DATALOG Relationalizing, and WAM Compilation
  • Full RELFUN Exemplified by ``Self''-Functions
  • Higher-Order Constructors and Functions
• The Logic/Functional Style in Use
  • serialise: Inplace Updates of Non-Ground Structures
  • wang: On-the-Fly Construction of Proof Trees
  • eval: Interpreting a LISP Subset in RELFUN
• Conclusions
• References
• Contents
• About this document ...