Computing Publications

Publications Home » Towards Type Inference for JavaScript

Towards Type Inference for JavaScript

Christopher Anderson, Sophia Drossopoulou, Paola Giannini

Conference or Workshop Paper
19th European Conference on Object-Oriented Programming (ECOOP 2005), Glasgow, Scotland
July, 2005
pp.428–452
ISBN 3-540-27992-X
ISSN 0302-9743
Abstract

Object-oriented scripting languages like JavaScript and Python are popular partly because of their dynamic features. These include the runtime modification of objects and classes through addition of fields or updating of methods. These features make static typing difficult and so usually dynamic typing is used. Consequently, errors such as access to non-existent members are not detected until runtime.

We first develop a formalism for an object based language, JS0, with features from JavaScript, including dynamic addition of fields and updating of methods. We give an operational semantics and static type system for JS0 using structural types. Our types allow objects to evolve in a controlled manner by classifying members as definite or potential.

We define a type inference algorithm for JS0 that is sound with respect to the type system. If the type inference algorithm succeeds, then the program is typeable. Therefore, programmers can benefit from the safety offered by the type system, without the need to write explicitly types in their programs.

Keywords
SLURP
Language Design
PDF of full publication (361 kilobytes)
(need help viewing PDF files?)
BibTEX file for the publication
N.B.
Conditions for downloading publications from this site.
 

pubs.doc.ic.ac.uk: built & maintained by Ashok Argent-Katwala.