A semantics for λ&-early: A calculus with overloading and early binding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 664 LNCS, Issue , 1993, Pages 107-123

  Castagna, Giuseppe ^a   Ghelli, Giorgio ^b   Longo, Giuseppe ^c  

^a UNIVERSITY OF GENOA   (Italy)

^b Dipastimento d’Informatica ^*  (Italy)

^c ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; DIFFERENTIATION (CALCULUS); FUNCTIONAL PROGRAMMING; PATHOLOGY; SEMANTICS; SYNTACTICS;

ELEMENTARY APPROACH; FUNCTIONAL LANGUAGES; KEY FEATURE; LAMBDA CALCULUS; OBJECTORIENTED PROGRAMMING (OOP); PROGRAMMING STYLES; RELEVANT FEATURES; SYNTACTIC PROPERTIES;

OBJECT ORIENTED PROGRAMMING;

EID: 85028755981     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0037101     Document Type: Conference Paper

References (32)

1. [ACC93] M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. In Ann. ACM Symp. on Principles of Programming Languages. ACM, ACM-press, 1993. Extended abstract.
2. [AKP91] H Aït-Kaci and A. Podelski. Towards a meaning of LIFE. Technical Report 11, Digital, Paris Research Laboratory, June 1991.
3. [AL91] A. Asperti and G. Longo. Categories, Types and Structures: An Introduction to Category Theory for the Working Computer Scientist. MIT-Press, 1991.
4. [Ama90] R. Amadio. Domains in a realizability framework. Technical Report 19, Laboratoire d’Informatique, Ecule Normale Supérienre - Paris, 1990.
5. [BL90] K.B. Bruce and G. Longo. A modest model of records, inheritance and bounded quantification. Information and Computation, 87(1/2):196-240, 1990. A preliminary version can be found in 8rd Ann. Symp. on Logic in Computer Science, 1988.
6. [Bru91] K.B. Bruce. The equivalence of two semantic definitions of inheritance in object-oriented languages. In Proceedings of the 6th International Conference on Mathematical Foundation of Programming Semantics, 1991. to appear.
7. [Car88] Luca Cardelli. A semantics of multiple inheritance. Information and Computation, 78:136-164, 1988. A first version can be found in Semantics of Data Types, LNCS 173, 51-67, Springer-Verlag, 1984.
8. +89] P.S. Canning, W.R. Cook, W.L. Hill, J. Mitchell, and W.G. Orthoff. F-bounded quantification for object-orlented programming. In ACM Conference on Functional Programming and Computer Architecture, September 1989.
9. [CGL92a] G. Castagna, G. Ghelli, and G. Longo. A calculus for overloaded functions with subtyping. In ACM Conference on LISP and Functional Programming, pages 182-192, San Francisco, July 1992. ACM Press. Extended abstract.
10. [CGL92b] G. Castagna, G. Ghelli, and G. Longo. A calculus for overloaded functions with subtyping. Technical Report 92-4, Laboratoire d’Informatique, Ecole Normale Supérieare - Paris, February 1992.
11. [CHC90] W.R. Cook, W.L. Hill, and P.S. Canning. Inheritance is not subtyping. 17th Ann. ACM Symp. on Principles of Programming Languages, January 1990.
12. [CL91] L. Cardelli and G. Longo. A semantic basis for Quest. Journal of Functional Programming, 1(4):417-458, 1991.
13. [CMMS91] L. Cardelli, S. Martini, J.C. Mitchell, and A. Scedrov. An extension of system F with subtyping. In T. Ito and A.R. Meyer, editors, Theoretical Aspects of Computer Software, pages 750-771. Springer-Veriag, September 1991. LNCS 526 (preliminary version). To appear in Information and Computation.
14. [CW85] L. Curdelli and P. Weaner. On understanding types, data abstraction and polymorphism. Computing Surveys, 17(4):471-522, December 1985.
15. [Ghe91a] G. Ghelli. Modelling features of object-oriented languages in second order functional languages with subtypes. In J.W. de Bakker, W.P. de Roever, and G. Rozenberg, editors, Foundations of Object-Oriented Languages, number 489 in LNCS, pages 311-340, Berlin, 1991. Springer-Verlag.
16. [Ghe91b] G. Ghelli. A static type system for message passing. In Proc. of OOPSLA '91, 1991.
17. [Gir72] J-Y. Girard. Interprétation foactionelle et élimination des eoupures duns l’arithmetique d’ordre supérlenr. Thèse de doctorat d’état, 1972. Université Paris VII.
18. [GM85] Joseph Goguen and José Meseguer. EQLOG: equality, types and generic modules for logic programming. In deGroot and Lindstrom, editors, Functional and Logic Programmlng. Prentice-Hall, 1985.
19. [GM89] J.A. Goguen and J. Meseguer. Order-sorted algebra I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations. Technical Report SRI-CSL-89- 10, Computer Science Laboratory, SPA International, July 1989.
20. [Kee89] S.K. Keene. Object-Oriented Programming in COMMON LISP: A Programming Guide to CLOS. Addison-Wesley, 1989.
21. [LM91] G. Longo and E. Moggi. Constructive natural deduction and its ω-set interpretation. Mathematical Structures in Computer Science, 1(2):215-253, 1991.
22. [LMS92] G Longo, K. Milsted, and S. Soloviev. The genericity theorem and purametrieity in functional langunges. Technical report, Digital, Paris Reserch Lab., 1992.
23. [Mey88] Bertrand Meyer. Object-Orientedgoflularo Construction. Prentice-HallInternationalSeries, 1988.
24. [NeX91] NeXT Computer Inc. NeXTstep-cocecpts. Chapter 3: Object-Oriented Programming and Objective-C, 2.0 edition, 1991.
25. [Pie92] B.C. Pierce. Type-theoretic foundations for object-oriented programming. Technical report, LFCS, Departement of Computer Science, University of Edinburgh, May 1992. Lecture note for a short course.
26. [PT93] B.C. Pierce and D.N. Turner. Object-oriented programming without recursive types. In 10Oth Ann. ACM Symp. on Principles of Programming Languages. ACM-Press, 1993.
27. [Rém89] D. Rémy. Typechecking records and variants in a natural extension of ML. In Ann. ACM Symp. on Principles of Programming Languages, 1989.
28. [Rey84] J.C. Reynolds. Polymorphism is not set-theoretic. LNCS 173, 1984.
29. [Sco76] D. Scott. Data-types as lattices. S. L A. M. J. Comp., 5:522-587, 1976.
30. [wan87] Mitchell Wand. Complete type inference for simple objects. In 2nd Ann. Symp. on Logic in Computer Science, 1987.
31. [Wan89] Mitchell Wand. Type inference for record concatenation and multiple inheritance. In 4th Ann. Symp. on Logic in Computer Science, 1989.
32. [WB89] Philip Wadler and Stephen Blurt. How to make “ad-hoe” polymorphism less “ad-hoe”. In 16th Ann. ACM Symp. on Principles of Programming Languages, pages 60-76, 1989.