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

被引：26
|
作者：
Rodriguez-Lopez, J. [2 ]
Romaguera, S. [2 ]
Valero, O. [1 ]
机构：
[1] Univ Islas Baleares, Dept Matemat & Informat, Baleares 07122, Spain
[2] Univ Politecn Valencia, IMPA UPV, Dept Matemat Aplicada, E-46071 Valencia, Spain
来源：
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2008年 / 85卷 / 3-4期
关键词：
algorithm; Baire metric; balanced quasi-metric; domain of words; recurrence equation;
D O I：
10.1080/00207160701210653
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：623 / 630
页数：8
相关论文
共 11 条
12