A complete algebraic characterization of behavioral subtyping

Acta Informatica

Volumn 36, Issue 8, 2000, Pages 617-663

  Leavens, Gary T ^a   Pigozzi, Don ^b  

^a Iowa State University   (United States)

^b IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034144976     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050168     Document Type: Article

References (27)

1. 1. P. America: Designing an Object-Oriented Programming Langauge with Behavioral Subtyping. Foundations of Object-Oriented Languages, REX School/Workshop, Noordijkerhout, The Netherlands, May/June 1990 (J. W. de Bakker and W. P. de Roever and G. Rozenberg, eds.), Lecture Notes in Computer Science, Vol. 489, pp. 60-90, New York: Springer 1991
2. 2. K. Bruce, L. Cardelli, G. Castagna: The Hopkins Object Group, G.T. Leavens, and B. Pierce: On Binary Methods, Theory and Practice of Object Systems 1, pp. 221-242, New York: Wiley 1995
3. 3. K.B. Bruce, P. Wegner: An Algebraic Model of Subtype and Inheritance. Advances in Database Programming Languages. (F. Bançilhon and P. Buneman, eds.), pp. 75-96, Reading, Mass.: Addison-Wesley 1990
4. 4. L. Cardelli: A Semantics of Multiple Inheritance, Inf Comput 76, 138-164 (1988)
5. 5. G. Castagna: Object-Oriented Programming: A Unified Foundation. Progress in Theoretical Computer Science Series, Boston: Birkhauser 1997
6. 6. K.K. Dhara, G.T. Leavens: Weak Behavioral Subtyping for Types with Mutable Objects. Mathematical Foundations of Programming Semantics, Eleventh Annual Conference (S. Brookes, M. Main, A. Melton and M. Mislove, eds.), Electronic Notes in Theoretical Computer Science, Vol. 1, Amsterdam: Elsevier 1995
7. 7. K.K. Dhara, G.T. Leavens: Forcing Behavioral Subtyping Through Specification Inheritance, Proceedings of the 18th International Conference on Software Engineering, Berlin, Germany IEEE Computer Society Press, pp. 258-267, 1996
8. 8. J.A. Goguen: Realization is Universal, Math. Systems Theory 6, 359-374 (1973)
9. 9. J.A. Goguen: Order Sorted Algebras, Technical Report 14, UCLA Computer Science Department (1978), Semantics and Theory of Computation Series
10. 10. J. Goguen, J. Meseguer: Universal Realization, Persistent Interconnection and Implementation of Abstract Modules, Proceedings, 9th International Conference on Automata, Languages and Programming (M. Nielsen and E.M. Schmidt, eds.), Lecture Notes in Computer Science, Vol. 140, pp. 265-281, New York: Springer 1982
11. 11. J. Goguen, J. Meseguer: Initiality, Induction and Computability, Algebraic Methods in Semantics (M. Nivat and J. Reynolds, eds.) pp. 459-541, Cambridge: Cambridge University Press 1985
12. 12. J. Goguen, J. Meseguer: Order-Sorted Algebra I: Equational Deduction for Multiple Inheritance, Overloading, Exceptions and Partial Operations, Theor. Comput. Sci. 105, 217-273 (1987)
13. 13. J. Goguen, J. Meseguer: Order-Sorted Algebra Solves the Constructor-Selector, Multiple Representation and Coercion Problems, Symposium on Logic in Computer Science, Ithaca, NY IEEE, pp. 18-29, 1987
14. 14. A. Jung, J. Tiuryn: A new characterization of lambda definability, in Typed lambda calculus and applications. International Conference on Typed Lambda Calculus and Applications, TLCA '93 March 1993, Utrecht, The Netherlands Proceedings. (M. Bezem and J. F. Groote, eds.) Lecture Notes in Computer Science, Vol. 598, pp. 245-257, Berlin: Springer 1993
15. 15. G.T. Leavens, T.D. Millstein: Multiple Dispatch as Dispatch on Tuples, OOPSLA '98 Conference Proceedings, ACM SIGPLAN Notices Vol. 33, ACM, New York, pp. 374-387, 1998
16. 16. G.T. Leavens, D. Pigozzi: Typed Homomorphic Relations Extended with Subtypes, Mathematical Foundations of Programming Semantics '91 (S. Brookes, ed.), Lecture Notes in Computer Science Vol. 598, pp. 144-167, New York: Springer 1992
17. 17. G.T. Leavens, D. Pigozzi: The Behavior-Realization Adjunction and Generalized Homomorphic Relations, Theor. Comput. Sci. 177, 183-216 (1997) An extended version is available as [18]
18. 18. G.T. Leavens, D. Pigozzi: The Behavior-Realization Adjunction and Generalized Homomorphic Relations, Department of Computer Science, Iowa State University, TR #94-18b. Available by anonymous ftp from ftp.cs.iastate.edu and by e-mail from alamanc@cs.iastate.edu (September 1994, revised September 1994, July 1996)
19. 19. G.T. Leavens, D. Pigozzi: An exact algebraic characterization of behavioral subtyping, Preprint núm. 315, Centre de Recerca Matemática, Istitut d'Estudis Catalans (Desembre 1995)
20. 20. G.T. Leavens, D. Pigozzi: Class-Based and Algebraic Models of Objects, US-Brazil Joint Workshops on the Formal Foundations of Software Systems (Rance Cleaveland, Michael Mislove and Philip Mulry, eds.), Electronic Notes in Theoretical Computer Science, Vol. 14, pp. 183-216, Amsterdam: Elsevier 1999, http://www.elsevier.nl/locate/entcs/volume14.html
21. 21. G.T. Leavens, W.E. Weihl: Reasoning about Object-oriented Programs that use Subtypes (extended abstract), ECOOP/OOPSLA '90 Proceedings (N. Meyrowitz, ed.) ACM SIGPLAN Notices Vol. 25, ACM October, pp. 212-223, 1990
22. 22. G.T. Leavens, W.E. Weihl: Specification and Verification of Object-Oriented Programs Using Supertype Abstraction, Acta Informatica 32, 705-778 (1995)
23. 23. B. Liskov, J. Wing: A Behavioral Notion of Subtyping, ACM Transactions on Programming Languages and Systems 16, 1811-1841 (1994)
24. 24. J.C. Reynolds: Using Category Theory to Design Implicit Conversions and Generic Operators, Semantics-Directed Compiler Generation, Proceedings of a Workshop, Aarhus, Denmark (N. D. Jones, ed.) Lecture Notes in Computer Science, Vol. 94, pp. 211-258, New York: Springer 1980
25. 25. K. Sieber: Reasoning about sequential functions via logical relations, Applications of Categories in Computer Science. Proceedings of the LMS Symposium, Durham 1991 (M. P. Fourman, P. T. Johnstone, and A. M. Pitts, eds.), London Mathematical Society Lecture Note Series, Vol. 177, pp. 258-269, Cambridge: Cambridge University Press 1992
26. 26. O. Schoett: Behavioural Correctness of Data Representations, Sci Comput Program 14, 43-57 (1990)
27. 27. P. Wadler, S. Blott: How to make ad-hoc Polymorphism less ad hoc, Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, Austin, Texas ACM, New York, pp. 60-76, 1989