On linear combinations of λ-terms
نویسنده
چکیده
We define an extension of λ-calculus with linear combinations, endowing the set of terms with a structure of R-module, where R is a fixed set of scalars. Terms are moreover subject to identities similar to usual pointwise definition of linear combinations of functions with values in a vector space. We then extend β-reduction on those algebraic λ-terms as follows: at+ u reduces to at′ + u as soon as term t reduces to t′ and a is a non-zero scalar. We prove that reduction is confluent. Under the assumption that the set R of scalars is positive (i.e. a sum of scalars is zero iff all of them are zero), we show that this algebraic λcalculus is a conservative extension of ordinary λ-calculus. On the other hand, we show that if R admits negative elements, then every term reduces to every other term. We investigate the causes of that collapse, and discuss some possible fixes. Preliminary definitions and notations. Recall that a rig (also known as “semiring with zero and unit”) is the same as a ring, without the condition that every element admits an opposite for addition. Let R be a rig. We write R for R\ {0}. We denote by letters a, b, c the elements of R, and say that R is positive if, for all a, b ∈ R, a+ b = 0 implies a = 0 and b = 0. An example of positive rig is N, the set of natural numbers, with usual addition and multiplication. If i, j ∈ N, we write [i; j] for the set {k ∈ N; i ≤ k ≤ j}. Also, we write application of λ-terms à la Krivine: (s) t denotes the application of term s to term t.
منابع مشابه
The vectorial λ-calculus
We describe a type system for the linear-algebraic λ-calculus. The type system accounts for the linear-algebraic aspects of this extension of λ-calculus: it is able to statically describe the linear combinations of terms that will be obtained when reducing the programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. ...
متن کاملNormalizing the Taylor expansion of non-deterministic {\lambda}-terms, via parallel reduction of resource vectors
It has been known since Ehrhard and Regnier’s seminal work on the Taylor expansion of λ-terms that this operation commutes with normalization: the expansion of a λ-term is always normalizable and its normal form is the expansion of the Böhm tree of the term. We generalize this result to the non-uniform setting of the algebraic λ-calculus, i.e., λ-calculus extended with linear combinations of te...
متن کاملIncreasing the accuracy of the classification of diabetic patients in terms of functional limitation using linear and nonlinear combinations of biomarkers: Ramp AUC method
The Area under the ROC Curve (AUC) is a common index for evaluating the ability of the biomarkers for classification. In practice, a single biomarker has limited classification ability, so to improve the classification performance, we are interested in combining biomarkers linearly and nonlinearly. In this study, while introducing various types of loss functions, the Ramp AUC method and some of...
متن کاملConfluence via strong normalisation in an algebraic lambda-calculus with rewriting
The linear-algebraic λ -calculus and the algebraic λ -calculus are untyped λ -calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic λ -calculi are not confluent unless further restrictions are added. We provide a type system for the linear...
متن کاملLineal: A linear-algebraic λ-calculus
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higherorder computation and linear algebra. This language extends the λ-calculus with the possibility to make arbitrary linear combinations of terms α.t + β.u. We describe how to “execute” this language in terms of a few rewrite rules, and jus...
متن کامل