Skip to main content Accessibility help

Login Alert

Cancel
Log in
×
×
Register
Log In
(0) Cart
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Logo for Cambridge Core from Cambridge University Press. Click to return to homepage.
Cited by
  • Crossref logo 97
  • Google Scholar logo
Crossref Citations
Crossref logo
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Bundgaard, Mikkel Hildebrandt, Thomas and Godskesen, Jens Chr. 2007. Modelling the Security of Smart Cards by Hard and Soft Types for Higher-Order Mobile Embedded Resources. Electronic Notes in Theoretical Computer Science, Vol. 194, Issue. 1, p. 23.
  • CrossRef
  • Google Scholar
Selinger, Peter and Valiron, Benoît 2008. Foundations of Software Science and Computational Structures. Vol. 4962, Issue. , p. 81.
  • CrossRef
  • Google Scholar
Lampis, Michael Ginis, Kyriakos G. Papakyriakou, Michalis A. and Papaspyrou, Nikolaos S. 2008. Quantum Data and Control Made Easier. Electronic Notes in Theoretical Computer Science, Vol. 210, Issue. , p. 85.
  • CrossRef
  • Google Scholar
Arrighi, Pablo and Dowek, Gilles 2008. Rewriting Techniques and Applications. Vol. 5117, Issue. , p. 17.
  • CrossRef
  • Google Scholar
Delbecque, Yannick and Panagaden, Prakash 2008. Game Semantics for Quantum Stores. Electronic Notes in Theoretical Computer Science, Vol. 218, Issue. , p. 153.
  • CrossRef
  • Google Scholar
Selinger, Peter and Valiron, Benoît 2009. Semantic Techniques in Quantum Computation. p. 135.
  • CrossRef
  • Google Scholar
Nyman, Peter 2009. Quantum Interaction. Vol. 5494, Issue. , p. 158.
  • CrossRef
  • Google Scholar
Vizzotto, Juliana Kaizer Librelotto, Giovani Rubert and Sabry, Amr 2009. Formal Methods: Foundations and Applications. Vol. 5902, Issue. , p. 321.
  • CrossRef
  • Google Scholar
LAGO, UGO DAL MASINI, ANDREA and ZORZI, MARGHERITA 2009. On a measurement-free quantum lambda calculus with classical control. Mathematical Structures in Computer Science, Vol. 19, Issue. 2, p. 297.
  • CrossRef
  • Google Scholar
Vizzotto, Juliana Kaizer Du Bois, André Rauber and Sabry, Amr 2009. Logic, Language, Information and Computation. Vol. 5514, Issue. , p. 379.
  • CrossRef
  • Google Scholar
Arrighi, Pablo and Dowek, Gilles 2010. Programs, Proofs, Processes. Vol. 6158, Issue. , p. 21.
  • CrossRef
  • Google Scholar
Baez, J. and Stay, M. 2010. New Structures for Physics. Vol. 813, Issue. , p. 95.
  • CrossRef
  • Google Scholar
Dal Lago, Ugo Masini, Andrea and Zorzi, Margherita 2010. Quantum implicit computational complexity. Theoretical Computer Science, Vol. 411, Issue. 2, p. 377.
  • CrossRef
  • Google Scholar
Ying, Mingsheng 2010. Quantum computation, quantum theory and AI. Artificial Intelligence, Vol. 174, Issue. 2, p. 162.
  • CrossRef
  • Google Scholar
Díaz-Caro, Alejandro Arrighi, Pablo Gadella, Manuel and Grattage, Jonathan 2011. Measurements and Confluence in Quantum Lambda Calculi With Explicit Qubits. Electronic Notes in Theoretical Computer Science, Vol. 270, Issue. 1, p. 59.
  • CrossRef
  • Google Scholar
Delbecque, Yannick 2011. Game Semantics for Quantum Data. Electronic Notes in Theoretical Computer Science, Vol. 270, Issue. 1, p. 41.
  • CrossRef
  • Google Scholar
Dal Lago, Ugo Masini, Andrea and Zorzi, Margherita 2011. Confluence Results for a Quantum Lambda Calculus with Measurements. Electronic Notes in Theoretical Computer Science, Vol. 270, Issue. 2, p. 251.
  • CrossRef
  • Google Scholar
Dal Lago, Ugo and Faggian, Claudia 2012. On Multiplicative Linear Logic, Modality and Quantum Circuits. Electronic Proceedings in Theoretical Computer Science, Vol. 95, Issue. , p. 55.
  • CrossRef
  • Google Scholar
Assaf, Ali and Perdrix, Simon 2012. Completeness of algebraic CPS simulations. Electronic Proceedings in Theoretical Computer Science, Vol. 88, Issue. , p. 16.
  • CrossRef
  • Google Scholar
James, Roshan P. and Sabry, Amr 2012. Information effects. ACM SIGPLAN Notices, Vol. 47, Issue. 1, p. 73.
  • CrossRef
  • Google Scholar
Download full list
Google Scholar Citations

View all Google Scholar citations for this article.

×
Cambridge University Press

Our Site

  • Accessibility
  • Contact & Help
  • Legal Notices

Quick Links

  • Cambridge Core
  • Cambridge Open Engage
  • Cambridge Higher Education

Our Products

  • Journals
  • Books
  • Elements
  • Textbooks
  • Courseware

Join us online

Please choose a valid location.

  • Rights & Permissions
  • Copyright
  • Privacy Notice
  • Terms of Use
  • Cookies Policy
Cambridge University Press 2025

Cancel
Confirm
×

Save article to Kindle

To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

A lambda calculus for quantum computation with classical control
  • Volume 16, Issue 3
  • PETER SELINGER (a1) and BENOIT VALIRON (a2)
  • DOI: https://doi.org/10.1017/S0960129506005238
Please provide your Kindle email.
Available formats Please select a format to save.
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

A lambda calculus for quantum computation with classical control
  • Volume 16, Issue 3
  • PETER SELINGER (a1) and BENOIT VALIRON (a2)
  • DOI: https://doi.org/10.1017/S0960129506005238
Available formats Please select a format to save.
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

A lambda calculus for quantum computation with classical control
  • Volume 16, Issue 3
  • PETER SELINGER (a1) and BENOIT VALIRON (a2)
  • DOI: https://doi.org/10.1017/S0960129506005238
Available formats Please select a format to save.
×
×

Reply to: Submit a response

Contents help
Close Contents help

- No HTML tags allowed
- Web page URLs will display as text only
- Lines and paragraphs break automatically
- Attachments, images or tables are not permitted

Please enter your response.

Your details

Email help
Close Email help

Your email address will be used in order to notify you when your comment has been reviewed by the moderator and in case the author(s) of the article or the moderator need to contact you directly.

Please enter a valid email address.
You have entered the maximum number of contributors

Conflicting interests

Do you have any conflicting interests? * Conflicting interests help

Close Conflicting interests help

Please list any fees and grants from, employment by, consultancy for, shared ownership in or any close relationship with, at any time over the preceding 36 months, any organisation whose interests may be affected by the publication of the response. Please also list any non-financial associations or interests (personal, professional, political, institutional, religious or other) that a reasonable reader would want to know about in relation to the submitted work. This pertains to all the authors of the piece, their spouses or partners.