Effective solutions to domain equations an approach to effective denotational semantics
This paper gives an effective interpretation to the construction of solutions for domain equations in a category of complete metric spaces. Our starting point is the work by P.America and J.Rutten, which we summarizes briefly. We show that their construction can be given an effective content (in the sense that the solutions are recursively presented spaces). We indicate, in the last section, how this approach can be used to estimate the complexity of the operators induced by contexts in some parallel languages.
Unable to display preview. Download preview PDF.
- [A et al]P.America, J. De Bakker, J.N.Kok, J.Rutten: Denotational Semantics of a Parallel Object-Oriented Language (Information and Computation, 83, 1989)Google Scholar
- [AR]P.America and J.Rutten: Solving reflexive domain equations in a category of complete metric spaces (JCSS., 39, 1989)Google Scholar
- [Ba]E.Badouel: Algebraically closed theories (Proceedings MFCS' 89)Google Scholar
- [B]Bourbaki: Topologie generale v.1 et 2 (Hermann)Google Scholar
- [Pl]G.Plotkin: A structural approach to operational semantics (Rep Daimi FN19, Aarhus, 1981)Google Scholar
- [Y1]S.Yoccoz: Effective denotational semantics for sequential and parallel languages, part 1 (Rapport Interne, Labri — Universite de Bordeaux-I, June 1990)Google Scholar
- [Y2]S.Yoccoz: Effective denotational semantics for sequential and parallel languages, part 2 (to appear as technical report, Labri-Université de Bordeaux 1, Aug.1990)Google Scholar