A typed, object-oriented database technology, equipped with appropriate declarative, temporal logic based executable constraints, is presented. The underlying object-oriented database type system is based on advanced features such as subtype, parametric and F-bounded polymorphism. A particularly distinctive feature of the type system is its associated type-safe reflection technology, which provides the flexibility required by database operators without sacrificing type safety. Strongly, and even statically typed, executable class specifications of a variety of standard database abstractions, both application-oriented and system-oriented, are presented in the paper, in order to demonstrate strate the applicability of the paradigm. The temporal logic basis of the constraint language has an execution model, as well as the minimal model semantics, and it allows complex, temporal behavioral patterns to be expressed. It is based on three tomporal operators: always, next time and some time, and rules that determine how these operators may be applied in temporal Horn clauses. Because of the object-oriented nature of the paradigm, the logic basis is also equipped with the equality predicate The proposed technology is intended to provide major advantages not only in managing appropriately complex application environments with temporal constraints, but also in providing more efficient (because of static type checking) and reliable database management systems. It offers the advantages of non-procedural data languages and the richness of a temporal object-oriented paradigm. It also leads to a powerful prototyping tool for structural and behavioral testing of complex, strongly typed object-oriented systems, prior to major procedural implementation efforts.