Abstract
A logic based language for manipulating complex objects constructed using set and tuple constructors is introduced. A key feature of the COL language is the use of base and derived data functions. Under some stratification restrictions, the semantics of programs is given by a minimal and justified model that can be computed using a finite sequence of fixpoints. The language is extended using external functions and predicates. An implementation of COL in a functional language is briefly discussed. © 1991, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
Abiteboul, S., & Grumbach, S. (1991). A Rule-Based Language with Functions and Sets. ACM Transactions on Database Systems (TODS), 16(1), 1–30. https://doi.org/10.1145/103140.103141
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.