Last modified: 2020-12-26
Abstract
The intensional approach to development of a computational model for relational languages is applied. The feature of this approach is to give a unified theoretical ground for dynamic computations — taking into account the ‘stages of knowl- edge’. The model covered in this paper establishes the purely functional and applicative computational environment.
Keywords
References
1.Codd E.F. The relational model for database manage-ment: version 2. Addison-Wesley Publishing Com-pany, 1990, — 538 p.
2. Klug A. Equivalence of relational algebra and re-lational calculus query languages having aggregatefunctions. JACM, 1982, Vol. 29, No 3.
3. Maier D., Ullman J.D., and Vardi M.-Y. On the
foundations of the universal relational model. ACMTODS, 1984, Vol. 9, No 2.
4. Roussoupoulos N. Semantic network model of databases. Ph.D. Thesis, Department of Computer Sci-ence, University of Toronto, 1977.
5. Scott D.S. Advice on modal logic. Philosophical prob-lems in logic. Some recent developments.- LambertK. (ed.), Dordrecht; Holland: Reidel, 1970.
6. Scott D.S. Outline of a mathematical theory of com-putation. Proceedings of the 4-th Annual Prince-ton conference on information sciences and systems, 1970.
7. Scott D.S. Lambda calculus: some models, somephilosophy. The Kleene Symposium. Barwise, J., et
al.(eds.), Studies in Logic 101, North— Holland, 1980,pp.381-421.
8. Scott D.S. Relating theories of the lambda calculus.Hindley J., Seldin J. (eds.) To H.B.Curry: Essays oncombinatory logic, lambda calculus and formalism.-N.Y.& L.: Academic Press, 1980, pp. 403-450.
9. Scott D.S. Domains for denotational semantics.LNCS, 140, 1982, pp. 577- 613.