Inclusions and subtypes I: First-order case

Journal of Logic and Computation

Volumn 6, Issue 3, 1996, Pages 409-438

  Martí Oliet, Narciso ^a   Meseguer, José ^a  

^a NONE

Author keywords

Categorical logic; Coercion; Inclusion; Overloading; Subtype

Indexed keywords

EID: 0346200287     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/6.3.409     Document Type: Article

References (34)

1. J. Bénabou. Structures algébriques dans les catégories. Cahiers de Topologie et Géometrie Différentielle, 10, 1-126, 1968.
2. L. Cardelli. A semantics of multiple inheritance. Information and Computation, 76, 138-164, 1988.
3. L. Cardelli and G. Longo. A semantic basis for Quest. Journal of Functional Programming, 1, 417-458, 1991.
4. L. Cardelli and P. Wegner. On understanding types, data abstraction and polymorphism. Computing Surveys, 17, 471-522, 1985.
5. R. L. Croie. Categories for Types. Cambridge University Press, Cambridge, 1993.
6. P.-L. Curien and G. Ghelli. Coherence of subsumption, minimum typing, and type-checking in F≤. Mathematical Structures in Computer Science, 2, 55-91, 1992.
7. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics. Springer-Verlag, Berlin, 1985.
8. K. Futatsugi, J. Goguen, J.-P. Jouannaud and J. Meseguer. Principles of OBJ2. In Conference Record of the 12th Annual ACM Symposium on Principles of Programming Languages, pp. 52-66, New Orleans, LA, 1985.
9. M. Gogolla. Partially ordered sorts in algebraic specifications. In Proceedings of the 9th CAAP, B. Courcelle, ed., pp. 139-153, Cambridge University Press, Cambridge, 1984.
10. J. A. Goguen. Order sorted algebra. Technical Report 14, UCLA Computer Science Department, Semantics and Theory of Computation Series, 1978.
11. J. Goguen, J.-P. Jouannaud and J. Meseguer. Operational semantics of order-sorted algebra. In Proceedings of ICALP'85, W. Brauer, ed., pp. 221-231, LNCS 194, Springer Verlag, 1985.
12. J. Goguen, C. Kirchner, H. Kirchner, A. Mégrelis, J. Meseguer and T. Winkler. An introduction to OBJ3. In Conditional Term Rewriting Systems, S. Kaplan and J.-P. Jouannaud, eds, pp. 258-263, LNCS 308, Springer-Verlag, Berlin, 1988.
13. J. A. Goguen and J. Meseguer. Eqlog: Equality, types, and generic modules for logic programming. In Logic Programming: Functions, Relations, and Equations, D. DeGroot and G. Lindstrom, eds, pp. 295-363, Prentice Hall, Englewood Cliffs, NJ, 1986.
14. J. A. Goguen and J. Meseguer. Unifying functional, object-oriented and relational programming with logical semantics. In Research Directions in Object-Oriented Programming, B. Shriver and P. Wegner, eds, pp. 417-477, The MIT Press, Cambridge, MA, 1987.
15. J. A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions, and partial operations. Theoretical Computer Science, 105, 217-273, 1992.
16. J. A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi and J.-P. Jouannaud. Introducing OBJ. Technical Report SRI-CSL-92-03, Computer Science Laboratory, SRI International, March 1992. To appear in Applications of Algebraic Specification Using OBJ, J. A. Goguen, ed., Cambridge University Press, Cambridge, 1995.
17. J. A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi and J.-P. Jouannaud. Introducing OBJ. Technical Report SRI-CSL-92-03, Computer Science Laboratory, SRI International, March 1992. To appear in Applications of Algebraic Specification Using OBJ, J. A. Goguen, ed., Cambridge University Press, Cambridge, 1995.
18. J. A. Goguen and D. Wolfram. On types and FOOPS. In Proceedings of the IFIP TC2 Working Conference on Database Semantics: Object Orientated Databases, Windermere, UK, 1990.
19. C. Kirchner, H. Kirchner and J. Meseguer. Operational semantics of OBJ-3. In Proceedings of ICALP'88, T. Lepistö and A. Salomaa, eds, pp. 287-301, LNCS 317, Springer-Verlag, Berlin, 1988.
20. F. W. Lawvere. Functorial semantics of algebraic theories. Proceedings National Academy of Sciences, 50, 869-873, 1963.
21. S. Mac Lane. Categories for the Working Mathematician, Springer-Verlag, 1971.
22. N. Marti-Oliet and J. Meseguer. Inclusions and subtypes II: Higher-order case. Journal of Logic and Computation, 6, 1996. In press.
23. J. Meseguer. A logical theory of concurrent objects and its realization in the Maude language. In Research Directions in Object-Based Concurrency, G. Agha, P. Wegner and A. Yonezawa, eds, pp. 314-390, The MIT Press, Cambridge, MA, 1993.
24. J. Meseguer and J. A. Goguen. Initiality, induction, and computability. In Algebraic Methods in Semantics, M. Nivat and J. C. Reynolds, eds, pp. 459-541, Cambridge University Press, Cambridge, 1985.
25. J. Meseguer and J. A. Goguen. Order-sorted algebra solves the constructor-selector, multiple representation and coercion problems. Information and Computation, 104, 114-158, 1993.
26. R. Milner, M. Tofte and R. Harper. The Definition of Standard ML, The MIT Press, Cambridge, MA, 1990.
27. J. C. Mitchell, Coercion and type inference. In Conference Record of the 11th Annual ACM Symposium on Principles of Programming Languages, pp. 175-185, Salt Lake City, Utah, 1984.
28. A. Pitts. Lectures on categories and types. Lecture Notes far the Summer School on Constructive Logic and Category Theory, Isle of Thorns, UK, 1988.
29. A. Poigné. Parametrization for order-sorted algebraic specification. Journal of Computer and System Sciences, 40, 229-268, 1990.
30. Z. Qian, Higher-order order-sorted algebras. In Algebraic and Logic Programming, H. Kirchner and W. Wechler, eds, pp. 86-100, LNCS 463, Springer-Verlag, Berlin, 1990.
31. J. C. Reynolds. Using category theory to design implicit conversions and generic operators. In Semantics-Directed Compiler Generation, N. D. Jones, ed., pp. 211-258, LNCS 94, Springer-Verlag, Berlin, 1980.
32. J. C. Reynolds. Three approaches to type structure. In Mathematical Foundations of Software Development, H. Ehrig, C. Floyd, M. Nivat and J. Thatcher, eds, pp. 97-138, LNCS 185, Springer-Verlag, Berlin, 1985.
33. G. Smolka, TEL (Version 0.9) report and user manual. SEKI Report SR-87-11, FB Informatik, Universität Kaiserslautern, Germany, 1988.
34. J. D. Ullman. Elements of ML Programming, Prentice Hall, Englewood Cliffs, NJ, 1994.