Abstract
A signature Σ gives rise to a language LΣ(Var) by extending Σ with variables x ∈ Var and binding constructs μ x and ν x, corresponding to least and greatest fixed points respectively. The natural denotational models for such languages are bicomplete dcpos as monotone Σ-algebras. We prove that several approximating denotational semantics have the usual compositional semantics as their limit. These results provide techniques for relating syntactic and semantic concepts such as in full abstraction or completeness proofs. In the presence of an involutive antitone map on a bicomplete dcpo D we may translate the language LΣ(Var) into one with least fixed points only such that meanings are preserved. This allows an approximative semantics where least and greatest fixed points are simultaneously approximated by ‘unwindings’ in the syntax, provided that the limit semantics is substitutive. We discuss the principal difficulties of simultaneous unwindings in the absence of such semantic negations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abramsky, S.: A domain equation for bisimulation, Inform. and Comput. 92 (1991), 161–218.
Abramsky, S. and Jung, A.: Domain theory, in S. Abramsky, D. M. Gabbay, and T. S. E. Maibaum (eds.), Handbook of Logic in Computer Science, Vol. 3, Clarendon Press, 1994, pp. 1–168.
Cousot, P. and Cousot, R.: Inductive definitions, semantics and abstract interpretations, in 19th Conference on Principles in Programming Languages, 1992, pp. 83–94.
Grätzer, G.: Universal Algebra, Second edn, Springer-Verlag, New York, Heidelberg, Berlin, 1979.
Gunter, C. and Scott, D. S.: 12: Semantic domains, in Jan van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 633–674.
Hartonas, C.: A calculus for finite delay and fairness, Department of Computer Science, University of Manchester, 1996.
Hennessy, M. C. B.: Modelling finite delay operators, Technical Report CSR–153–83, University of Edinburgh. Department of Computer Science, 1983.
Huth, M. and Kwiatkowska, M.: Finite but unbounded delay in synchronous CCS, in A. Edalat, S. Jourdan, and G. McCusker (eds.), Advances in Theory and Formal Methods of Computing: Proceedings of the Third Imperial College Workshop, April 1996, Imperial College Press, 1996, pp. 312–323.
Huth, M. and Kwiatkowska, M.: The semantics of fair recursion with divergence, Technical report, School of Computer Science, University of Birmingham, United Kingdom, May 1996.
Kozen, D.: Results on the propositional mu-calculus, Theoret. Comput. Sci. 27 (1983), 333–354.
Milner, R.: A finite delay operator in synchronous CCS, Technical Report CSR–116–82, University of Edinburgh, 1982.
Mosses, P. D.: Denotational semantics, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990, pp. 577–632.
Park, D. M.: On the semantics of fair parallelism, in D. Bjorner (ed.), Abstract Software Specifications, Lecture Notes in Computer Science 86, Springer-Verlag, 1980, pp. 504–526.
Park, D. M.: Concurrency on automata and infinite sequences, in P. Deussen (ed.), Conference on Theoretical Computer Science, Lecture Notes in Computer Science 104, Springer-Verlag, 1981.
Scott, D. S.: Outline of a mathematical theory of computation, in 4th Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 169–176.
Stoughton, A.: Fully Abstract Models of Programming Languages, Research Notes in Theoretical Computer Science, Pitman/Wiley, 1988.
Thomas, W.: Automata on infinite objects, in J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, North-Holland, Amsterdam, 1990, pp. 133–191.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Huth, M. On the Approximation of Denotational Mu-Semantics. Applied Categorical Structures 7, 85–111 (1999). https://doi.org/10.1023/A:1008692203004
Issue Date:
DOI: https://doi.org/10.1023/A:1008692203004