| S. Courtenage and A. Poulovassilis, "Combining Inheritance and Parametric Polymorphism in a Functional Database Language", in Proc. 13th British National Conference on Databases (BNCOD-13), Manchester, 1995. Springer-Verlag LNCS 940. |
....In this section we provide a brief description of the functional database programming language (DBPL) that we will be using to define the component and integrated databases, covering only the aspects of the language that are prerequisites for this paper. More comprehensive accounts can be found in [Pou91, Pou93, Cou95]. 2.1 The type system Our functional DBPL is strongly, statically typed and we use the notation e 1 ; e n : t to indicate that the expressions e 1 ; e n all have type t. A number of primitive types are supported, such as Bool, Str, Num and Chr. Also supported are function ....
....structured and function types. For example, we now have fMaleg fP ersong (Male; Num) P erson; Num) P erson Num Male Num We notice the anti monotonicity of the function type constructor which ensures the semantic soundness of subtypes, as discussed in [Car85] We refer the reader to [Cou95] for further details of subtyping in our DBPL and of the type inference algorithm used. 2.2 Data functions Factual information is stored within updatable, set valued functions termed data functions which correspond to the extensional relations of a logic database. For example, a data function ....
S. Courtenage and A. Poulovassilis, `Combining Inheritance and Parametric Polymorphism in a Functional Database Language", in Proc. 13th British National Conference on Databases (BNCOD-13), Manchester, 1995. Springer-Verlag LNCS 940.
....we provide a brief description of the functional database programming language (DBPL) that we will be using to define the component and integrated databases, covering only the aspects of the language that are prerequisites for this paper. More comprehensive accounts can be found in previous papers [Sma91, Pou91, Pou93, Cou95]. 2.1 The type system Our functional DBPL is strongly, statically typed and we use the notation e 1 ; e n : t to indicate that the expressions e 1 ; e n all have type t. A number of primitive types are supported, such as Bool, Str, Num and Chr. Also supported are function ....
....structured and function types. For example, we now have fMaleg fPersong (Male; Num) Person; Num) Person Num Male Num We notice the anti monotonicity of the function type constructor which ensures the semantic soundness of subtypes, as discussed in [Car85] We refer the reader to [Cou95] for further details of subtyping in our DBPL and of the type inference algorithm used. 2.2 Built in functions The DBPL supports the usual comparison and boolean operators as built in. Also builtin are several operators over sets, including set union, fag fag fag, set membership, in : ....
S. Courtenage and A. Poulovassilis, "Combining Inheritance and Parametric Polymorphism in a Functional Database Language", in Proc. 13th British National Conference on Databases (BNCOD-13), Manchester, 1995. Springer-Verlag LNCS 940.
....of the paper is as follows. In Section 2 we give an overview of the functional database programming language (DBPL) that we use to define the component and integrated databases, covering only aspects of the language that are prerequisites for this paper; more comprehensive accounts can be found in [17, 7, 8, 11, 4]. In Section 3 we present our deductive database integration method. In Section 4 we compare our method with other related methods; for reasons of space this comparison is brief and a fuller discussion may be found in [21] Finally, in Section 5 we give our conclusions and indicate directions of ....
....= Num;Num;Num) Subtype relationships between entity types can be specified. For example, the declaration type Male P erson; causes the extent of Person to expand to include the extent of Male, so that we now have allP erson = fP1; P2; M1;M2g and allMale = fM1;M2g. We refer the reader to [4] for further details of subtyping in our DBPL and of the type inference algorithm used. 2.2 Data functions Factual information is stored within updatable, set valued functions termed data functions which correspond to the extensional relations of a logic database. For example, the following ....
S. Courtenage and A. Poulovassilis, "Combining Inheritance and Parametric Polymorphism in a Functional Database Language", in Proc. 13th British National Conference on Databases (BNCOD-13), Manchester, 1995. Springer-Verlag LNCS 940.
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