Database Reference
In-Depth Information
11. Demonstrate that the adequate DB-denotational semantics is equivalent to the
adequate
abstract
SOS-denotational semantics, and explain why we can use the
DB-denotational semantics, based on
DB
category, as a
canonical
denotational
semantics for the database mapping programs.
12. Explain the final result: the equivalence of the initial algebra and final coalgebra
semantics of the commutative diagram
References
1. S. Abiteboul, R. Hull, V. Vianu,
Foundations of Databases
(Addison Wesley Publ. Co., Read-
ing, 1995)
2. P. Aczel,
Non-well-Founded Sets
. Lecture Notes CSLI, vol. 14 (1988)
3. P. Aczel, N. Mendler, A final coalgebra theorem, in
Proc. Category Theory and Computer
Science
. LNCS, vol. 389 (Springer, Berlin, 1989), pp. 357-365
4. P. Aczel, J. Adamek, S. Milius, J. Velebil, Infinite trees and completely iterative theories: a
coalgebraic view. Theor. Comput. Sci.
300
, 1-45 (2003)
