Abstract
As a first step towards an integration of Object-Oriented Programming and Declarative Programming we present a purely algebraic framework for the specification of inheritance and object hierarchies, based on the known idea of representing records as order-sorted feature terms. Specifications in our formalism have an intended semantics which can be formally characterized as an initial algebra. We argue that the new formalism improves over some shortcomings of related approaches. In particular, we can express a novel mechanism called genetic inheritance, which allows to deal with multiple inheritance in a very flexible way.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work is supported by both Spanish CICYT Project CPD (TIC95-0433-C03-01), and UCM Project PDPGO (UCM-5621).
This work is supported by Spanish CICYT Project CPD (TIC95-0433-C03-01).
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. Aït-Kaci, A. Podelski, G. Smolka, A Feature-based Constraint System for Logic Programming with Entailment, Theoretical Computer Science 122 (1–2):263–283, Elsevier 1994.
J. M. Andreoli, R. Pareschi, Linear Objects: Logical Processes with built-in inheritance, New Generation Computing 9 (3–4):445–473, 1991.
R. Backofen, G. Smolka, A Complete and Recursive Feature Theory, Theoretical Computer Science 146 (1–2):243–268, Elsevier 1995.
M. Bugliesi, G. Delzamo, L. Liquori, M. Martelli, A Linear Logic Calculus of Objects, to appear in Proceedings of JICSLP'96, 1996.
K. Fisher, F. Honsell, J.C. Mitchell, A Lambda Calculus of Objects and Method Specialization, Nordic Journal of Computing 1 (1):3–37, 1994.
J. Goguen, J. Meseguer, Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations, Theoretical Computer Science 105:217–273, Elsevier 1992.
J. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, J. P. Jouannaud, Introducing OBJ3, Technical Report SRI-CSL-92-03, SRI International, Computer Science Laboratory, 1993.
M. Henz, G. Smolka, J. Würtz, Object-oriented concurrent constraint programming in Oz, in V. Saraswat and P. Van Henterick, eds., Principles and Practice of Constraint Programming Chap. 2:27–48, MIT Press, Cambridge, MA 1995.
J. Mateos-Lago, M. Rodríguez-Artalejo, GOTA Algebras, Technical Report 26/96, Departamento de Informática y Automática, Universidad Complutense de Madrid, 1996.
J. Meseguer, A Logical Theory of Concurrent Objects and Its Realization in the Maude Language, in G. Agha, P. Wegner, A. Yonezawa, eds., Research Directions in Concurrent Object-Oriented Programming:315–390, MIT Press 1993.
G. Smolka, H. Aït-Kaci, Inheritance Hierarchies: Semantics and Unification, Journal of Symbolic Computation 7:343–370, Academic Press 1989.
G. Smolka, W. Nutt, J. Goguen, J. Meseguer, Order-sorted equational computation, in M. Nivat, H. Aït-Kaci, eds., Resolution of Equations in Algebraic Structures:299–367, Academic Press 1989.
G. Smolka, R. Treinen, Records for Logic Programming, Journal of Logic Programming 18 (3):229–258, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mateos-Lago, J., Rodríguez-Artalejo, M. (1996). GOTA algebras: A specification formalism for inheritance and object hierarchies. In: Kuchen, H., Doaitse Swierstra, S. (eds) Programming Languages: Implementations, Logics, and Programs. PLILP 1996. Lecture Notes in Computer Science, vol 1140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61756-6_77
Download citation
DOI: https://doi.org/10.1007/3-540-61756-6_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61756-3
Online ISBN: 978-3-540-70654-0
eBook Packages: Springer Book Archive