A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Linear-non-Linear Model for a Computational Call-by-Value Lambda Calculus (Extended Abstract)
[chapter]
Foundations of Software Science and Computational Structures
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
doi:10.1007/978-3-540-78499-9_7
dblp:conf/fossacs/SelingerV08
fatcat:sc5e6vnzhrbzbkyjuuxa4lespa