Operations on records

Mathematical Structures in Computer Science

Volumn 1, Issue 1, 1991, Pages 3-48

  Cardelli, Luca ^a   Mitchell, John C ^b  

^a HEWLETT PACKARD COMPANY   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84976189160     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129500000049     Document Type: Article

References (26)

1. Breazu-Tannen, V., Coquand, T., Gunter, C. and Scedrov, A. (1989) Inheritance and explicit coercion. Proc. Fourth IEEE Symp. on Logic in Computer Science, pp. 112–129.
2. Bruce, K. B. and Longo, G. (1988) A modest model of records, inheritance and bounded quantification. Proc. Third IEEE Symp. on Logic in Computer Science, pp. 38–50.
3. Bruce, K. B., Meyer, A. R. and Mitchell, J. C. (1990) The semantics of second order lambda calculus. Informat. Computat. Vol. 85, No. 1, pp. 76–134.
4. Cardelli, L. (1988) A semantics of multiple inheritance. In Information and Computation 76 138–164.
5. (First appeared in Semantics of Data Types, eds G. Kahn, D. B. MacQueen and G. Plotkin. Springer Lecture Notes in Computer Science 173, Springer-Verlag, 1984.)
6. Cardelli, L., Donahue, J., Glassman, L., Jordan, M., Kalsow, B. and Nelson, G. (1989) Modula-3 report (revised). Research Report no. 52, DEC Systems Research Center.
7. Cardelli, L. and Wegner, P. (1985) On understanding types, data abstraction and polymorphism. Comput. Surv. 17(4) 471–522.
8. Curien, P.-L. and Ghelli, G. (1991) Coherence of subsumption. Math. Struct. Comp. Sci., to appear.
9. Dahl, O. and Nygaard, K. (1966) Simula, an Algol-based simulation language. Commun. ACM 9 671–678.
10. Girard, J.-Y. (1971) Une extension de l'interpretation de Gödel à l'analyse, et son application à l'éimination des coupures dans l'analyse et la theoric des types. Proc. Second Scandinavian Logic Symposium, ed. J. E. Fenstad. North-Holland, pp. 63–92.
11. Jategaonkar, L. A. and Mitchell, J. C. (1988) ML with extended pattern matching and subtypes. Proc. ACM Conf. on Lisp and Functional Programming, pp. 198–211.
12. Longo, G. and Moggi, E. (1988) Constructive natural deduction and its ‘w-set’ interpretation. Report CMU-CS-88-131, CMU, Dept, of Computer Science, Math. Struct. Comput. Sci. 1 (2) to appear.
13. Meyer, B. (1988) Object-oriented Software Construction. Prentice-Hall.
14. Milner, R. (1978) A theory of type polymorphism in programming. J. Comput. Sys. Sci. 17 348–375.
15. Mitchell, J. C. (1984) Coercion and type inference. Proc. 11th ACM Symp. on Principles of Programming Languages, pp. 175–185.
16. Mitchell, J. C. (1986) A type inference approach to reduction properties and semantics of polymorphic expressions. Proc. Symp. on Lisp and Functional Programming, pp. 308–319.
17. (Revised version in Logic Foundations of Functional Programming, ed. G. Huet, Addison-Wesley, 1989, pp. 195-212.)
18. Mitchell J.C. (1990) Type systems for programming languages. In: Handbook of Theoretical Computer Science, Volume B, eds J. van Leeuwen et al., North-Holland, pp. 365–458.
19. Ohori, A., Buneman, P. and Breazu-Tannen, V. (1988) database programming in Machiavelli - a polymorphic language with static type inference. Report MS-CIS-88-103, University of Pennsylvania, Computer and Information Science Department.
20. Ohori, A. and Buneman, P. (1988) Type inference in a Database programming language. Proc. ACM Conf. on LISP and Functional Programming. pp. 174–183.
21. Rémy, D. (1989) Typechecking records and variants in a natural extension of ML. Proc. 16th ACM Symp. on Principles of Programming Languages, pp. 77–88.
22. Reynolds, J. C. (1974) Towards a theory of type structure. In: Colloquium sur la Programmation. Springer Lecture Notes in Computer Science 19, pp. 408–423.
23. Schaffert, C., Cooper, T., Bullis, B., Kilian, M. and Wilpolt, C. (1986) An introduction to Trellis/Owl. Proc. ACM Conf. Object-Oriented Programming Systems, Languages and Applications, pp. 9–16.
24. Stroustrup, B. (1986) The C+ + Programming Language. Addison-Wesley.
25. Wand, M. (1987) Complete type inference for simple objects. Proc. Second IEEE Symp. on Logic in Computer Science, pp. 37–44.
26. Wand, M. (1989) Type inference for record concatenation and multiple inheritance. Proc. Fourth IEEE Symp. on Logic in Computer Science, pp. 92–97.