Poulovassilis, A. and Small, C. A domain-theoretic approach to integrating logic and functional database languages, Proc. 19th VLDB, Dublin, August 1993, pp 416-428.  Home/Search   Document Not in Database   Summary   Related Articles   Check

No context found.

Poulovassilis, A. and Small, C. A domain-theoretic approach to integrating logic and functional database languages, Proc. 19th VLDB, Dublin, August 1993, pp 416-428.

....is valid. Bir88] gives an accessible discussion of structural induction and uses it to prove equivalences over infinite lists and trees. We similarly use it to prove our equivalences over, possibly infinite, sets below. Sets are important in our language, so we briefly recall their semantics (see [Pou93] for further details) The least element of the type consisting of sets of values of type t is the set f t g. For example, the value of f = x: fx) fx) is x:f g, while the value of nats = n:fng[ nats(n 1) is n:fn; n 1; g, so with nats non termination arises from the construction of an ....

....are correspond to the FROM clause, and the filters to the WHERE clause. Also, Trinder [Tri89] gives a translation of the relational calculus into list (as opposed to set) abstractions, Pat90] notes that DAPLEX queries are easily translated into set abstractions, and in previous papers e.g. [Pou93] we have observed the syntactic and semantic correspondence between set valued functions such as father and anc and the analogous Datalog predicates. However, set abstractions are just syntactic sugar for nested applications of setmap and if . In the interests of simplicity, we give the ....

[Article contains additional citation context not shown here]

Poulovassilis, A. and Small, C. A domaintheoretic approach to integrating logic and functional database languages, Proc. 19th VLDB Conference, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC