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

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:International journal of computer mathematics Ročník 85; číslo 3-4; s. 623 - 630
Hlavní autori: Rodríguez-López, J., Romaguera, S., Valero, O.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Taylor & Francis 01.04.2008
Predmet:
Algorithm
Baire metric
Balanced quasi-metric
Domain of words
Recurrence equation
Physical Sciences
ISSN:0020-7160, 1029-0265
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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.
Bibliografia:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-7160
1029-0265
DOI:10.1080/00207160701210653