More Web Proxy on the site http://driver.im/

Article

Free access

Safe run-time overloading

Author:

Francois RouaixAuthors Info & Claims

POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Pages 355 - 366

https://doi.org/10.1145/96709.96746

Published: 01 December 1989 Publication History

Abstract

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.

References

[1]

A.H. Borning, D.H.H ingalls: "A type declaration and inference system for SmaUTalk", Proc. of ~he A CM Conf. on Principles of Programming Languages 1982.

Digital Library

[2]

L. CaxdeUi, P. Wegner: "On Understanding Types, Data Abstraction, and Polymorphism", A CM Computing Surveys, Vol.17, No.4, pp.471-522, December 1986.

Digital Library

[3]

D. Clement, J. Despeyroux, T. Despeyroux, G. Kahn: "A Simple Applicative Language: Mini-ML", Proc. of the A CM Syrup. on Lisp and Functional Programming 1986,13-27.

Digital Library

[4]

W. Cook, W. Hill, P. Canning: "Inheritance is not Subtyping" to appear in Proc. of the A CM Conf. on Principles of Programming Languages 1990.

Digital Library

[5]

L. Damas, R. Milner: "Principal typeschemes for functional programs", Proc. of the A CM Conf. on Principle8 of Programming Languages 1985

Digital Library

[6]

L.G. DeMichid, R.P. Gabriel: "CLOS Overview", Proceedings of ECOOP 87.

[7]

P. Hudak, P. Wadler et al.: "Report on the Functional Programming Language ttaskeU, Draft proposed standard", Research report, Yale University, Dec. 88.

[8]

G. Huet: "R~solution d'~quations dans les langages d'ordre 1, 2,., w", Th~se de doctorat d'~tat, Universit~ Paris 7, 1976.

[9]

R.E. Johnson: "Type-Checking SmallTalk" in OOPSLA '86 Proceedhag A CM SIGPLAN Vol 21., No. 11, pp.315-321, November 86.

Digital Library

[10]

S. Kaes: " Parametric Overloading in Polymorphic Programming Languages", Proc. of the ~nd European S#mp. on Programming 88 LNCS 300,Springer-Verlag.

Digital Library

[11]

B. Lang "The Virtual Tree Processor" Esprit Project GIPE, Third review report,September 1986.

[12]

B.H. Liskov: "Clu Reference Manuar', Lecture Notes in Computer Science 114,Springer-Verlag 1981.

Digital Library

[13]

B. Meyer, J-M. Nerson, M. Matsuo: "Eiffel: Object-oriented design for software engineering", Proc. of the ist European Software Engineering Conference Sept.87, AFCET.

Digital Library

[14]

R. Milner: "A Theory of Type Polymorphism in Programming", J. Cornput. Syst. Sci 17 (1978), pp.348-375.

[15]

C. Pii Lunau: "Separation of Hierarchies in Duo-Talk", Journal of Object- Oriented Programming Julia ug 1989.

[16]

R.K. Raj, H.M. Levy : "A Compositional Model for Software Reuse", Conf. Proceedings of BCOOP '89.

[17]

D. R~my: "Typechecking records and variants in a natural extension of ML", Proc. of the A CM Syrup. on Principles of Programming Languages I989

Digital Library

[18]

C. Sehaffert, T. Cooper et al. : "An Introduction to Trellis/Owl", Conf. Proceedings of OOPSLA '86

Digital Library

[19]

N. Suzuki: "Inferring Types in SmallTalk", Proe. o} the A CM Syrup. on Principles of Programming Languages 1981.

Digital Library

[20]

M. Torte: "Operntional Semantics and Polymorphic Type Inference", Ph.D. Thesis University of Edinburgh, 1987.

[21]

P. Wader, S. Blott: "How to make adhoe polymorpkism less ad-hoc", Proc. o.f the A CM Syrup. on Principles of Programming Languages 1989

Digital Library

Cited By

Marmaduke AJenkins CStump A(2020)Zero-Cost Constructor SubtypingProceedings of the 32nd Symposium on Implementation and Application of Functional Languages10.1145/3462172.3462194(93-103)Online publication date: 2-Sep-2020
https://dl.acm.org/doi/10.1145/3462172.3462194
van Noort TAchten PPlasmeijer ROliveira BZalewski M(2010)Ad-hoc polymorphism and dynamic typing in a statically typed functional languageProceedings of the 6th ACM SIGPLAN workshop on Generic programming10.1145/1863495.1863505(73-84)Online publication date: 26-Sep-2010
https://dl.acm.org/doi/10.1145/1863495.1863505
Leroy XMauny M(2005)Dynamics in MLFunctional Programming Languages and Computer Architecture10.1007/3540543961_20(406-426)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_20
Show More Cited By

Index Terms

Safe run-time overloading
1. Software and its engineering
  1. Software notations and tools
    1. Formal language definitions
      1. Semantics
    2. General programming languages
      1. Language types
        Functional languages
2. Theory of computation
  1. Formal languages and automata theory
  2. Semantics and reasoning
    1. Program constructs
      1. Type structures
    2. Program semantics

Recommendations

Type-safe run-time polytypic programming

Polytypic programming is a way of defining type-indexed operations, such as map, fold and zip, based on type information. Run-time polytypic programming allows that type information to be dynamically computed – this support is essential in modern ...
Polymorphic type inference for languages with overloading and subtyping
A type system for overloading and parametric polymorphism in programming languages

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

POPL '90: Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

December 1989

401 pages

ISBN:0897913434

DOI:10.1145/96709

Chairman:
Frances E. Allen

Copyright © 1989 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1989

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 860 of 4,328 submissions, 20%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

16
Total Citations
View Citations
298
Total Downloads

Downloads (Last 12 months)68
Downloads (Last 6 weeks)3

Reflects downloads up to 01 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Marmaduke AJenkins CStump A(2020)Zero-Cost Constructor SubtypingProceedings of the 32nd Symposium on Implementation and Application of Functional Languages10.1145/3462172.3462194(93-103)Online publication date: 2-Sep-2020
https://dl.acm.org/doi/10.1145/3462172.3462194
van Noort TAchten PPlasmeijer ROliveira BZalewski M(2010)Ad-hoc polymorphism and dynamic typing in a statically typed functional languageProceedings of the 6th ACM SIGPLAN workshop on Generic programming10.1145/1863495.1863505(73-84)Online publication date: 26-Sep-2010
https://dl.acm.org/doi/10.1145/1863495.1863505
Leroy XMauny M(2005)Dynamics in MLFunctional Programming Languages and Computer Architecture10.1007/3540543961_20(406-426)Online publication date: 6-Jul-2005
https://doi.org/10.1007/3540543961_20
Larchevêque J(2005)Interprocedural type propagation for object-oriented languagesESOP '9210.1007/3-540-55253-7_19(321-340)Online publication date: 30-May-2005
https://doi.org/10.1007/3-540-55253-7_19
Duggan DCormack GOphel J(1996)Kinded type inference for parameteric overloadingActa Informatica10.1007/s00236005003533:1(21-68)Online publication date: 1-Feb-1996
https://dl.acm.org/doi/10.1007/s002360050035
Odersky MWadler PWehr MWilliams J(1995)A second look at overloadingProceedings of the seventh international conference on Functional programming languages and computer architecture10.1145/224164.224195(135-146)Online publication date: 1-Oct-1995
https://dl.acm.org/doi/10.1145/224164.224195
Dubois CRouaix FWeis PCytron RLee P(1995)Extensional polymorphismProceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages10.1145/199448.199473(118-129)Online publication date: 25-Jan-1995
https://dl.acm.org/doi/10.1145/199448.199473
Chambers CLeavens G(1994)Typechecking and modules for multi-methodsACM SIGPLAN Notices10.1145/191081.19108329:10(1-15)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/191081.191083
Chambers CLeavens GMcKenna JMoss J(1994)Typechecking and modules for multi-methodsProceedings of the ninth annual conference on Object-oriented programming systems, language, and applications10.1145/191080.191083(1-15)Online publication date: 1-Oct-1994
https://dl.acm.org/doi/10.1145/191080.191083
Kaes S(1992)Type inference in the presence of overloading, subtyping and recursive typesACM SIGPLAN Lisp Pointers10.1145/141478.141540V:1(193-204)Online publication date: 1-Jan-1992
https://dl.acm.org/doi/10.1145/141478.141540
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten