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

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

2008-01-05

arxiv.org/abs/0801.0813v1

Computer Science

Logic in Computer Science

15 pages. Preprint, to appear in the proceedings of FOSSACS'08

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-640332