Skip to Main content Skip to Navigation
Conference papers

Equivalence of algebraic λ-calculi

Abstract : We examine the relationship between the algebraic {\lambda}-calculus, a fragment of the differential {\lambda}-calculus; and the linear-algebraic {\lambda}-calculus, a candidate {\lambda}-calculus for quantum computation. Both calculi are algebraic: each one is equipped with an additive and a scalar-multiplicative structure, and their set of terms is closed under linear combinations. However, the two languages were built using different approaches: the former is a call-by-name language whereas the latter is call-by-value; the former considers algebraic equalities whereas the latter approach them through rewrite rules. In this paper, we analyse how these different approaches relate one to the other. To this end, we propose four canonical languages based on each of the possible choices: call-by-name versus call-by-value, algebraic equality versus algebraic rewriting. We show that the various languages simulate one another. Due to subtle interaction between beta-reduction and algebraic rewriting, to make the languages consistent some additional hypotheses such as confluence might be required. We carefully devise the required properties for each proof, making them general enough to be valid for any sub-language satisfying the corresponding properties.
Document type :
Conference papers
Complete list of metadatas
Contributor : Alejandro Díaz-Caro <>
Submitted on : Tuesday, January 7, 2014 - 11:58:16 AM
Last modification on : Friday, July 17, 2020 - 11:10:21 AM

Links full text


  • HAL Id : hal-00924912, version 1
  • ARXIV : 1005.2897




Alejandro Díaz-Caro, Simon Perdrix, Christine Tasson, Benoît Valiron. Equivalence of algebraic λ-calculi. HOR - 5th International Workshop on Higher-Order Rewriting - 2010, Eduardo Bonelli, Jul 2010, Edinburgh, United Kingdom. pp.6-11. ⟨hal-00924912⟩



Record views