71
Views
26
CrossRef citations to date
0
Altmetric
Original Articles

Denotational semantics for programming languages, balanced quasi-metrics and fixed points

, &
Pages 623-630 | Received 20 Oct 2006, Accepted 02 Jan 2007, Published online: 22 Sep 2010
 

Abstract

A new mathematical model is introduced for the study of the domain of words. We do it by means of the introduction of a suitable balanced quasi-metric on the set of all words over an alphabet. It will be shown that this construction has better quasi-metric and topological properties than several classical constructions. We also prove a fixed point theorem which allows us to develop an application for the study of probabilistic divide and conquer algorithms.

Acknowledgements

The authors thank the referees for their valuable suggestions. The authors are also grateful for the support of the Spanish Ministry of Education and Science, and FEDER, grant MTM2006-14925-C02-01.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.