Skip to main content

Unified algebras and abstract syntax

  • Contributed Papers
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 785))

Abstract

We consider the algebraic specification of abstract syntax in the framework of unified algebras. We illustrate the expressiveness of unified algebraic specifications, and provide a grammar-like notation for specifying abstract syntax, particularly attractive for use in semantic descriptions of full-scale programming languages.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. M. Antimirov and P. D. Mosses. Rewriting extended regular expressions. Technical Monograph DAIMI PB-461, Computer Science Dept., Aarhus University, 1993. A short version is to appear in Proc. Conf. on Developments in Language Theory, ed. A. Salomaa, World Scientific Publ.

    Google Scholar 

  2. D. Bjørner and C. B. Jones, editors. Formal Specification & Software Development. Prentice-Hall, 1982.

    Google Scholar 

  3. J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J. B. Wright. Initial algebra semantics and continuous algebras. J. ACM, 24:68–95, 1977.

    Google Scholar 

  4. G. Grätzer. Lattice Theory; First Concepts and Distributive Lattices. W. H. Freeman & Co., 1971.

    Google Scholar 

  5. G. Kahn et al. Metal: A formalism to specify formalisms. Sci. Compu. Programming, 3:151–188, 1983.

    Google Scholar 

  6. P. Klint. A meta-environment for generating programming environments. In Algebraic Methods II: Theory, Tools, and Applications, volume 490 of Lecture Notes in Computer Science, pages 105–124. Springer-Verlag, 1991.

    Google Scholar 

  7. D. Kozen. A completeness theorem for Kleene algebras and the algebra of regular events. In LICS'91, Proc. 6th Ann. Symp. on Logic in Computer Science, pages 214–225. IEEE, 1991.

    Google Scholar 

  8. D. Kozen. On action algebras. Technical Monograph DAIMI PB-381, Computer Science Dept., Aarhus University, 1992.

    Google Scholar 

  9. J. McCarthy. Towards a mathematical science of computation. In Information Processing 62, Proc. IFIP Congress 62, pages 21–28. North-Holland, 1962.

    Google Scholar 

  10. P. D. Mosses. Unified algebras and institutions. In LICS'89, Proc. 4th Ann. Symp. on Logic in Computer Science, pages 304–312. IEEE, 1989.

    Google Scholar 

  11. P. D. Mosses. Denotational semantics. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 11. Elsevier Science Publishers, Amsterdam; and MIT Press, 1990.

    Google Scholar 

  12. P. D. Mosses. Action Semantics, volume 26 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1992.

    Google Scholar 

  13. P. D. Mosses. The use of sorts in algebraic specifications. In Proc. 8th Workshop on Abstract Data Types and 3rd COMPASS Workshop, volume 655 of Lecture Notes in Computer Science, pages 66–91. Springer-Verlag, 1993.

    Google Scholar 

  14. V. Pratt. Action logic and pure induction. In Logics in AI, Proc. European Workshop JELIA '90, volume 478 of Lecture Notes in Computer Science, pages 97–120. Springer-Verlag, 1990.

    Google Scholar 

  15. T. W. Reps and T. Teitelbaum. The Synthesizer Generator Reference Manual. Springer-Verlag, third edition, 1989.

    Google Scholar 

  16. D. A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn & Bacon, 1986.

    Google Scholar 

  17. D. S. Scott and C. Strachey. Toward a mathematical semantics for computer languages. In Proc. Symp. on Computers and Automata, volume 21 of Microwave Research Institute Symposia Series. Polytechnic Institute of Brooklyn, 1971.

    Google Scholar 

  18. J. E. Stoy. Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory. MIT Press, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Hartmut Ehrig Fernando Orejas

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mosses, P.D. (1994). Unified algebras and abstract syntax. In: Ehrig, H., Orejas, F. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1992 1992. Lecture Notes in Computer Science, vol 785. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57867-6_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-57867-6_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57867-3

  • Online ISBN: 978-3-540-48361-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics