Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

TLCA
2005
Springer

favoriteEmaildiscussreport

114views Theoretical Computer Science» more TLCA 2005»

A Lambda Calculus for Quantum Computation with Classical Control

13 years 9 months ago

A Lambda Calculus for Quantum Computation with Classical Control

Download www.mscs.dal.ca

The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the ﬁrst author’s work on quantum ﬂow-charts. We deﬁne a call-by-value operational semantics, and we give a type system using afﬁne intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.

Peter Selinger, Benoît Valiron

Real-time Traffic

Call-by-value Operational Semantics | Functional Programming Language | Theoretical Computer Science | TLCA 2005 | Type Inference Algorithm |

claim paper

Related Content

» Access control in a core calculus of dependency

» Strong normalization from an unusual point of view

» Towards a Quantum Calculus Work in Progress Extended Abstract

» Quantum Switching Networks with Classical Routing

» Classicallycontrolled Quantum Computation

» A Selfdependency Constraint in the Simply Typed Lambda Calculus

» A Lambda Calculus for Real Analysis

» Lolliproc to concurrency from classical linear logic via curryhoward and control

» Quantum Patterns and Types for Entanglement and Separability

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	TLCA
Authors	Peter Selinger, Benoît Valiron

Comments (0)