A Faithful Description of ECMAScript Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique
Conference Papers Year : 2022

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.
Fichier principal
Vignette du fichier
paper.pdf (679.28 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03782992 , version 1 (21-09-2022)

Identifiers

Cite

Adam Khayam, Louis Noizet, Alan Schmitt. A Faithful Description of ECMAScript Algorithms. PPDP 2022 - 24th International Symposium on Principles and Practice of Declarative Programming, Sep 2022, Tbilisi, Georgia. pp.1-14, ⟨10.1145/3551357.3551381⟩. ⟨hal-03782992⟩
199 View
152 Download

Altmetric

Share

More