Uniformity and the Taylor expansion of ordinary lambda-terms

Uniformity and the Taylor expansion of ordinary lambda-terms
复制标题

DOI:
10.1016/j.tcs.2008.06.001
复制
发表时间:
2008-08-28
影响因子:
1.1
通讯作者:
Regnier, Laurent
Regnier, Laurent
中科院分区:
计算机科学4区
文献类型:
--
作者:
Ehrhard, Thomas;Regnier, Laurent

文献摘要

被引文献

相似文献

我们定义完整的泰勒展开的一个普通的Eudda-长期作为一个无限的线性组合-合理的系数-的资源演算类似于Boudol的Eudda-演算与多重性(或与资源)的条款。在我们的资源演算中,所有的应用程序在代数意义上都是(多)线性的。即与函数或自变量的线性组合交换。我们研究的集体行为的β-reducts的条款发生在泰勒展开的任何普通的Eudda长期,使用,在一个令人惊讶的关键的方式,一个统一的属性,他们享受。作为一个推论,我们得到(的主要部分)证明,这种泰勒展开与玻姆树计算。语法上。(C)2008 Elsevier B. V.保留所有权利。
We define the complete Taylor expansion of an ordinary lambda-term as an infinite linear combination - with rational coefficients - of terms of a resource calculus similar to Boudol's lambda-calculus with multiplicities (or with resources). In our resource calculus, all applications are (multi)linear in the algebraic sense. i.e. commute with linear combinations of the function or the argument. We study the collective behaviour of the beta-reducts of the terms occurring in the Taylor expansion of any ordinary lambda-term, using, in a surprisingly crucial way, a uniformity property that they enjoy. As a corollary, we obtain (the main part of) a proof that this Taylor expansion commutes with Bohm tree computation. syntactically. (C) 2008 Elsevier B.V. All rights reserved.