Safe & Efficient Gradual Typing for TypeScript
From MaRDI portal
Publication:2819802
DOI10.1145/2676726.2676971zbMath1346.68049OpenAlexW2091335641MaRDI QIDQ2819802
Nikhil Swamy, Aseem Rastogi, Panagiotis Vekris, G. M. Bierman, Cédric Fournet
Publication date: 29 September 2016
Published in: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2676726.2676971
Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Semantics in the theory of computing (68Q55)
Related Items (8)
Gradual typing using union typing with records ⋮ An Integrated Approach to Assertion-Based Random Testing in Prolog ⋮ The role of concurrency in an evolutionary view of programming abstractions ⋮ VeriFly: On-the-fly Assertion Checking via Incrementality ⋮ Fifty Years of Prolog and Beyond ⋮ Preemptive type checking ⋮ How to evaluate the performance of gradual type systems ⋮ Blame and coercion: Together again for the first time
Uses Software
This page was built for publication: Safe & Efficient Gradual Typing for TypeScript