L. Libkin and E. Gunter, A functional database programming language with support for disjunctive information, AT&T Technical Memo, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....for objects and types can be freely combined, giving OR SML a total of nine different printing styles. A new printer can be installed by using functions printer and printer type of type int unit. These functions can be invoked at any time. Further details can be found in the system manual [16]. 3 Normalization As we discussed before, while an object h1; 2; 3i is structurally just a set, conceptually it is a single integer which is either 1 or 2 or 3. Assume we are given an object x : t where type t contains some or set brackets. What is this object conceptually Since we want to list ....

....the user may need to write a program to deal with the result. Since all operations of OR SML work with type co, there is a way out of complex objects to the usual SML types. The structure DEST contains some functions to deconstruct complex objects and obtain SML values. See the system manual [16] for details. 5 Applications of OR SML 5.1 Querying incomplete design database In this section we show an application of normalization of databases. We start with a database containing an incomplete design and ask certain queries about possible completed designs. We then show how to write these ....

[Article contains additional citation context not shown here]

L. Libkin and E. Gunter, A functional database programming language with support for disjunctive information, AT&T Technical Memo, 1993.

....for objects and types can be freely combined, giving OR SML a total of nine different printing styles. A new printer can be installed by using functions printer and printer type of type int unit. These functions can be invoked at any time. Further details can be found in the system manual [17]. 3 Normalization As we discussed before, while an object h1; 2; 3i is structurally just a set, conceptually it is a single integer which is either 1 or 2 or 3. Assume we are given an object x : t where type t contains some or set brackets. What is this object conceptually Since we want to list ....

....program to deal with the result. Since all operations of OR SML work with type co, there is a need to have a way out of complex objects to the usual SML types. The structure DEST contains some functions to deconstruct complex objects and obtain SML values. We refer the reader to the system manual [17] for details. 5 Applications of OR SML 5.1 Querying incomplete design database In this section we show an application of normalization of databases. We start with a database containing an incomplete design and ask certain queries about possible completed designs. We then show how to write these ....

[Article contains additional citation context not shown here]

L. Libkin and E. Gunter, A functional database programming language with support for disjunctive information, AT&T Technical Memo No. BL0112610-931203-47, 1993.

....(like Age) In this case in the combined database we must store the fact that the value of the Age attribute is one of the values from the different databases. Another kind of examples arises in the problem of proof planning in automated theorem provers. We refer the reader to the full paper [7] in which we discuss these problems. Goals of the paper. We describe a functional language, OR SML, for querying databases with incomplete and disjunctive information. It is capable of solving a number of problems that typically accompany disjunctive information; in particular, the problems we ....

....objects to files and reading them back in later. There are two modules for file I O: one for binary files and one for ASCII files. To enable the user to write programs to deal with the results of queries, ORSML provides a way out of complex objects to the usual SML types. See the system manual [7] for details. 3 Applications of OR SML Querying incomplete design databases. Recall the example of an incomplete design from figure 1. Assuming that each smallest subpart has two parameters its cost (of type int) and its reliability (of type real) we can use or sets to represent the ....

[Article contains additional citation context not shown here]

E. Gunter and L. Libkin. A functional database programming language with support for disjunctive information, AT&T Technical Memo, 1993.

....for objects and types can be freely combined, giving OR SML a total of nine different printing styles. A new printer can be installed by using functions printer and printer type of type int unit. These functions can be invoked at any time. Further details can be found in the system manual [12]. 3 Normalization As we discussed before, while an object h1; 2; 3i is structurally just a set, conceptually it is a single integer which is either 1 or 2 or 3. Assume we are given an object x : t where type t contains some or set brackets. What is this object conceptually Since we want to list ....

....program to deal with the result. Since all operations of OR SML work with type co, there is a need to have a way out of complex objects to the usual SML types. The structure DEST contains some functions to deconstruct complex objects and obtain SML values. We refer the reader to the system manual [12] for details. 5 Applications of OR SML 5.1 Querying incomplete design database In this section we show an application of normalization of databases. We start with a database containing an incomplete design and ask certain queries about possible completed designs. We then show how to write these ....

E. Gunter and L. Libkin, A functional database programming language with support for disjunctive information, AT&T Technical Memo No. BL0112610-931203-47, 1993.

....it is shown that nesting at intermediate types does not add expressiveness in presence of aggregate functions and certain generic queries. Other results on expressive power are to be found in [19, 20, 21] Our approach can be used for different collections: languages for or sets were studied in [17, 13] and bag languages in [18] 29] shows that transitive closure, which is efficiently expressible using structural recursion, has a necessarily exponential implementation in complex object algebra [3] 14] show how to encode related database languages in the simply typed lambdacalculus. The ....

E. Gunter and L. Libkin, A Functional Database Programming Language with Support for Disjunctive Information, AT&T Technical Memo BL0112610-931203-47, 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