Skip to main content
Springer Nature Link
Log in

Combining algebraic and set-theoretic specifications

  • Contributions
  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1995, COMPASS 1995)

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

  • 161 Accesses

Abstract

Specification frameworks such as B and Z provide power sets and cartesian products as built-in type constructors, and employ a rich notation for defining (among other things) abstract data types using formulae of predicate logic and lambda-notation. In contrast, the so-called algebraic specification frameworks often limit the type structure to sort constants and first-order functionalities, and restrict formulae to (conditional) equations. Here, we propose an intermediate framework where algebraic specifications are enriched with a set-theoretic type structure, but formulae remain in the logic of equational Horn clauses. This combines an expressive yet modest specification notation with simple semantics and tractable proof theory.

This work was partially supported by Compass (Esprit Basic Research Working Group 6112).

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. J. R. Abrial. B-Tool Reference Manual. Edinburgh Portable Compiler, 1991.

    Google Scholar 

  2. L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder. Basic paramodulation and superposition. In D. Kapur, editor, Proceedings 11th International Conference on Automated Deduction, Saratoga Springs (N. Y., USA), volume 607 of Lecture Notes in Computer Science, pages 462–476. Springer-Verlag, 1992.

    Google Scholar 

  3. J. Dawes. The VDM-SL Reference Guide. Pitman, 1991.

    Google Scholar 

  4. N. Dershowitz. Termination of rewriting. Journal of Symbolic Computation, 3(1 & 2):69–116, 1987.

    Google Scholar 

  5. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1. Equations and initial semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer-Verlag, 1985.

    Google Scholar 

  6. C. Hintermeier. Déduction avec sortes ordonnées et égalités. Thèse de Doctorat d'Université, Université Henri Poincaré-Nancy 1, Oct. 1995.

    Google Scholar 

  7. C. Hintermeier, H. Kirchner, and P. D. Mosses. Combining algebraic and settheoretic specifications (extended version). Technical report, Centre de Recherche en Informatique de Nancy, 1996.

    Google Scholar 

  8. C. Hintermeier, H. Kirchner, and P. D. Mosses. R n- and G n-logics. In Proceedings of Second International Workshop on Higher-Order Algebra, Logic and Term Rewriting, Paderborn (Germany), Sept. 1995.

    Google Scholar 

  9. T. S. E. Maibaum and C. J. Lucena. Higher order data types. International Journal of Computer and Information Sciences, 9:31–53, 1980.

    Google Scholar 

  10. V. Manca, A. Salibra, and G. Scollo. Equational type logic. Theoretical Computer Science, 77(1–2): 131–159, 1990.

    Google Scholar 

  11. K. Meinke. Universal algebra in higher types. Theoretical Computer Science, 100:385–417, 1992.

    Google Scholar 

  12. B. Möller. Algebraic specifications with high-order operators. In L. Meertens, editor, Proceedings IFIP TC2 Working Conf. on Program Specification and Transformation, pages 367–392. IFIP, Elsevier Science Publishers B. V. (North-Holland), 1987.

    Google Scholar 

  13. B. Möller, A. Tarlecki, and M. Wirsing. Algebraic specification with built-in domain constructions. In M. Dauchet and M. Nivat, editors, Proceedings of CAAP'88, Lecture Notes in Computer Science, pages 132–148. Springer-Verlag, 1988.

    Google Scholar 

  14. B. Möller, A. Tarlecki, and M. Wirsing. Algebraic specifications or reachable higher-order algebras. In D. Sannella and A. Tarlecki, editors, Recent Trends in Data Type Specification, volume 332 of Lecture Notes in Computer Science, pages 154–169. Springer-Verlag, 1988.

    Google Scholar 

  15. P. D. Mosses. Unified algebras and institutions. In Proceedings 4th IEEE Symposium on Logic in Computer Science, Pacific Grove, pages 304–312, 1989.

    Google Scholar 

  16. R. Nieuwenhuis and A. Rubio. Theorem proving with ordering constrained clauses. In D. Kapur, editor, Proceedings 11th International Conference on Automated Deduction, Saratoga Springs (N. Y., USA), volume 607 of Lecture Notes in Computer Science, pages 477–491. Springer-Verlag, 1992.

    Google Scholar 

  17. A. Poigné. Partial algebras, subsorting and dependent types. prerequisites of error handling in algebraic specifications. In Proceedings of Workshop on Abstract Data Types, volume 332 of Lecture Notes in Computer Science. Springer-Verlag, 1988.

    Google Scholar 

  18. J. M. Spivey. Understanding Z: a specification language and its formal semantics. Cambridge University Press, 1988.

    Google Scholar 

  19. A. N. Whitehead and B. Russell. Principia Mathematica, volume 1. Cambridge University Press, Cambridge, MA, 1925.

    Google Scholar 

  20. M. Wirsing. Algebraic specification. In J. van Leeuwen, A. Meyer, M. Nivat, M. Paterson, and D. Perrin, editors, Handbook of Theoretical Computer Science, volume B, chapter 13. Elsevier Science Publishers B. V. (North-Holland) and The MIT press, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CRIN-CNRS & INRIA-Lorraine, BP 239, F-54506, Vandœuvre-lès-Nancy Cedex, France

    Hélène Kirchner

  2. BRICS, Dept. of Computer Science, University of Aarhus, Ny Munkegade, bldg. 540, DK-8000, Aarhus C, Denmark

    Peter D. Mosses

Authors
  1. Claus Hintermeier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hélène Kirchner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter D. Mosses
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Magne Haveraaen Olaf Owe Ole-Johan Dahl

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hintermeier, C., Kirchner, H., Mosses, P.D. (1996). Combining algebraic and set-theoretic specifications. In: Haveraaen, M., Owe, O., Dahl, OJ. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1995 1995. Lecture Notes in Computer Science, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61629-2_47

Download citation

  • DOI: https://doi.org/10.1007/3-540-61629-2_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61629-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics