The behavior-realization adjunction and generalized homomorphic relations

Theoretical Computer Science

Volumn 177, Issue 1, 1997, Pages 183-216

  Leavens, Gray 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

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; EQUIVALENCE CLASSES; MATHEMATICAL MODELS; THEOREM PROVING;

ABSTRACT DATA TYPES; BEHAVIOR REALIZATION ADJUNCTION; GENERALIZED HOMOMORPHIC RELATIONS;

DATA STRUCTURES;

EID: 0031125778     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)87172-1     Document Type: Article

References (25)

1. P. America, Designing an object-oriented programming language with behavioural subtyping, in: J.W. de Bakker and W.P. de Roever and G. Rozenberg, eds. Foundations of Object-Oriented Languages, REX School/Workshop, Noordwijkerhout, The Netherlands, May/June 1990, Lecture Notes in Computer Science, Vol. 489 (Springer, New York, 1991) 60-90.
2. G. Birkhoff, Lattice Theory, 3rd edn. American Mathematical Society Colloquium Publications, Vol. 25 (American Mathematical Society, New York, 1967).
3. K.K., Dhara and G.T. Leavens, Forcing behavioral subtyping through specification inheritance, in: Proc. 18th Internat. Conf. on Software Engineering, Berlin, Germany, IEEE (1996) pp. 258-267.
4. V. Giarratana, F. Gimona and U. Montanari, Observability concepts in abstract data type specifications, in: A. Mazurkiewicz, ed., Mathematical Foundations of Computer Science 1976, Proc. 5th Symp., Gdansk, Lecture Notes in Computer Science, Vol. 45 (Springer, New York, 1976) 576-587.
5. J.A. Goguen, Realization is universal, Math. Systems Theory 6 (1973) 359-374.
6. J. Goguen and J. Meseguer, Universal realization, persistent interconnection and implementation of abstract modules, in: M. Nielsen and E.M. Schmidt, eds., Proc. 9th Internat. Conf. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 140 (Springer, New York, 1982) 265-281.
7. J. Goguen and J. Meseguer, Initiality, induction and computability, in: M. Nivat and J. Reynolds, eds., Algebraic Methods in Semantics (Cambridge University Press, Cambridge, 1985) 459-541.
8. J.A. Goguen and J.W. Thatcher and E.G. Wagner, An initial algebra approach to the specification, correctness and implementation of abstract data types, in: R.T. Yeh, ed., Current Trends in Programming Methodology Vol. 4 (Prentice-Hall, Englewood Cliffs, NJ, 1978) 80-149.
9. J. Guttag and J.J. Horning, The algebraic specification of abstract data types, Acta Inform. 10 (1978) 27-52.
10. A. Jung and J. Tiuryn, A new characterization of lambda definability, in: M. Bezem and J.F. Groote, eds., Internat. Conf. on Typed Lambda Calculus and Applications, TLCA'93 Utrecht. The Netherlands, Lecture Notes in Computer Science, Vol. 598 (Springer, Berlin, 1993) 245-257.
11. G.T. Leavens, Modular specification and verification of object-oriented programs, IEEE Software 8 (1991) 72-80.
12. G.T. Leavens and D. Pigozzi, Typed homomorphic relations extended with subtypes, in: S. Brookes, ed., Mathematical Foundations of Programming Semantics'91, Lecture Notes in Computer Science, Vol. 598 (Springer, New York, 1992) 144-167.
13. G.T. Leavens and D. Pigozzi, The behavior-realization adjunction and generalized homomorphic relations, Tech. Report #94-18, Department of Computer Science, Iowa State University (1994).
14. B. Liskov and J. Wing, A behavioral notion of subtyping TOPLAS 16 (1994) 1811-1841.
15. S. MacLane, Categories for the Working Mathematician, Graduate Texts in Mathematics, Vol. 5 (Springer, New York, 1971).
16. T. Nipkow, Non-deterministic data types: models and implementations, Acta Inform. 22 (1986) 629-661.
17. J.C. Reynolds, Using category theory to design implicit conversions and generic operators, in: N.D. Jones, ed., Semantics-Directed Compiler Generation, Proc. Workshop, Aarhus, Denmark Lecture Notes in Computer Science, Vol. 94 (Springer, New York, 1980) 211-258.
18. D. Sannella and A. Tarlecki, On observational equivalence and algebraic specification, J. Comput. and System Sci. 34 (1987) 150-178.
19. O. Schoett, Behavioural correctness of data representations, Sci. Comput. Programming 14 (1990) 43-57.
20. K. Sieber, Reasoning about sequential functions via logical relations, in: M.P. Fourman, P.T. Johnstone, and A.M. Pitts, eds., Applications of Categories in Computer Science, Proc. LMS Symp., Durham, 1991 London Mathematical Society Lecture Note Series, Vol. 177 (Cambridge University Press, Cambridge, 1992) 258-269.
21. R. Statman, Logical Relations and the typed λ.-calculus, Inform, and Control 65 (1985) 85-97.
22. P. Wadler and S. Blott, How to make ad-hoc polymorphism less ad hoc, in: Conf. Record of the 16th Annual ACM Symp. on Principles of Programming Languages, Austin, Texas (ACM, New York, 1989) 60-76.
23. M. Wand, Final algebra semantics and data type extensions, J. Comput. System Sci. 19 (1979) 27-44.
24. M. Wirsing, Algebraic specification, in: J. van Leewen, ed., Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics (MIT Press, Cambridge, MA 1990) 675-788.
25. M. Wirsing, P. Pepper, H. Partsch, W. Dosch and M. Broy, On hierarchies of abstract data types, Acta Inform. 20 (1983) 1-33.