A practical subtyping system for Erlang

1 August 1997

journal article
Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices

Vol. 32 (8) , 136-149
https://doi.org/10.1145/258949.258962

Abstract

We present a type system for the programming language Erlang. The type system supports subtyping and declaration-free recursive types, using subtyping constraints. Our system is similar to one explored by Aiken and Wimmers, though it sacrifices expressive power in favour of simplicity. We cover our techniques for type inference, type simplification, and checking when an inferred type conforms to a user-supplied type signature, and report on early experience with our prototype.

Keywords

This publication has 10 references indexed in Scilit:

A theory of type polymorphism in programming
Published by Elsevier ,2003
The Type and Effect Discipline
Information and Computation, 1994
Soft typing with conditional types
Published by Association for Computing Machinery (ACM) ,1994
A practical soft type system for Scheme
Published by Association for Computing Machinery (ACM) ,1994
Type inclusion constraints and type inference
Published by Association for Computing Machinery (ACM) ,1993
Type inference with simple subtypes
Journal of Functional Programming, 1991
Soft typing
Published by Association for Computing Machinery (ACM) ,1991
An ideal model for recursive polymorphic types
Information and Control, 1986
Declaration-free type checking
Published by Association for Computing Machinery (ACM) ,1985
Principal type-schemes for functional programs
Published by Association for Computing Machinery (ACM) ,1982