#### DMCA

## Creative Commons Attribution License.

### Citations

604 | Lambda calculi with types
- Barendregt
- 1992
(Show Context)
Citation Context ... term t and unit type U, if Γ ` t@U : T , then there exists a type V such that Γ ` t : ∀X .V and V [U/X ]≡ T . The following lemma is standard in proofs of subject reduction for System F-like systems =-=[13, 5]-=-. It ensures that well-typedness is preserved under substitution on type and term variables. Lemma 3.2 (Substitution lemma) For any term t, basis term b, context Γ, unit type U and type T , 1. If Γ ` ... |

412 |
A Towards a Theory of Type Structure
- REYNOLDS
- 1974
(Show Context)
Citation Context ...ion 4 shows an abstract interpretation of λCA into Additive, the additive fragment of λlin. Finally, section 5 concludes. 2 The Calculus We introduce the calculus λCA, which extends explicit System F =-=[16]-=- with linear combinations of λ - terms. Figure 1 shows the abstract syntax of types and terms of the calculus, where the terms are based on those of λlin [4]. Our choice of explicit System F instead o... |

118 | Proofs and Types,” Cambridge Tracts - Girard, Lafont, et al. - 1989 |

72 | Finiteness spaces
- Ehrhard
(Show Context)
Citation Context ...ifferential operator. In recent years, there has been growing research interest in these two calculi and their variants, as they could provide an explicit link between linear logic and linear algebra =-=[1, 2, 3, 6, 7, 8, 9, 10, 11, 14, 15, 17, 19]-=-. The two languages, λlin and λalg, are rather similar: they both merge the untyped λ -calculus –higherorder computation in its simplest and most general form– with linear algebraic constructions –sum... |

39 | On Kothe sequence spaces and linear logic. - Ehrhard - 2003 |

33 |
Lambda-calcul: types et modeles. Etudes et recherches en informatique,
- Krivine
- 1990
(Show Context)
Citation Context ... term t and unit type U, if Γ ` t@U : T , then there exists a type V such that Γ ` t : ∀X .V and V [U/X ]≡ T . The following lemma is standard in proofs of subject reduction for System F-like systems =-=[13, 5]-=-. It ensures that well-typedness is preserved under substitution on type and term variables. Lemma 3.2 (Substitution lemma) For any term t, basis term b, context Γ, unit type U and type T , 1. If Γ ` ... |

29 |
λ-calculi with types.
- Barendregt
- 1992
(Show Context)
Citation Context ... term t and unit type U, if Γ ⊢ t@U : T , then there exists a type V such that Γ ⊢ t : ∀X .V and V [U/X ]≡ T . The following lemma is standard in proofs of subject reduction for System F-like systems =-=[12, 4]-=-. It ensures that well-typedness is preserved under substitution on type and term variables. Lemma 3.2 (Substitution lemma) For any term t, basis term b, context Γ, unit type U and type T , 1. If Γ ⊢ ... |

17 | 2009): The algebraic lambda calculus
- Vaux
(Show Context)
Citation Context ...retation in System F. 1 Introduction Two algebraic versions of λ -calculus arose independently in different contexts: the linear-algebraic λ - calculus (λlin) [4] and the algebraic λ -calculus (λalg) =-=[20]-=-. The former was first introduced as a candidate λ -calculus for quantum computation; a linear combination of terms reflect the phenomenon of superposition, i.e. the capacity for a quantum system to b... |

17 | Proofs and Types. Cambridge Tracts in Theoretical Computer Science. - Girard, Lafont, et al. - 1989 |

7 | A Finiteness Structure on Resource Terms. In:
- Ehrhard
- 2010
(Show Context)
Citation Context ...ifferential operator. In recent years, there has been growing research interest in these two calculi and their variants, as they could provide an explicit link between linear logic and linear algebra =-=[1, 2, 3, 6, 7, 8, 9, 10, 11, 14, 15, 17, 19]-=-. The two languages, λlin and λalg, are rather similar: they both merge the untyped λ -calculus –higherorder computation in its simplest and most general form– with linear algebraic constructions –sum... |

7 |
On linear combinations of lambda-terms
- Vaux
- 2007
(Show Context)
Citation Context ...ifferential operator. In recent years, there has been growing research interest in these two calculi and their variants, as they could provide an explicit link between linear logic and linear algebra =-=[1, 2, 3, 6, 7, 8, 9, 10, 11, 14, 15, 17, 19]-=-. The two languages, λlin and λalg, are rather similar: they both merge the untyped λ -calculus –higherorder computation in its simplest and most general form– with linear algebraic constructions –sum... |

6 |
Regnier (2003): The differential lambda-calculus
- Ehrhard, Laurent
(Show Context)
Citation Context ...rposition, i.e. the capacity for a quantum system to be in two or more states at the same time. The latter was introduced in the context of linear logic, as a fragment of the differential λ -calculus =-=[11]-=-, an extension to λ -calculus with a differential operator making the resource-aware behaviour explicit. This extension produces a calculus where superposition of terms may happen. Then λalg can be se... |

6 | Algebraic totality, towards completeness.
- Tasson
- 2009
(Show Context)
Citation Context |

6 | On Linear Combinations of λ -Terms.
- Vaux
- 2007
(Show Context)
Citation Context ...ifferential operator. In recent years, there has been growing research interest in these two calculi and their variants, as they could provide an explicit link between linear logic and linear algebra =-=[1, 2, 5, 6, 7, 8, 9, 10, 13, 14, 16, 18]-=-. The two languages, λlin and λalg, are rather similar: they both merge the untyped λ -calculus –higherorder computation in its simplest and most general form– with linear algebraic constructions –sum... |

3 |
Simona Ronchi Della Rocca (2010): Solvability in Resource LambdaCalculus
- Pagani
(Show Context)
Citation Context |

2 |
Alejandro Dıaz-Caro & Benoıt Valiron (2011): A type system for the vectorial aspects of the linear-algebraic lambda-calculus. In:
- Arrighi
(Show Context)
Citation Context |

2 |
Christine Tasson & Benoı̂t Valiron (2010): Equivalence of algebraic lambda-calculi
- Dı́az-Caro, Perdrix
(Show Context)
Citation Context |

2 |
Paolo Tranquilli (2009): Parallel Reduction in Resource Lambda-Calculus
- Pagani
(Show Context)
Citation Context |

1 |
Dı́az-Caro & Benoı̂t Valiron (2011): Subject reduction in a Curry-style polymorphic type system with a vectorial space structure
- Arrighi, Alejandro
(Show Context)
Citation Context |

1 |
Dı́az-Caro & Barbara Petit (2010): Sums in linear algebraic lambda-calculus. Available at http://arxiv.org/abs/1011.3542
- Alejandro
(Show Context)
Citation Context |