Towards Type Inference for JavaScript

Anderson, Christopher; Giannini, Paola; Drossopoulou, Sophia

doi:10.1007/11531142_19

Cited by 163 publications

(158 citation statements)

References 17 publications

Supporting

Mentioning

158

Contrasting

Order By: Relevance

“…Various research efforts have explored sound approaches to this problem. Thiemann [17] proposed an early type system that uses singleton types and first-class record labels, and in the same year Anderson et al [2] proposed another type system with a focus on type inference. A number of others have proposed systems of increasing complexity to deal with the complicated programming patterns found in JavaScript; for example, Chugh et al [4] employed nested refinements and heap types in DJS, and Guha et al [9] proposed a combination of a type system and a flow analysis.…”

Section: Theorem 2 S T If and Only If S Tmentioning

confidence: 99%

Understanding TypeScript

Bierman

Abadi

Torgersen

2014

Lecture Notes in Computer Science

157

View full text Add to dashboard Cite

Abstract. TypeScript is an extension of JavaScript intended to enable easier development of large-scale JavaScript applications. While every JavaScript program is a TypeScript program, TypeScript offers a module system, classes, interfaces, and a rich gradual type system. The intention is that TypeScript provides a smooth transition for JavaScript programmers-well-established JavaScript programming idioms are supported without any major rewriting or annotations. One interesting consequence is that the TypeScript type system is not statically sound by design. The goal of this paper is to capture the essence of TypeScript by giving a precise definition of this type system on a core set of constructs of the language. Our main contribution, beyond the familiar advantages of a robust, mathematical formalization, is a refactoring into a safe inner fragment and an additional layer of unsafe rules.

show abstract

Section: Theorem 2 S T If and Only If S Tmentioning

confidence: 99%

Understanding TypeScript

Bierman

Abadi

Torgersen

2014

Lecture Notes in Computer Science

157

View full text Add to dashboard Cite

show abstract

“…dynamic modifications of classes and methods) have been removed. JS 0 [37] is a statically-typed version of JavaScript with inference, where both dynamic addition of fields and method updating are supported. ActionScript is one of the first languages used in the industry to embrace gradual typing, and efforts have been made to optimize it using local type inference [7].…”

Section: Related Workmentioning

confidence: 99%

Gradual typing for Smalltalk

Allende

Callaú

Fabry

et al. 2014

Science of Computer Programming

View full text Add to dashboard Cite

Being able to combine static and dynamic typing within the same language has clear benefits in order to support the evolution of prototypes or scripts into mature robust programs. While being an emblematic dynamic object-oriented language, Smalltalk is lagging behind in this regard. We report on the design, implementation and application of Gradualtalk, a gradually-typed Smalltalk meant to enable incremental typing of existing programs. The main design goal of the type system is to support the features of the Smalltalk language, like metaclasses and blocks, live programming, and to accomodate the programming idioms used in practice. We studied a number of existing projects in order to determine the features to include in the type system. As a result, Gradualtalk is a practical approach to gradual types in Smalltalk, with a novel blend of type system features that accomodate most programming idioms.

show abstract

“…Their focus is not on objects, but instead on numerical analysis and domains with the aim of program optimization. Anderson et al give an operational semantics and static type system using structural types over an idealized version of JavaScript [14]. They consider subtyping for objects based on implementation (a subtype must contain all members of its supertype), whereas we formulated equivalence between types based on having the same interface.…”

Section: B Abstract Interpretation and Type Inference Of Javascriptmentioning

confidence: 99%

Determining dynamic coupling in JavaScript using object type inference

Nicolay

Noguera

Roover

et al. 2013

2013 IEEE 13th International Working Conference on Source Code Analysis and Manipulation (SCAM)

View full text Add to dashboard Cite

Abstract-Coupling in an object-oriented context is often defined in terms of access to instance variables and methods of other classes. JavaScript, however, lacks static type information and classes, and instead features a flexible object system with prototypal inheritance. In order to determine coupling in JavaScript, we infer object types based on abstract interpretation of a program. Type inference depends on both structure and behavior of objects, and common patterns for expressing classes and modules are supported. We approximate a set of accessed types per function, and classify every access as either local or foreign. Examples demonstrate that our object type inference, together with some additional heuristics concerning property access, enable determining coupling in JavaScript in a meaningful way.

show abstract

Towards Type Inference for JavaScript

Cited by 163 publications

References 17 publications

Understanding TypeScript

Understanding TypeScript

Gradual typing for Smalltalk

Determining dynamic coupling in JavaScript using object type inference

Contact Info

Product

Resources

About