Article

Free access

Type-checking Smalltalk

Author:

Ralph E. JohnsonAuthors Info & Claims

OOPSLA '86: Conference proceedings on Object-oriented programming systems, languages and applications

Pages 315 - 321

https://doi.org/10.1145/28697.28728

Published: 01 June 1986 Publication History

PDF eReader

Abstract

Although most attempts to speed-up Smalltalk have focused on providing more efficient interpreters, code optimization is probably necessary for further increases in speed. A type-system for Smalltalk is a prerequisite for building an optimizing compiler. Unfortunately, none of the type-systems so far proposed for Smalltalk are adequate; they either cause nearly all Smalltalk programs to be type incorrect, allow run-time type errors, or do not provide enough information for optimization. This paper presents a type-system for Smalltalk that is suitable for code optimization.

References

[1]

S. Baden. High Per/ormance Storage Reclamation in an Object.Based Memory System. Master's thesis, Computer Science Division, Department of E.E.C.S, University of California, Berkeley, Berkeley, CA, June 1982.

Google Scholar

[2]

Andrew Black, Norman Hutchinson, Eric Jul, and Henry Levy. Distribution and Abstract T~pes in Emerald. Technical Report 85-08-05, Department of Computer Science, University of Washington, Seattle, WA 98195, August 1985.

Google Scholar

[3]

Hans-J. Boehm. Partial polymorphic type inference is undecidable. In ~6'th Annual Symposium on Foundation, of Computer Science, pages 339- 345, 1985.

Google Scholar

[4]

A. H. Borning and D. H. H. Ingalls. A type declaration and inference system for Smalltalk. In Con/events Record of the Ninth Annual A CM Svmposium on Principles o/Programming Languages, pages 133-139, 1982.

Crossref

Google Scholar

[5]

Luca Cardelli. Amber. Unpublished manuscript.

Google Scholar

[6]

Luca Cardelli. A semantics of multiple inheritance. In Semantics of Data Types, Lecture Notes in Computer Science, n. 175, pubes 51 -67, Springer-Verlag, 1984.

Digital Library

Google Scholar

[7]

L. Peter Deutech and Allan M. Schiffman. Efficient implementation of the Smalltalk-80 system. In Conference Record of the Tenth Annual A CM Symposium on Principles o~ Programming Languages, pages 297- 302, 1983.

Digital Library

Google Scholar

[8]

David Kranz, Richard Kekey, Jonathan Rues, Paul Hudak, James Philbin, and Norman Adams. ORBIT: An Optimizing Compiler ~or Scheme. Technical Report YALEU/DCS/RR-45, Department of Computer Science, Yale University, Box 2158 Yale Station, New Haven, CT 06520, December 1985.

Google Scholar

[9]

D. B. MacQueen and Ravi Sethi. A semantic model of types for applicative languages. In ACM Sltmpo~ium o/LISP and Functional Programming, pages 243- 252, 1982.

Crossref

Google Scholar

[10]

Craig Schaffert, Topher Cooper, and Carrie Wilpolt. Trellis Object-Based Environment: Language Re/erenee Manual. Technical Report 372, Eastern Research Lab, Digital Equipment Corporation, November 85.

Google Scholar

[11]

Norihiss Suzuki. Inferring types in Smalltalk. In Con~etCheS Record of the Eighth Annual A CM Symposium on Principles of Programming Languages, pages 187-199, 1981.

Digital Library

Google Scholar

[12]

Norihisa Suzuki and Minoru Terada. Creating efficient systems for object-oriented languages. In Con- /erence Record o/ the Tenth Annual A CM Symposium on Principles of Programming Languages, pages 290- 296, 1983.

Crossref

Google Scholar

[13]

David Ungar. Generation scavenging: a nondisruptive high performance storage reclamation algorithm. In Proeecdinos of the ACM SIGSOFT/SIGPLAN So/twarc Engineering Symposium on Practical Soft. ware Development Environments, pages 157-167, 1985.

Crossref

Google Scholar

Cited By

View all

Haldiman NDenker MNierstrasz ODemeyer SPerrot J(2007)Practical, pluggable typesProceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 200710.1145/1352678.1352690(183-204)Online publication date: 25-Aug-2007
https://dl.acm.org/doi/10.1145/1352678.1352690
Cook W(2005)Object-oriented programming versus abstract data typesFoundations of Object-Oriented Languages10.1007/BFb0019443(151-178)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0019443
Agesen O(2005)Constraint-based type inference and parametric polymorphismStatic Analysis10.1007/3-540-58485-4_34(78-100)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-58485-4_34
Show More Cited By

Recommendations

Type checking and type inference for object-oriented programming languages
Type-checking Smalltalk
Proceedings of the 1986 conference on Object-oriented programming systems, languages, and applications

Although most attempts to speed-up Smalltalk have focused on providing more efficient interpreters, code optimization is probably necessary for further increases in speed. A type-system for Smalltalk is a prerequisite for building an optimizing ...
A type declaration and inference system for smalltalk
POPL '82: Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

An experimental system for declaring and inferring type in Smalltalk is described. (In the current Smalltalk language, the programmer supplies no type declarations.) The system provides the benefits of type declaration in regard to compile-time checking ...

Comments

Information & Contributors

Information

Published In

OOPSLA '86: Conference proceedings on Object-oriented programming systems, languages and applications

June 1986

508 pages

ISBN:0897912047

DOI:10.1145/28697

Editor:
Norman Meyrowitz

ACM SIGPLAN Notices Volume 21, Issue 11
Proceedings of the 1986 conference on Object-oriented programming systems, languages, and applications
Nov. 1986
495 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/960112
Issue’s Table of Contents

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1986

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 268 of 1,244 submissions, 22%

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

43
Total Citations
View Citations
635
Total Downloads

Downloads (Last 12 months)108
Downloads (Last 6 weeks)11

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Haldiman NDenker MNierstrasz ODemeyer SPerrot J(2007)Practical, pluggable typesProceedings of the 2007 international conference on Dynamic languages: in conjunction with the 15th International Smalltalk Joint Conference 200710.1145/1352678.1352690(183-204)Online publication date: 25-Aug-2007
https://dl.acm.org/doi/10.1145/1352678.1352690
Cook W(2005)Object-oriented programming versus abstract data typesFoundations of Object-Oriented Languages10.1007/BFb0019443(151-178)Online publication date: 9-Jun-2005
https://doi.org/10.1007/BFb0019443
Agesen O(2005)Constraint-based type inference and parametric polymorphismStatic Analysis10.1007/3-540-58485-4_34(78-100)Online publication date: 8-Jun-2005
https://doi.org/10.1007/3-540-58485-4_34
Vitek JHorspool RUhl J(2005)Compile-time analysis of object-oriented programsCompiler Construction10.1007/3-540-55984-1_22(236-250)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-55984-1_22
Chambers CUngar D(2004)A retrospective onACM SIGPLAN Notices10.1145/989393.98942539:4(295-312)Online publication date: 1-Apr-2004
https://dl.acm.org/doi/10.1145/989393.989425
Royer J(2002)An Operational Approach to the Semantics of ClassesProgramming and Computing Software10.1023/A:101563212999528:3(127-147)Online publication date: 1-May-2002
https://dl.acm.org/doi/10.1023/A%3A1015632129995
Agesen O(2000)The Cartesian Product AlgorithmObject-Oriented Programming10.1007/3-540-49538-X_2(2-26)Online publication date: 25-Aug-2000
https://doi.org/10.1007/3-540-49538-X_2
Chambers CChen W(1999)Efficient multiple and predicated dispatchingACM SIGPLAN Notices10.1145/320385.32040734:10(238-255)Online publication date: 1-Oct-1999
https://dl.acm.org/doi/10.1145/320385.320407
Chambers CChen WHailpern BNorthrop L(1999)Efficient multiple and predicated dispatchingProceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/320384.320407(238-255)Online publication date: 1-Oct-1999
https://dl.acm.org/doi/10.1145/320384.320407
Taivalsaari A(1996)On the notion of inheritanceACM Computing Surveys10.1145/243439.24344128:3(438-479)Online publication date: 1-Sep-1996
https://dl.acm.org/doi/10.1145/243439.243441
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

Cited By

Index Terms

Recommendations

Type checking and type inference for object-oriented programming languages

Type-checking Smalltalk

A type declaration and inference system for smalltalk