Abstract
A new definition of order-sorted algebras is given which unifies the approaches to be found in the literature. We claim that some conceptual clarification is obtained without losing out on technical simplicity. The corresponding theory is developed and related to the literature. Specifically, we prove completeness with regard to an appropriate deduction system.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
7. References
Martin Gogolla, Algebraic specifications with subsorts and declarations, Forschungsbericht Nr. 169, Universität Dortmund, Abteilung Informatik, 1983, also in: Bruno Courcelle (editor), Proceedings Ninth CAAP (Bordeaux), Cambridge University Press, 1984
Joseph Goguen, Order Sorted Algebra, Technical Report 14, UCLA Computer Science Department, 1978
Joseph Goguen, José Meseguer, Order-sorted algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations, Technical Report SRI-CSL-89-10. Computer Science Laboratory, SRI International, July 1989
Axel Poigné, Another look at parameterization using algebraic specifications with subsorts, in: Proceedings MFCS 84, LNCS 176, Springer, 1984
Axel Poigné, Partial algebras, subsorting and dependent types, in: D.Sannella, A.Tarlecki (editors), Recent Trends in Data Type Specification, LNCS 332, 1988
Axel Poigné, Parameterization for order-sorted algebraic specification, JCSS Vol.40, No.2, 1990
Gert Smolka, Order-Sorted Horn Logic: Semantics and Deduction, Technical Report SEKI-Report Sr-86-17, Fachbereich Informatik, Universität Kaiserslautern, 1986
Christopher Strachey, Fundamental concepts in programming languages. Lecture Notes from International Summer School in Programming, Copenhagen, 1967
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poigné, A. (1991). Once more on order-sorted algebras. In: Tarlecki, A. (eds) Mathematical Foundations of Computer Science 1991. MFCS 1991. Lecture Notes in Computer Science, vol 520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54345-7_83
Download citation
DOI: https://doi.org/10.1007/3-540-54345-7_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54345-9
Online ISBN: 978-3-540-47579-8
eBook Packages: Springer Book Archive