Basic polymorphic typechecking
TL;DR: This work is mostly interested in a particularly orderly form of polymorphism called parametric polymorphism, a property of programs which are parametric with respect to the type of some of their identifiers.
read more
About: This article is published in Science of Computer Programming. The article was published on 01 Apr 1987. and is currently open access. The article focuses on the topics: Parametric polymorphism & Parametric statistics.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Book
Types and Programming Languages
Benjamin C. Pierce
- 01 Jan 2002
TL;DR: This text provides a comprehensive introduction both to type systems in computer science and to the basic theory of programming languages, with a variety of approaches to modeling the features of object-oriented languages.
2.7K
On understanding types, data abstraction, and polymorphism
Luca Cardelli,Peter Wegner +1 more
TL;DR: A λ-calculus-based model for type systems that allows us to explore the interaction among the concepts of type, data abstraction, and polymorphism in a simple setting, unencumbered by complexities of production programming languages is developed.
Refinement types for ML
Timothy S. Freeman,Frank Pfenning +1 more
- 01 May 1991
TL;DR: A type system called refinement types is described, which is an example of a new way to make this tradeoff, as well as a potentially useful system in itself.
Simple unification-based type inference for GADTs
Simon Jones,Dimitrios Vytiniotis,Stephanie Weirich,Geoffrey Washburn +3 more
- 16 Sep 2006
TL;DR: Wobbly types are presented, which express in a declarative way the uncertainty caused by the incremental nature of typical type-inference algorithms.
Type systems
TL;DR: A definition of contravariant, a type that varies in the inverse direction from one of its parts with respect to subtyping, and a tree of judgments obtained by applying the rules of a type system.
357
References
A Machine-Oriented Logic Based on the Resolution Principle
TL;DR: The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.
4.4K
A theory of type polymorphism in programming
TL;DR: This work presents a formal type discipline for polymorphic procedures in the context of a simple programming language, and a compile time type-checking algorithm w which enforces the discipline.
2.6K
On understanding types, data abstraction, and polymorphism
Luca Cardelli,Peter Wegner +1 more
TL;DR: A λ-calculus-based model for type systems that allows us to explore the interaction among the concepts of type, data abstraction, and polymorphism in a simple setting, unencumbered by complexities of production programming languages is developed.
Principal type-schemes for functional programs
Luis Damas,Robin Milner +1 more
- 25 Jan 1982
TL;DR: Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage.
Related Papers (5)
Luis Damas,Robin Milner +1 more
- 25 Jan 1982
Robin Milner,Mads Tofte,Robert Harper +2 more
- 01 Jan 1990