| C. Berline, Retractions et interpr#tation interne du polymorphisme : le probl#me de la r#traction universelle, Informatique Th#orique et Applications /Theoretical Informatics and Applications, vol.26, n ffi 1; p.59-91, 1992. |
....are interpreted by retractions ranging over a suitable class. The word iuniversalj refers to the fact that in these models there is a type of all types. Then Berardi [4] showed that similar work could be done for the stable semantics, taking this time the whole class of stable retractions (see [6] for a survey) We already mentioned that our continuous models are polymax, and that this could not be true for their stable analogues. By contrast u:r: models are polymax in both the continuous and stable semantics. It is possible to look for a deeper connection and to compare u:r: models with ....
.... nitary retraction [23] 31] or a universal nitary projection [1] or a universal closure [30] In the stable semantics all retractions are nitary and c can be taken as the code of any 27 universal (stable) retraction [4] The necessary background and the missing proofs below can be found in [6], which surveys the preceding works. For all u:r: models we take : T erms : M . types : f cu = u 2 Mg, ordered by the restriction of the order on M; say 6; is a Scott domain. The elements of types are hence all the retractions of M which belong to the class for which c is universal. Types ....
C. Berline, Retractions et interpr#tation interne du polymorphisme : le probl#me de la r#traction universelle, Informatique Th#orique et Applications /Theoretical Informatics and Applications, vol.26, n ffi 1; p.59-91, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC