Understanding TypeScript

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8586 LNCS, Issue , 2014, Pages 257-281

  Bierman, Gavin ^a   Abadi, Martín ^b   Torgersen, Mads ^b  

^a Oracle ^*  (United States)

^b MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH LEVEL LANGUAGES; OBJECT ORIENTED PROGRAMMING;

JAVASCRIPT; JAVASCRIPT PROGRAMMING; JAVASCRIPT PROGRAMS; MODULE SYSTEMS; PRECISE DEFINITION; REFACTORINGS; SMOOTH TRANSITIONS; TYPE SYSTEMS;

JAVA PROGRAMMING LANGUAGE;

EID: 84905405258     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-662-44202-9_11     Document Type: Conference Paper

References (19)

1. Abadi, M., Cardelli, L.: A theory of objects. Springer (1996)
2. Anderson, C., Giannini, P., Drossopoulou, S.: Towards type inference for javaScript. In: Gao, X.-X. (ed.) ECOOP 2005. LNCS, vol. 3586, pp. 428-452. Springer, Heidelberg (2005)
3. Bierman, G., Parkinson, M., Pitts, A.: MJ: An imperative core calculus for Java and Java with effects. Technical Report 563, University of Cambridge Computer Laboratory (2003)
4. Chugh, R., Herman, D., Jhala, R.: Dependent types for JavaScript. In: Proceedings of OOSLA (2012)
5. Crockford, D.: JavaScript: The good parts. O'Reilly (2008)
6. Gapeyev, V., Levin, M., Pierce, B.: Recursive subtyping revealed. JFP 12(6), 511-548 (2002)
7. Gardner, P., Maffeis, S., Smith, G.: Towards a program logic for JavaScript. In: Proceedings of POPL (2013)
8. Google. Dart programming language, http://www.dartlang.org
9. Guha, A., Saftoiu, C., Krishnamurthi, S.: Typing local control and state using flow analysis. In: Barthe, G. (ed.) ESOP 2011. LNCS, vol. 6602, pp. 256-275. Springer, Heidelberg (2011)
10. Igarashi, A., Pierce, B., Wadler, P.: Featherweight Java: A minimal core calculus for Java and GJ. ACM TOPLAS 23(3), 396-450 (2001)
11. Microsoft Corporation. TypeScript Language Specification, 0.9.5 edn. (2014), http://typescriptlang.org
12. Pierce, B., Turner, D.: Local type inference. In: Proceedings of POPL (1998)
13. Sénizergues, G.: The equivalence problem for deterministic pushdown automata is decidable. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 671-681. Springer, Heidelberg (1997)
14. Siek, J.G., Taha, W.: Gradual typing for objects. In: Ernst, E. (ed.) ECOOP 2007. LNCS, vol. 4609, pp. 2-27. Springer, Heidelberg (2007)
15. Swamy, N., Fournet, C., Rastogi, A., Bhargavan, K., Chen, J., Strub, P.-Y., Bierman, G.: Gradual typing embedded securely in JavaScript. In: Proceedings of POPL (2014)
16. Solomon, M.H.: Type definitions with parameters. In: Proceedings of POPL (1978)
17. Thiemann, P.: Towards a type system for analyzing javaScript programs. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol. 3444, pp. 408-422. Springer, Heidelberg (2005)
18. Tobin-Hochstadt, S., Felleisen, M.: The design and implementation of Typed Scheme. In: Proceedings of POPL (2008)
19. Wadler, P., Findler, R.B.: Well-typed programs can't be blamed. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 1-16. Springer, Heidelberg (2009)