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

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 cla...

Full description

Saved in:
Bibliographic Details
Published in:International journal of computer mathematics Vol. 85; no. 3-4; pp. 623 - 630
Main Authors: Rodríguez-López, J., Romaguera, S., Valero, O.
Format: Journal Article
Language:English
Published: Taylor & Francis 01.04.2008
Subjects:
Algorithm
Baire metric
Balanced quasi-metric
Domain of words
Recurrence equation
Physical Sciences
ISSN:0020-7160, 1029-0265
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160701210653