Pragmatic subtyping in polymorphic languages

Authors:
Johan Nordlander
Affiliations:
Department of Computing Science, Chalmers University of Technology, S - 412 96 Göteborg, Sweden
Venue:
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Year:
1998

Citing 24
Cited 5

On understanding types, data abstraction, and polymorphism

ACM Computing Surveys (CSUR) - The MIT Press scientific computation series
The definition of Standard ML

The definition of Standard ML
Type inference with subtypes

Proceedings of the Second European Symposium on Programming
Type inference in the presence of overloading, subtyping and recursive types

LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Type inclusion constraints and type inference

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
A system of constructor classes: overloading and implicit higher-order polymorphism

FPCA '93 Proceedings of the conference on Functional programming languages and computer architecture
Polymorphic type inference and abstract data types

Polymorphic type inference and abstract data types
Type inference with extended pattern matching and subtypes

Fundamenta Informaticae - Special issue: lambda calculus and type theory
Refinement types for ML

Refinement types for ML
Lower bounds on type inference with subtypes

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Principal type schemes for functional programs with overloading and subtyping

TAPSOFT '93 Selected papers of the colloquium on Formal approaches of software engineering
Sound polymorphic type inference for objects

Proceedings of the tenth annual conference on Object-oriented programming systems, languages, and applications
On binary methods

Theory and Practice of Object Systems - Special issue: type systems
Simple objects for Standard ML

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Using parameterized signatures to express modular structure

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A practical subtyping system for Erlang

ICFP '97 Proceedings of the second ACM SIGPLAN international conference on Functional programming
Objective ML: a simple object-oriented extension of ML

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Minimal typings in atomic subtyping

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
First-class polymorphism with type inference

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local type inference

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An Efficient Unification Algorithm

ACM Transactions on Programming Languages and Systems (TOPLAS)
Polymorphic Subtype Inference: Closing the Theory-Practice Gap

TAPSOFT '89 Proceedings of the International Joint Conference on Theory and Practice of Software Development, Volume 2: Advanced Seminar on Foundations of Innovative Software Development II and Colloquium on Current Issues in Programming Languages
Subtyping Constrained Types

SAS '96 Proceedings of the Third International Symposium on Static Analysis
Coercion and type inference

POPL '84 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages

Colored local type inference

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An interoperable calculus for external object access

Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Constructor Subtyping in the Calculus of Inductive Constructions

FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Modular typechecking for hierarchically extensible datatypes and functions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Shared subtypes: subtyping recursive parametrized algebraic data types

Proceedings of the first ACM SIGPLAN symposium on Haskell

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalence. This approach allows the subtype relation to be defined by incremental construction of polymorphic records and datatypes, in a way that subsumes the basic type systems of both languages like ML and Java. As the main contribution of the paper, we describe a partial type inference algorithm for the extended system which favours succinctness over generality, in the sense that it never infers types with subtype constraints. The algorithm is based on an efficient approximating constraint solver, and is able to type a wide range of programs that utilize subtyping and polymorphism in a non-trivial way. Since constrained types are not inferred, the algorithm cannot be complete; however, we provide a completeness result w.r.t. the Hindley/Milner type system as a form of characterizing lower bound.