89
Views
0
CrossRef citations to date
0
Altmetric
Reviews

Qualitative versus quantitative fixed point techniques in computer science

&
Pages 115-127 | Received 31 Oct 2016, Published online: 19 Sep 2017
 

Abstract

In 1970, a qualitative fixed point technique useful to model the recursive specifications in denotational semantics was developed by means of the celebrated Kleene‘s fixed point theorem. Later on, in 1994 and 1995, quantitative counterparts of the aforesaid technique, but now based on generalized versions of Banach fixed point theorem, were obtained in such a way that the spirit of Kleene‘s technique was preserved. These new techniques are able to provide a measure of the information content degree and this fact has constituted an advantage with respect to the qualitative techniques. The main purpose of this paper is to discern the relationship between the aforementioned qualitative and quantitative fixed point techniques. In particular, we clarify what is the additional real contribution of the quantitative fixed point techniques with respect to the qualitative ones.

Mathematics Subject Classification (2010):

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.