We present an abstract machine that implements a full-reducing (a.k.a. strong) call-by-value strategy for pure $\lambda$-calculus. It is derived using Danvy et al.'s functional correspondence from Cr\'egut's KN by: (1) deconstructing KN to a call-by-name normalization-by-evaluation function akin to Filinski and Rohde's, (2) modifying the resulting normalizer so that it implements the right-to-left call-by-value function application, and (3) constructing the functionally corresponding abstract machine. This new machine implements a reduction strategy that subsumes the fireball-calculus variant of call by value studied by Accattoli et al. We describe the strong strategy of the machine in terms of a reduction semantics and prove the correctness of the machine using a method based on Biernacka et al.'s generalized refocusing. As a byproduct, we present an example application of the machine to checking term convertibility by discriminating on the basis of their partially normalized forms.

中文翻译：

---

强价值调用的抽象机器

我们提出了一个抽象机器，它为纯 $\lambda$-calculus 实现了一个完全归约（又名强）的按值调用策略。它是使用 Danvy 等人从 Cr\'egut 的 KN 的函数对应推导出来的，方法如下：（1）将 KN 解构为类似于 Filinski 和 Rohde 的按名称调用规范化评估函数，（2）修改结果normalizer 以便它实现从右到左的按值调用函数应用程序，以及 (3) 构建功能对应的抽象机。这台新机器实现了一种减少策略，该策略包含了 Accattoli 等人研究的按值调用的火球演算变体。我们用归约语义来描述机器的强策略，并使用基于 Biernacka 等人的广义重新聚焦的方法证明机器的正确性。