(Submitted on 21 Jul 2003 (v1), last revised 3 Apr 2004 (this version, v5)) Abstract: The classical lambda calculus may be regarded both as a programming language and as a formal algebraic system for reasoning about computation. It provides a computational model equivalent to the Turing machine, and continues to be of enormous benefit in the classical theory of computation. We propose that quantum
1 Quantum Lambda Calculus Peter Selinger Dalhousie University, Canada Benoı̂t Valiron INRIA and École Polytechnique, LIX, Palaiseau, France. Abstract We discuss the design of a typed lambda calculus for quantum compu- tation. After a brief discussion of the role of higher-order functions in quantum information theory, we define the quantum lambda calculus and its operational semantics. Safety inv
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く