Skip to main content
Article thumbnail
Location of Repository

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

By Thomas Ehrhard and Laurent Regnier


12 pagesInternational audienceWe 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

Topics: logic, lambda-calculus, Krivine machine, linear head reduction, mini-reduction, ACM F.3.2, [INFO.INFO-LO] Computer Science [cs]/Logic in Computer Science [cs.LO]
Publisher: Springer Berlin / Heidelberg
Year: 2006
DOI identifier: 10.1007/11780342_20
OAI identifier: oai:HAL:hal-00150273v1
Provided by: Hal-Diderot
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • https://hal.archives-ouvertes.... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.