Cpo’s do not form a cpo and yet recursion works (1991) [1 citations — 0 self]
Download:
|
|
by Marek A. Bednarczyk, Andrzej M. Borzyszkowski
In VDM ’91, volume 551 of LNCS
ftp://ftp.ipipan.gda.pl/andrzej/reports/CPO-vsrec.ps.gz
Add To MetaCart
Abstract:
We consider type universes as examples of regular algebras in the area of denotational semantics. The paper concentrates on our method which was used implicitly to prove that the interesting domain equations have solutions in the domain universes underlying MetaSoft, cf. [BBP90], and BSI/VDM, cf. [TW90]. Technically speaking the method allows to prove regularity of a universe. It is demonstrated by means of an example that the method applies even to universes which are essentially regular, i.e., which are neither cpo's, nor the images of the initial regular algebra.
