Recursively defined domains and their induction principles

  • Finn V. Jensen
  • Kim G. Larsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 206)


Recursion is one of the main tools in denotational semantics. This paper deals with the problem of establishing induction principles for domains defined by simultaneous recursion. We are particularly interested in induction principles supporting verification of properties of elements from (any) one of the domains defined by the simultaneous recursion. We offer two such principles, with the second principle being especially well-suited for implementation in a machine system such as LCF [5].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Jensen, F. V. An LCF-system for Automatic Creation of Theories for 1-constructable Data Types. CSR 87–81, Department of Computer Science, University of Edinburgh, 1981.Google Scholar
  2. 2.
    Jensen, F.V. Induction Principles for Recursive Data Types. IR 82-7, Institute of Electronic Systems, Aalborg University Centre, 1982.Google Scholar
  3. 3.
    Jensen, F.V. Axiomatization and Induction for Data Types being Solutions to Simultaneous Domain Equations. IR 81-9, Institute of Electronic Systems, Aalborg University Centre, December, 1981.Google Scholar
  4. 4.
    Larsen, K. G. Specification of Data Types — extented abstract. IR-82-6, Institute of Electronic Systems, Aalborg University Centre, 1982.Google Scholar
  5. 5.
    Gordon, M, Milner, R and Wadsworth, C. P. LNCS. Volume 78: Edinburgh LCF Springer-Verlag, 1979.Google Scholar
  6. 6.
    Lehmann, D. and Smyth, M.B. "Algebraic Specification of Data Types: A Synthetic Approach". Math. Systems Theory 14 (1981), 97–137.CrossRefGoogle Scholar
  7. 7.
    Milner, R. How to derive inductions in LCF.Google Scholar
  8. 8.
    Paulson, Lawrence. Lecture Notes in Computer Science. Volume 173: Deriving Structural Induction in LCF. In Semantics of Data Types, International Symposium, Sophia-Antipolis, France, Proceedings, Springer-Verlag, 1984, pp. 197–215.Google Scholar
  9. 9.
    Plotkin, G. D. The Category of Complete Partial Orders: A Tool for Making Meanings. Lecture Notes, Pisa, 1978.Google Scholar
  10. 10.
    Plotkin, G.D. and Smyth, M. "The Category Theoretic Solution of Recursive domain Equations". SIAM 11, 4 (nov 1982), 761–783.CrossRefGoogle Scholar
  11. 11.
    Scott, D.S. Lecture Notes in Mathematics. Volume 274: Continuous Lattices, Toposes, Algebraic Geometry and Logic. In, Springer-Verlag, 1972, pp. 97–136. Proc. 1971 Dalhousie Conference, Ed. F.W. Lawvere.Google Scholar
  12. 12.
    Stoy, J.E.. Denotational Semantics. The Scott-Strachey approach. The MIT press, Cambridge, 1977.Google Scholar
  13. 13.
    Wadsworth, S.P. "The Relation between Computational and Denotational Properties for Scott's D-models of the Lambda-Calculus". SIAM. Jour. Comput. 5 (1976).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Finn V. Jensen
    • 1
  • Kim G. Larsen
    • 2
  1. 1.Aalborg University CenterAalborgDenmark
  2. 2.Department of Computer ScienceUniversity of EdinburghEdinburghScotland

Personalised recommendations