Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 177

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

A lambda calculus for quantum computation with classical control

SELINGER, PETER, VALIRON, BENOIT · 2006 · Mathematical Structures in Computer Science

Abstract

In this paper we develop a functional programming language for quantum computers by extending the simply-typed lambda calculus with quantum types and operations. The design of this language adheres to the ‘quantum data, classical control’ paradigm, following the first author's work on quantum flow-charts. We define a call-by-value operational semantics, and give a type system using affine intuitionistic linear logic. The main results of this paper are the safety properties of the language and the development of a type inference algorithm.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1017/s0960129506005238

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 177

Metadata

Authors
SELINGER, P., & VALIRON, B.
Venue
Mathematical Structures in Computer Science
Published
2006-06
Volume
16
Issue
3
Pages
527-552
ISSN
  • 0960-1295 (ISSN-L)
  • 1469-8072
OpenAlex
W2145862486
Cited by
177
References
4
FWCI
13.78
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A lambda calculus for quantum computation with classical control. https://app.cochat.ai/papers/10.1017/s0960129506005238
The paper
SELINGER, P., & VALIRON, B. (2006). A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science. https://doi.org/10.1017/s0960129506005238

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.