. . . "12222" . . . . . . . . . . . . . . "We present a proof-assistant-based formalisation of a subset of Erlang, intended to serve as a base for proving refactorings correct. After discussing how we reused concepts from related work, we show the syntax and semantics of our formal description, including the abstractions involved (e.g. the concept of a closure). We also present essential properties of the formalisation (e.g. determinism) along with the summary of their machine-checked proofs. Finally, we prove expression pattern equivalences which can be interpreted as simple local refactorings."^^ . . . . . . . "A Proof Assistant Based Formalisation of a Subset of Sequential Core Erlang"^^ . . . . . . . . . "2020-08-17" . .