Advertisement

Order-sorted algebraic specifications with higher-order functions

  • Anne Elisabeth Haxthausen
Refereed Contributions Algebraic and Logical Foundations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 936)

Abstract

This paper gives a proposal for how order-sorted algebraic specification languages can be extended with higher-order functions. The approach taken is a generalisation to the order-sorted case of an approach given by Möller, Tarlecki and Wirsing for the many-sorted case. The main idea in the proposal is to only consider reachable extensional algebras. This leads to a very simple theory, where it is possible to relate the higher-order specifications to first order specifications.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [EM85]
    H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1, Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science, vol. 6. Springer-Verlag, 1985.Google Scholar
  2. [FGJM85]
    K. Futatsugi, J. Goguen, J. Jouannaud, and J. Meseguer. Principles of OBJ2. In 12th Symposium on POPL. Association for Computing Machinery, 1985.Google Scholar
  3. [GM92]
    J. Goguen and J. Meseguer. Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations. Theoretical Computer Science, 105(2), 1992.Google Scholar
  4. [Gog88]
    J. Goguen. Higher-Order Functions Considered Unnecessary for Higher Order Programming. Technical Report SRI-CSL-88-1R, SRI Int., 1988.Google Scholar
  5. [Rlg92]
    The RAISE Language Group. The RAISE Specification Language. The BCS Practitioners Series. Prentice Hall Int., 1992.Google Scholar
  6. [GWM+92]
    J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J. Jouannaud. Introducing OBJ. Technical Report SRI-CSL-92-03, SRI Int., 1992. Draft.Google Scholar
  7. [Hax94]
    A. E. Haxthausen. Algebraic Specification with Higher-Order Functions. Technical Report ETL TR-94-18, Electrotechnical Laboratory, 1994.Google Scholar
  8. [MÖl86]
    B. Möller. Algebraic Specification with Higher-Order Operations. In IFIP TC2 Working Conference on Program Specification and Transformation. North-Holland, 1986.Google Scholar
  9. [MOM90]
    N. Marti-Oliet and J. Meseguer. Inclusions and Subtypes. Technical Report SRI-CSL-90-16, SRI Int., 1990.Google Scholar
  10. [MTW88a]
    B. Möller, A. Tarlecki, and M. Wirsing. Algebraic Specification of Reachable Higher-Order Algebras. In 5th workshop on Specification of Abstract Datatypes, number 332 in LNCS. Springer-Verlag, 1988.Google Scholar
  11. [MTW88b]
    B. Möller, A. Tarlecki, and M. Wirsing. Algebraic Specifications with Built-in Domain Constructions. In CAAP'88, number 299 in LNCS. Springer-Verlag, 1988.Google Scholar
  12. [Poi86]
    A. Poigné. On Specifications, Theories and Models with Higher Types. Information and Control, 68, 1986.Google Scholar
  13. [Qia89]
    Z. Qian. Relation-sorted algebraic specifications with built-in coercers: Parameterization and parameter passing. In Categorical Methods in Computer Science, number 393 in LNCS. Springer-Verlag, 1989.Google Scholar
  14. [Qia90]
    Z. Qian. Higher-Order Order-Sorted Algebras. In Algebraic and Logic Programming, number 463 in LNCS. Springer-Verlag, 1990.Google Scholar
  15. [Rey80]
    J. Reynolds. Using category theory to design implicit conversions and generic operators. In Semantics-Directed Compiler Generation, number 94 in LNCS. Springer-Verlag, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Anne Elisabeth Haxthausen
    • 1
  1. 1.Department of Computer ScienceTechnical University of DenmarkLyngbyDenmark

Personalised recommendations