Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

ICFP
1997
ACM

favoriteEmaildiscussreport

89views Programming Languages» more ICFP 1997»

A Practical Subtyping System For Erlang

13 years 8 months ago

A Practical Subtyping System For Erlang

Download homepages.inf.ed.ac.uk

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

Simon Marlow, Philip Wadler

Real-time Traffic

ICFP 1997 | Inferred Type Conforms | Programming Languages | Type System | User-supplied Type Signature |

claim paper

Related Content

» Pure Subtype Systems

» Logical types for untyped languages

» Finding race conditions in Erlang with QuickCheck and PULSE

» Efficient Inference of Object Types

» Subtyping for session types in the pi calculus

» Recursive Types Are not Conservative over F

» A Language for Biochemical Systems

» Capacity Sizing Under Parameter Uncertainty Safety Staffing Principles Revisited

» MemoizationBased Proof Search in LF an Experimental Evaluation of a Prototype

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	ICFP
Authors	Simon Marlow, Philip Wadler

Comments (0)