The development of languages allowing a proper handling of time is important in many areas of computer science because the capability to deal with the notions of change and time are essential to solve their problems. We will focus our work on that kind of languages that are useful in the area of data bases, where some problems demand the possibility to represent and use temporal information.Our proposal provides a programming language, EMTPL, that could be used as a framework for a deductive data base proposal. The underlying logic of this language is based on Prior's deeply studied metric temporal logic \cite{Prior67}. An algorithm is offered for a future implementation of an interpreter of EMTPL which is based on the notion of labeled computation tree (see \cite{Gabbay87}). We compare our proposal with another approach of this kind concluding that EMTPL has a better specification on the logical layer and the expressivity of our programming language is strictly greater.