A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)
| dc.creator | Selinger, Peter | |
| dc.creator | Valiron, Benoît | |
| dc.date | 2008-01-05 | |
| dc.date.accessioned | 2026-07-07T08:52:50Z | |
| dc.date.available | 2026-07-07T08:52:50Z | |
| dc.description | 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 comonad, as in the linear logic models of Seely, Bierman, and Benton. The side-effects give rise to a monad, as in Moggi's computational lambda calculus. It is this combination of a monad and a comonad that makes the present paper interesting. We show that our categorical semantics is sound and complete. | |
| dc.description | 15 pages. Preprint, to appear in the proceedings of FOSSACS'08 | |
| dc.identifier | https://arxiv.org/abs/0801.0813 | |
| dc.identifier | http://arxiv.org/abs/0801.0813 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/145412 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | D.3.1; F.4.1 | |
| dc.title | A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) | |
| dc.type | text |