Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Higher-Order Algebra, Logic, and Term Rewriting

HOA 1993: Higher-Order Algebra, Logic, and Term Rewriting pp 146–168Cite as

ATLAS: A typed language for algebraic specification

  • Conference paper
  • First Online:

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

Abstract

We introduce an implementation of rewriting for type and combinator terms called ATLAS. This system implements the algebraic and term rewriting theory for abstract types and combinators developed in Meinke [1991, 1992b]. The system is intended to support the execution of equational specifications of abstract types and combinators. The type checking algorithms of the system also allow it to function as a framework for defining logics and proof checking. We present a short tutorial introduction to ATLAS by means of examples taken from first and higher order algebraic specifications and logics.

We thank U. Berger, J.R. Hindley, J.V. Tucker and E.G. Wagner for helpful comments on this work. We also acknowledge the financial support of the Science and Engineering Research Council, the British Council and IBM T.J. Watson Research Center.

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

  • J. A. Bergstra and J. V. Tucker, A natural data type with a finite equational final semantics but no effective equational initial semantics specification, Bull. EATCS 11, 23–33 (1980).

    Google Scholar 

  • J. A. Bergstra and J. V. Tucker, The inescapable stack: an exercise in algebraic specification with total functions, second revised edition, P8804b, Programming Research Group, University of Amsterdam, 1990.

    Google Scholar 

  • J. A. Goguen, Order-sorted algebra, semantics and theory of computation, Report 14, Computer Science Dept, UCLA, 1978.

    Google Scholar 

  • B.M. Hearn, Implementation of a Typed Language for Algebraic Specifications, PhD. Thesis, Department of Computer Science, University College of Swansea, (to appear), 1994.

    Google Scholar 

  • G. Huet and G. Plotkin (eds), Logical Frameworks, Cambridge University Press, Cambridge, 1991.

    Google Scholar 

  • K. Meinke, Equational specification of abstract types and combinators, Report CSR 11–91, Dept. of Computer Science, University College Swansea, to appear in: G. Jäger (ed), Proc. Computer Science Logic '91, Lecture Notes in Computer Science 626, Springer Verlag, Berlin, 1991.

    Google Scholar 

  • Meinke [1992a], K. Meinke, Universal algebra in higher types, Theoretical Computer Science, 100, (1992) 385–417.

    Google Scholar 

  • Meinke [1992b], K. Meinke, Algebraic semantics of rewriting terms and types, in M. Rusinowitch and J-L. Remy (eds), Proc. Third Int. Conf. on Conditional Term Rewriting Systems, Lecture Notes in Computer Science 656, Springer Verlag, Berlin 1992.

    Google Scholar 

  • K. Meinke, Subdirect representation of higher type algebras, Report CSR 14-90, Dept. of Computer Science, University College Swansea, in: K. Meinke and J.V. Tucker (eds), Many-Sorted Logic and its Applications, John Wiley, 1993.

    Google Scholar 

  • K. Meinke, A recursive second order initial algebra specification of primitive recursion, to appear in Acta Informatica, 1994.

    Google Scholar 

  • K. Meinke and L.J. Steggles, Specification and verification in higher order algebra: a case study of convolution, this conference proceedings, 1994.

    Google Scholar 

  • K. Meinke and J.V. Tucker, Universal algebra, 189–411 in: S. Abramsky, D. Gabbay and T.S.E. Maibaum, (eds) Handbook of Logic in Computer Science, Oxford University Press, Oxford, 1992.

    Google Scholar 

  • B. Möller, Higher-order algebraic specifications, Facultät für Mathematik und Informatik, Technische Universität München, Habilitationsschrift, 1987.

    Google Scholar 

  • B. Möller, Ordered and continuous models of higher order algebraic specifications, this conference proceedings, 1994.

    Google Scholar 

  • B. Möller, A. Tarlecki and M. Wirsing, Algebraic specifications of reachable higher-order algebras, in: D. Sannella and A. Tarlecki (eds), Recent Trends in Data Type Specification, Lecture Notes in Computer Science 332, (Springer Verlag, Berlin, 1988) 154–169.

    Google Scholar 

  • M. Wirsing, Algebraic Specification, 675–788 in: J. Van Leeuwen (ed.), Handbook of Theoretical Computer Science, Volume B — Formal Models and Semantics, Elsevier, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College of Swansea, SA2 8PP, Singleton Park, Swansea, Great Britain

    B. M. Hearn & K. Meinke

Authors
  1. B. M. Hearn
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Meinke
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Heering Karl Meinke Bernhard Möller Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hearn, B.M., Meinke, K. (1994). ATLAS: A typed language for algebraic specification. In: Heering, J., Meinke, K., Möller, B., Nipkow, T. (eds) Higher-Order Algebra, Logic, and Term Rewriting. HOA 1993. Lecture Notes in Computer Science, vol 816. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58233-9_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-58233-9_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58233-5

  • Online ISBN: 978-3-540-48579-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation