The invariance thesis of Slot and van Emde Boas states that all reasonable models of computation simulate each other with polynomially bounded overhead in time and constant-factor overhead in space. In this paper we show that a family of strong call-by-value strategies in the $\lambda$-calculus are reasonable for time. The proof is based on a construction of an appropriate abstract machine, systematically derived using Danvy et al.'s functional correspondence that connects higher-order interpreters with abstract-machine models by a well-established transformation technique. This is the first machine that implements a strong CbV strategy and simulates $\beta$-reduction with the overhead polynomial in the number of $\beta$-steps and in the size of the initial term. We prove this property using a form of amortized cost analysis \`a la Okasaki.

中文翻译：

---

价值强烈要求时间是合理的

Slot和van Emde Boas的不变性理论指出，所有合理的计算模型都在时间上采用多项式有界开销，而在空间上采用常数因子开销来相互模拟。在本文中，我们证明了在$ \ lambda $演算中，一系列强大的按价值调用策略对于时间而言是合理的。该证明基于适当抽象机器的构造，该构造是使用Danvy等人的功能性函式系统地推导的，该函式通过一种完善的转换技术将高阶解释器与抽象机器模型相连接。这是第一台实施强CbV策略并使用$ beta步数和初始项大小的开销多项式模拟$ beta减少的机器。我们使用分摊成本分析的形式证明了该属性。