A Faithful Description of ECMAScript Algorithms

ACM-SIGPLAN International Conference on Principles and Practice of Declarative Programming (PPDP)（2022）

Cited 3|Views6

No score

Abstract

We present an ongoing formalization of algorithms of ECMAScript, the specification describing the semantics of JavaScript, in a tiny functional meta-language. 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.

Translated text

AI Read Science

Must-Reading Tree

Example

Generate MRT to find the research sequence of this paper

Chat Paper

Summary is being generated by the instructions you defined