Our research is part of a wider project that aims to investigate and reason about the correctness of scheme-based source code transformations of Erlang programs. In order to formally reason about the definition of a programming language and the software built using it, we need a mathematically rigorous description of that language. In this paper, we present our 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. closures). We also present essential properties of the formalisation (e.g. determinism) along with their machine-checked proofs. Finally, we prove the correctness of some simple refactoring strategies.

中文翻译：

---

基于证明助手的 Core Erlang 形式化

我们的研究是一个更广泛项目的一部分，该项目旨在调查和推理 Erlang 程序基于方案的源代码转换的正确性。为了正式推理编程语言的定义以及使用它构建的软件，我们需要对该语言进行数学上严格的描述。在本文中，我们展示了 Erlang 子集的基于证明助手的形式化，旨在作为证明重构正确的基础。在讨论了我们如何重用相关工作中的概念之后，我们展示了形式描述的语法和语义，包括所涉及的抽象（例如闭包）。我们还介绍了形式化的基本属性（例如确定性）及其机器检查证明。最后，我们证明了一些简单重构策略的正确性。