article

Free access

Soft typing

Authors:

Robert Cartwright,

Mike FaganAuthors Info & Claims

ACM SIGPLAN Notices, Volume 26, Issue 6

Pages 278 - 292

https://doi.org/10.1145/113446.113469

Published: 01 May 1991 Publication History

PDF eReader

References

[1]

Martin Abadi, Luca Cardelli, Benjamin Pierce, and Gordon Plotkin. Dynamic typing in a statically typed language. In Proceedings of the Sixteenth POPL Symposium, 1989.

Digital Library

Google Scholar

[2]

Alexander Aiken and Brian Murphy. Static type inference in a dynamically typed language. In Proceedings of the 18th Annual Symposium on Principles of Programming Languages, 1991. To appear.

Digital Library

Google Scholar

[3]

Andrew W. Appel and David MacQueen. Standard ML of New Jersey Reference Manual. (in preparation), 1990.

Google Scholar

[4]

Robert Cartwright. A constructive alternative to axiomatic data type definitions. In Proceedings of 1980 LISP Conference, 1980.

Digital Library

Google Scholar

[5]

William Clinger and Jonathan Rees. Reviseda'99 Report on the Algorithmic Language Scheme, August 1990.

Google Scholar

[6]

Alain Colmerauer. Prolog and infinite trees. In K. L. Clark and S. A. Tarnlund, editors, Logic Programming, pages 231-251. Academic Press, 1982.

Google Scholar

[7]

Pavel Curtis. Constrained quantification in polymorphic type analysis. Technical Report CSL-90- 1, Xerox PARC, 1990.

Google Scholar

[8]

Luis Damas and Robin Milner. Principal typeschemes for functional programs. In Conference Record of the Ninth Annual A CM Symposium on Principles of Programming Languages, 1982.

Digital Library

Google Scholar

[9]

Luis Manuel Martins Damas. Type Assignment in Programming Languages. PhD thesis, University of Edinburgh, 1985.

Google Scholar

[10]

Bruce F. Duba, Robert Harper, and David Mac- Queen. Typing first-class continuations in ML. In Conference Record of the Eighteenth Annual A CM Symposium on Principles of Programming Languages, 1991.

Digital Library

Google Scholar

[11]

Mike Fagan. Soft Typing: An Approach to Type Checking for Dynamically Typed Languages. PhD thesis, Rice University, 1990.

Digital Library

Google Scholar

[12]

You-Chin Fuh and Prateek Mishra. Type inference with subtypes. In Conference Record of the European Symposium on Programming, 1988.

Digital Library

Google Scholar

[13]

You-Chin Fuh and Prateek Mishra. Polymorphic subtype inference: Closing the theory-practice gap. In TAPSOFT, 1989.

Digital Library

Google Scholar

[14]

Carsten K. Gomard. Partial type inference for untyped functional programs, in Proceedings of the 1990 A UM Conference on LiSP and Functional Programming, 1990.

Digital Library

Google Scholar

[15]

Gdrard Huet. Rgsolution d'gquations dans les langages d'ordre 1,2,.,w. PhD thesis, Universitd Paris, 7 1976.

Google Scholar

[16]

D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. In Conference Record of the Elevenih Annual A CM Symposium on Principles of Programming Languages, 1983.

Digital Library

Google Scholar

[17]

D. B. MacQueen and Ravi Sethi. A semantic model of types for applicative languages. In Conference Record of the Tenth Annual A CM Symposium on Principles of Programming Languages, 1982.

Crossref

Google Scholar

[18]

Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 1978.

Crossref

Google Scholar

[19]

Robin Milner, Mads Torte, and Robert Harper. The Definition of Siandard ML. MIT Press, 1990.

Digital Library

Google Scholar

[20]

John C. Mitchell. Coercion and type inference. In Conference Record of the Eleventh Annual A CM Symposium on Principles of Programming Languages, 1983.

Digital Library

Google Scholar

[21]

Dider Rdmy. Typechecking records and variants in a natural extension of ml. In Conference Record of the Sixteenth Annual A CM Symposium on Principles of Programming Languages, 1989.

Digital Library

Google Scholar

[22]

David A Schmidt. Denotational Semantics. Allyn and Bacon,Inc, 1986.

Google Scholar

[23]

Sattish Thatte. Quasi-static typing. In Proceedings of the Seventeenth POPL Symposium, 1990.

Digital Library

Google Scholar

[24]

Mads Torte. Operational Semantics and Polymorphic Type Inference. PhD thesis, University of Edinburgh, 1987.

Google Scholar

[25]

Mitchell Wand. Complete type inference for simple objects. In Proceedings of the Second Symposium on Logic in Computer Science, 1987.

Google Scholar

Cited By

View all

Greenman BDimoulas CFelleisen M(2023)Typed–Untyped Interactions: A Comparative AnalysisACM Transactions on Programming Languages and Systems10.1145/357983345:1(1-54)Online publication date: 5-Mar-2023
https://dl.acm.org/doi/10.1145/3579833
Mooij A(2022)Static type checking without downcast operatorInformation Processing Letters10.1016/j.ipl.2022.106285(106285)Online publication date: May-2022
https://doi.org/10.1016/j.ipl.2022.106285
Kazerounian MFoster JMin B(2021)SimTyper: sound type inference for Ruby using type equality predictionProceedings of the ACM on Programming Languages10.1145/34854835:OOPSLA(1-27)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3485483
Show More Cited By

Index Terms

Soft typing
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
      1. Language features
        Procedures, functions and subroutines
      2. Language types
2. Theory of computation
  1. Semantics and reasoning
    1. Program constructs
      1. Type structures
    2. Program semantics

Recommendations

Gradual typing: a new perspective

We define a new, more semantic interpretation of gradual types and use it to ``gradualize'' two forms of polymorphism: subtyping polymorphism and implicit parametric polymorphism. In particular, we use the new interpretation to define three gradual type ...
Soft typing
20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999: A Selection

Type systems are designed to prevent the improper use of program operations. They can be classified as either static or dynamic depending on when they detect type errors. Static type systems detect potential type errors at compile-time and prevent ...
Practical soft typing

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 26, Issue 6

June 1991

352 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/113446

Editor:
Richard L. Wexelblat
IDA/CSED, Alexandria, VA

Issue’s Table of Contents

PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
May 1991
356 pages
ISBN:0897914287
DOI:10.1145/113445
Chairman:
David S. Wise
Indiana Univ., Bloomington

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 May 1991

Published in SIGPLAN Volume 26, Issue 6

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

211
Total Citations
View Citations
1,577
Total Downloads

Downloads (Last 12 months)256
Downloads (Last 6 weeks)48

Reflects downloads up to 13 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Greenman BDimoulas CFelleisen M(2023)Typed–Untyped Interactions: A Comparative AnalysisACM Transactions on Programming Languages and Systems10.1145/357983345:1(1-54)Online publication date: 5-Mar-2023
https://dl.acm.org/doi/10.1145/3579833
Mooij A(2022)Static type checking without downcast operatorInformation Processing Letters10.1016/j.ipl.2022.106285(106285)Online publication date: May-2022
https://doi.org/10.1016/j.ipl.2022.106285
Kazerounian MFoster JMin B(2021)SimTyper: sound type inference for Ruby using type equality predictionProceedings of the ACM on Programming Languages10.1145/34854835:OOPSLA(1-27)Online publication date: 15-Oct-2021
https://dl.acm.org/doi/10.1145/3485483
You SFindler RDimoulas C(2021)Sound and Complete Concolic Testing for Higher-order FunctionsProgramming Languages and Systems10.1007/978-3-030-72019-3_23(635-663)Online publication date: 23-Mar-2021
https://doi.org/10.1007/978-3-030-72019-3_23
Naus NThiemann P(2019)Dynamic Flow Analysis for JavaScriptTrends in Functional Programming10.1007/978-3-030-14805-8_5(75-93)Online publication date: 21-Feb-2019
https://doi.org/10.1007/978-3-030-14805-8_5
Heinze TMøller AStrocco FIerusalimschy R(2016)Type safety analysis for DartProceedings of the 12th Symposium on Dynamic Languages10.1145/2989225.2989226(1-12)Online publication date: 1-Nov-2016
https://dl.acm.org/doi/10.1145/2989225.2989226
Stulova NMorales JHermenegildo MCheney JVidal G(2016)Reducing the overhead of assertion run-time checks via static analysisProceedings of the 18th International Symposium on Principles and Practice of Declarative Programming10.1145/2967973.2968597(90-103)Online publication date: 5-Sep-2016
https://dl.acm.org/doi/10.1145/2967973.2968597
Jones TPearce D(2016)A Mechanical Soundness Proof for Subtyping Over Recursive TypesProceedings of the 18th Workshop on Formal Techniques for Java-like Programs10.1145/2955811.2955812(1-6)Online publication date: 17-Jul-2016
https://dl.acm.org/doi/10.1145/2955811.2955812
Siek JTobin-Hochstadt S(2016)The Recursive Union of Some Gradual TypesA List of Successes That Can Change the World10.1007/978-3-319-30936-1_21(388-410)Online publication date: 25-Mar-2016
https://doi.org/10.1007/978-3-319-30936-1_21
Ernst EMøller ASchwarz MStrocco F(2015)Message safety in DartACM SIGPLAN Notices10.1145/2936313.281671151:2(41-53)Online publication date: 21-Oct-2015
https://dl.acm.org/doi/10.1145/2936313.2816711
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

References

Cited By

Index Terms

Recommendations

Gradual typing: a new perspective

Soft typing

Practical soft typing

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations