论文信息 - Safe run-time overloading

Safe run-time overloading

We present a functional language featuring a form of dynamic overloading akin to message passing in object oriented languages. We give a dynamic semantics describing a non-deterministic evaluation, as well as a type discipline (static semantics) supporting type inference. The type system ensures that a well-typed program has a correct execution, unique up to a semantic equivalence relation, and allows this execution to proceed deterministically, while resolving overloading at run-time.

François Rouaix | F. Rouaix

[1] Didier Rémy,et al. Type checking records and variants in a natural extension of ML , 1989, POPL '89.

[2] Robin Milner,et al. Principal type-schemes for functional programs , 1982, POPL '82.

[3] Dominique Clément,et al. A simple applicative language: mini-ML , 1986, LFP '86.

[4] Ralph E. Johnson,et al. Type-checking Smalltalk , 1986, OOPLSA '86.

[5] Norihisa Suzuki,et al. Inferring types in Smalltalk , 1981, POPL '81.

[6] Philip Wadler,et al. How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.

[7] William R. Cook,et al. Inheritance is not subtyping , 1989, POPL '90.

[8] Stefan Kaes,et al. Parametric Overloading in Polymorphic Programming Languages , 1988, ESOP.

[9] Robin Milner,et al. A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[10] Craig Schaffert,et al. CLU Reference Manual , 1984, Lecture Notes in Computer Science.

[11] Bertrand Meyer,et al. EIFFEL: Object-Oriented Design for Software Engineering , 1987, ESEC.

[12] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[13] M. Tofte. Operational Semantics and Polymorphic Type Inference , 1988 .

[14] Rajendra K. Raj,et al. A Compositional Model for Software Reuse , 1989, Computer/law journal.

[15] Craig Schaffert,et al. An introduction to Trellis/Owl , 1986, OOPLSA '86.

[16] Alan Borning,et al. A type declaration and inference system for smalltalk , 1982, POPL '82.