A Faithful Description of ECMAScript Algorithms
Abstract
We present an ongoing formalization of algorithms of ECMAScript, the specification describing the semantics of JavaScript, in a tiny functional metalanguage. We show that this formalization is concise, readable, maintainable, and textually close to the specification. We extract an OCaml interpreter from our description and run small JavaScript programs whose semantics is based on these algorithms.
| Origin | Files produced by the author(s) |
|---|