A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) release_ryf5svfuyvh6dfjyq5pogwdf74

by Peter Selinger Dalhousie University,

Released as a article .

2008  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  246.2 kB
file_d3q344225fedjhl6p5oem3uskq
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2008-01-05
Version   v1
Language   en ?
arXiv  0801.0813v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 96e9c52e-9e97-4d6b-a932-f37b5b6bf8de
API URL: JSON