Alejandro Díaz-Caro

Dr. Alejandro Díaz-Caro

orcid

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 February 2012 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
PAPablo Arrighi
Pablo Arrighi
ADAlejandro Díaz-Caro
Alejandro Díaz-Caro
The Algebraic lambda-calculus and the Linear-Algebraic lambda-calculus extend the lambda-calculus with the possibility of making arbitrary linear combinations of terms. In this paper we provide a fine-grained, System F-like type system for the linear-algebraic lambda-calculus. We show that this "scalar" type system enjoys both the subject-reduction property and the strong-normalisation property, our main technical results. The latter yields a significant simplification of the linear-algebraic lambda-calculus itself, by removing the need for some restrictions in its reduction rules. But the more important, original feature of this scalar type system is that it keeps track of 'the amount of a type' that is present in each term. As an example of its use, we shown that it can serve as a guarantee that the normal form of a term is barycentric, i.e that its scalars are summing to one.

1 December 2019 in BioSystems
Verified
Journal Article
Closed access
ADAlejandro Díaz-Caro
Alejandro Díaz-Caro
GDGilles Dowek
Gilles Dowek
JRJuan Pablo Rinaldi
Juan Pablo Rinaldi

9 December 2014 in Logical Methods in Computer Science
Verified
Journal Article
Open access
PDF file
AAAli Assaf
Ali Assaf
ADAlejandro Díaz-Caro
Alejandro Díaz-Caro
Simon PerdrixSimon Perdrix
Simon Perdrix
CTChristine Tasson
Christine Tasson
BVBenoît Valiron
Benoît Valiron
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 approaches them through rewrite rules. In this paper, we analyse how these different approaches relate to one another. 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 or normalisation 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.

1 June 2019
Verified
Conference Paper
Closed access
ADAlejandro Díaz-Caro
Alejandro Díaz-Caro
MGMauricio Guillermo
Mauricio Guillermo
AMAlexandre Miquel
Alexandre Miquel
BVBenoit Valiron
Benoit Valiron
In this paper we present a semantics for a linear algebraic lambda-calculus based on realizability. This semantics characterizes a notion of unitarity in the system, answering a long standing issue. We derive from the semantics a set of typing rules for a simply-typed linear algebraic lambda-calculus, and show how it extends both to classical and quantum lambda-calculi.

1 June 2017 in Information and Computation
Verified
Journal Article
Closed access
PAPablo Arrighi
Pablo Arrighi
ADAlejandro Díaz-Caro
Alejandro Díaz-Caro
BVBenoît Valiron
Benoît Valiron

31 May 2016 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
ADAlejandro Díaz-Caro
Alejandro Díaz-Caro
AYAbuzer Yakaryılmaz
Abuzer Yakaryılmaz