%0 Conference Proceedings
%T Böhm trees, Krivine machine and the Taylor expansion of ordinary lambda-terms
%+ Institut de mathématiques de Luminy (IML)
%+ Preuves, Programmes et Systèmes (PPS)
%A Ehrhard, Thomas
%A Regnier, Laurent
%Z 12 pages
%< avec comité de lecture
%( Logical Approaches to Computational Barriers
%B Second Conference on Computability in Europe, CiE 2006
%C Swansea, United Kingdom
%Y A. Beckmann and U. Berger and B. Löwe and J.V. Tucker
%I Springer Berlin / Heidelberg
%3 LNCS 3988
%P 186-197
%8 2006-06-29
%D 2006
%R 10.1007/11780342_20
%K logic
%K lambda-calculus
%K Krivine machine
%K linear head reduction
%K mini-reduction
%Z ACM F.3.2
%Z Computer Science [cs]/Logic in Computer Science [cs.LO]Conference papers
%X 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.
%G English
%L hal-00150273
%U https://hal.science/hal-00150273
%~ UNIV-PARIS7
%~ PPS
%~ CNRS
%~ UNIV-AMU
%~ IML
%~ I2M
%~ UNIV-PARIS