Theoretical Computer Science
Bounded linear logic: a modular approach to polynomial-time computability
Theoretical Computer Science
Handbook of logic in computer science (vol. 2)
A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Probabilistic λ-calculus and Quantitative Program Analysis
Journal of Logic and Computation
Quantum programming languages: survey and bibliography
Mathematical Structures in Computer Science
Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics)
An Algebra of Pure Quantum Programming
Electronic Notes in Theoretical Computer Science (ENTCS)
Linear-algebraic λ-calculus: higher-order, encodings, and confluence.
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Hi-index | 0.00 |
The Linear-Algebraic @l-Calculus [Arrighi, P. and G. Dowek, Linear-algebraic @l-calculus: higher-order, encodings and confluence, Lecture Notes in Computer Science (RTA'08) 5117 (2008), pp. 17-31] extends the @l-calculus with the possibility of making arbitrary linear combinations of terms @a.t+@b.u. Since one can express fixed points over sums in this calculus, one has a notion of infinities arising, and hence indefinite forms. As a consequence, in order to guarantee the confluence, t-t does not always reduce to 0 - only if t is closed normal. In this paper we provide a System F like type system for the Linear-Algebraic @l-Calculus, which guarantees normalisation and hence no need for such restrictions, t-t always reduces to 0. Moreover this type system keeps track of 'the amount of a type'. As such it can be seen as probabilistic type system, guaranteeing that terms define correct probabilistic functions. It can also be seen as a step along the quest toward a quantum physical logic through the Curry-Howard isomorphism [Sorensen, M. H. and P. Urzyczyn, ''Lectures on the Curry-Howard Isomorphism, Volume 149 (Studies in Logic and the Foundations of Mathematics),'' Elsevier Science Inc., New York, NY, USA, 2006].