article

Basic polymorphic typechecking

Author:

Luca CardelliAuthors Info & Claims

Science of Computer Programming, Volume 8, Issue 2

Pages 147 - 172

https://doi.org/10.1016/0167-6423(87)90019-0

Published: 01 April 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Carnier DPottier FKeuchel S(2024)Type Inference LogicsProceedings of the ACM on Programming Languages10.1145/36897868:OOPSLA2(2125-2155)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689786
De Feo LSchost É(2011)transalpyneACM Communications in Computer Algebra10.1145/1940475.194048744:3/4(105-106)Online publication date: 28-Jan-2011
https://dl.acm.org/doi/10.1145/1940475.1940487
Bakel S(2011)Strict intersection types for the Lambda CalculusACM Computing Surveys10.1145/1922649.192265743:3(1-49)Online publication date: 29-Apr-2011
https://dl.acm.org/doi/10.1145/1922649.1922657
Show More Cited By

Index Terms

Basic polymorphic typechecking
1. Mathematics of computing
  1. Continuous mathematics
    1. Calculus
      1. Lambda calculus
  2. Mathematical analysis
    1. Calculus
      1. Lambda calculus

Recommendations

On polymorphic gradual typing

We study an extension of gradual typing—a method to integrate dynamic typing and static typing smoothly in a single language—to parametric polymorphism and its theoretical properties, including conservativity of typing and semantics over both statically ...
Polymorphic delimited continuations
APLAS'07: Proceedings of the 5th Asian conference on Programming languages and systems

This paper presents a polymorphic type system for a language with delimited control operators, shift and reset. Based on the monomorphic type system by Danvy and Filinski, the proposed type system allows pure expressions to be polymorphic. Thanks to the ...
Polymorphic type inference
POPL '83: Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

The benefits of strong typing to disciplined programming, to compile-time error detection and to program verification are well known. Strong typing is especially natural for functional (applicative) languages, in which function application is the central ...

Comments

Information & Contributors

Information

Published In

cover image Science of Computer Programming

Science of Computer Programming Volume 8, Issue 2

April 1, 1987

88 pages

ISSN:0167-6423

Editor:
M. Sintzoff
Univ. Catholique de Louvain, Louvain-la-Neuve, Belgium

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 01 April 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Carnier DPottier FKeuchel S(2024)Type Inference LogicsProceedings of the ACM on Programming Languages10.1145/36897868:OOPSLA2(2125-2155)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1145/3689786
De Feo LSchost É(2011)transalpyneACM Communications in Computer Algebra10.1145/1940475.194048744:3/4(105-106)Online publication date: 28-Jan-2011
https://dl.acm.org/doi/10.1145/1940475.1940487
Bakel S(2011)Strict intersection types for the Lambda CalculusACM Computing Surveys10.1145/1922649.192265743:3(1-49)Online publication date: 29-Apr-2011
https://dl.acm.org/doi/10.1145/1922649.1922657
Kuan GMacQueen DFindler R(2007)A rewriting semantics for type inferenceProceedings of the 16th European Symposium on Programming10.5555/1762174.1762214(426-440)Online publication date: 24-Mar-2007
https://dl.acm.org/doi/10.5555/1762174.1762214
Peyton Jones SVytiniotis DWeirich SShields M(2007)Practical type inference for arbitrary-rank typesJournal of Functional Programming10.1017/S095679680600603417:1(1-82)Online publication date: 1-Jan-2007
https://dl.acm.org/doi/10.1017/S0956796806006034
Oancea CWatt S(2005)Parametric polymorphism for software component architecturesACM SIGPLAN Notices10.1145/1103845.109482340:10(147-166)Online publication date: 12-Oct-2005
https://dl.acm.org/doi/10.1145/1103845.1094823
Oancea CWatt SJohnson RBaniassad EGabriel RNoble JMarick B(2005)Parametric polymorphism for software component architecturesProceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications10.1145/1094811.1094823(147-166)Online publication date: 17-Oct-2005
https://dl.acm.org/doi/10.1145/1094811.1094823
Sheard TPasalic E(2004)Two-level types and parameterized modulesJournal of Functional Programming10.1017/S095679680300488X14:5(547-587)Online publication date: 1-Sep-2004
https://dl.acm.org/doi/10.1017/S095679680300488X
Choppella V(2003)Polymorphic type reconstruction using type equationsProceedings of the 15th international conference on Implementation of Functional Languages10.1007/978-3-540-27861-0_4(53-68)Online publication date: 8-Sep-2003
https://dl.acm.org/doi/10.1007/978-3-540-27861-0_4
Black AHuang JKoster RWalpole JPu C(2002)InfopipesMultimedia Systems10.5555/782583.7825918:5(406-419)Online publication date: 1-Dec-2002
https://dl.acm.org/doi/10.5555/782583.782591
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

On polymorphic gradual typing

Polymorphic delimited continuations

Polymorphic type inference

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations