Polymorphic Type Inference for Scripting Languages With Object Extensions

This paper presents a polymorphic type inference algorithm for a small subset of JavaScript. The goal is to prevent accessing undefined members of objects. The authors define a type system that allows explicit extension of objects through add operation and implicit extension through method calls. The type system also permits strong updates and unrestricted extensions to new objects. The type inference algorithm is modular so that each function definition is only analyzed once and larger programs can be checked incrementally.

Provided by: University of Wisconsin Topic: Software Date Added: Oct 2011 Format: PDF

Find By Topic