The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)
[article]
2008
arXiv
pre-print
We give a categorical semantics for a call-by-value linear lambda calculus. Such a lambda calculus was used by Selinger and Valiron as the backbone of a functional programming language for quantum computation. One feature of this lambda calculus is its linear type system, which includes a duplicability operator "!" as in linear logic. Another main feature is its call-by-value reduction strategy, together with a side-effect to model probabilistic measurements. The "!" operator gives rise to a
arXiv:0801.0813v1
fatcat:ryf5svfuyvh6dfjyq5pogwdf74