Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms

Résumé

We introduce and study a version of Krivine's machine which provides a precise information about how much of its argument is needed for performing a computation. This information is expressed as a term of a resource lambda-calculus introduced by the authors in a recent article; this calculus can be seen as a fragment of the differential lambda-calculus. We use this machine to show that Taylor expansion of lambda-terms (an operation mapping lambda-terms to generally infinite linear combinations of resource lambda-terms) commutes with Boehm tree computation.

Dates et versions

hal-00150273 , version 1 (29-05-2007)

Identifiants

Citer

Thomas Ehrhard, Laurent Regnier. Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms. Second Conference on Computability in Europe, CiE 2006, Jun 2006, Swansea, United Kingdom. pp.186-197, ⟨10.1007/11780342_20⟩. ⟨hal-00150273⟩
155 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More