Quantum Lambda Calculus

Semantic Techniques in Quantum Computation

Volumn 9780521513746, Issue , 2013, Pages 135-172

  Selinger, Peter ^a   Valiron, Benôıt ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATION THEORY; INFERENCE ENGINES; INFORMATION THEORY; QUANTUM COMPUTERS; QUANTUM OPTICS; SEMANTICS;

HIGHER ORDER FUNCTIONS; HIGHER-ORDER FUNCTIONS; INTUITIONISTIC LINEAR LOGIC; LAMBDA-CALCULI; OPERATIONAL SEMANTICS; PROPERTY; QUANTUM INFORMATION THEORY; STATIC TYPE SYSTEMS; TYPE INFERENCE ALGORITHM; TYPED LAMBDA CALCULUS;

DIFFERENTIATION (CALCULUS);

EID: 84923420767     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1017/CBO9781139193313.005     Document Type: Chapter

References (37)

1. Abramsky, S. (1993) Computational interpretations of linear logic. Theoretical Computer Science 111:3-57.
2. Altenkirch, T., and Grattage, J. (2005) Afunctional quantum programming language. In Proceedings of the 20th IEEE Symposium on Logic in Computer Science, LICS'05, pages 249-258. IEEE Computer Society Press.
3. Barendregt, H. P. (1984) The Lambda Calculus: Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundation of Mathematics. North Holland, second edition.
4. Bell, J. S. (1964) On the Einstein Podolsky Rosen paradox. Physics 1:195-200.
5. Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., and Wootters, W. K. (1993) Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. Physical Review Letters 70(13):1895-1899.
6. Bennett, C. H., andWiesner, S. J. (1992) Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states. Physical Review Letters 69(20):2881-2884.
7. Benton, N. (1995) A mixed linear and non-linear logic: Proofs, terms and models (extended abstract). In Proceedings of the EighthWorkshop on Computer Science Logic, CSL'94, Selected Papers, volume 933 of Lecture Notes in Computer Science, pages 121-135. Springer.
8. Benton, N., Bierman, G., de Paiva, V., and Hyland, M. (1993a) Linear λ-calculus and categorical models revisited. In Proceedings of the Sixth Workshop on Computer Science Logic, CSL'92, Selected Papers, volume 702 of Lecture Notes in Computer Science, pages 61-84. Springer.
9. Benton, N., Bierman, G., de Paiva, V., and Hyland, M. (1993b) A term calculus for intuitionistic linear logic. In Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA'93, volume 664 of Lecture Notes in Computer Science, pages 75-90. Springer.
10. Benton, N., andWadler, P. (1996) Linear logic, monads and the lambda calculus. In Proceedings of the 11th IEEE Symposium on Logic in Computer Science, LICS'96, pages 420-431. IEEE Computer Society Press.
11. Bierman, G. (1993) On Intuitionistic Linear Logic. Ph.D. thesis, University of Cambridge Computer Laboratory, Cambridge, England. Available as Technical Report 346, August 1994.
12. Deutsch, D., and Jozsa, R. (1992) Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London A 439:553-558.
13. Girard, J.-Y. (1987) Linear logic. Theoretical Computer Science 50(1):1-101.
14. Hudak, P., Hughes, J., Peyton Jones, S., and Wadler, P. (2007) A history of Haskell: Being lazy with class. In HOPL III: Proceedings of the Third ACM SIGPLAN Conference on History of Programming Languages, pages 121-55. Association for Computing Machinery.
15. Knill, E. H. (1996) Conventions for quantum pseudocode. Technical Report LAUR-96-2724, Los Alamos National Laboratory.
16. Lambek, J., and Scott, P. (1986) Introduction to Higher Order Categorical Logic, volume 7 of Cambridge Studies in Advanced Mathematics. Cambridge University Press.
17. MacLane, S. (1971) Categories for the Working Mathematician, volume 5 of Graduate Texts in Mathematics. Springer.
18. Maneggia, P. (2004) Models of Linear Polymorphism. Ph.D. thesis, School of Computer Science, University of Birmingham.
19. McCarthy, J. (1960) Recursive functions of symbolic expressions and their computation by machine, part I. Communications of the ACM 3(4):184-195.
20. Melliès, P.-A. (2003) Categorical models of linear logic revisited. Technical Report 22, Laboratoire Preuves, Programmes et Systèmes, CNRS and Paris 7.
21. Milner, R. (1978) A theory of type polymorphism in programming. Journal of Computer and System Sciences 17:348-375.
22. Moggi, E. (1991) Notions of computation and monads. Information and Computation 93(1):55- 92.
23. Pierce, B. C. (2002) Types and Programming Languages. MIT Press.
24. Schalk, A. (2004) What is a categorical model of linear logic? Manuscript, available from http://www.cs.man.ac.uk/-schalk/work.html.
25. Seely, R. A. (1989) Linear logic, *-autonomous categories and cofree coalgebras. In Proceedings of Categories in Computer Science and Logic, Boulder, 1987, volume 92 of Contemporary Mathematics, pages 371-382. American Mathematical Society.
26. Selinger, P. (2004) Towards a quantum programming language. Mathematical Structures in Computer Science 14(4):527-586.
27. Selinger, P., and Valiron, B. (2005) A lambda calculus for quantum computation with classical control. In Proceedings of the Seventh International Conference on Typed Lambda Calculi and Applications, TLCA'05, volume 3461 of Lecture Notes in Computer Science, pages 354-368. Springer.
28. Selinger, P., and Valiron, B. (2006) A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16(3):527-552.
29. Selinger, P., and Valiron, B. (2008a) A linear-non-linear model for a computational call-by-value lambda calculus. In Proceedings of the Eleventh International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2008, volume 4962 of Lecture Notes in Computer Science, pages 81-96. Budapest.
30. Selinger, P., and Valiron, B. (2008b) On a fully abstract model for a quantum linear functional language. In Proceedings of the Fourth International Workshop on Quantum Programming Languages, QPL 2006, volume 210 of Electronic Notes in Theoretical Computer Science, pages 123-137.
31. Sussman, G. J., and Steele, G. L., Jr. (1975) Scheme: An interpreter for extended lambda calculus. Technical Report AIM-349, MIT.
32. Troelstra, A. S. (1992) Lectures on Linear Logic, volume 29 of CSLI Lecture Notes. University of Chicago Press, second edition.
33. Turing, A. M. (1937) On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2 42:230-265.
34. Valiron, B. (2004a) A functional Programming Language for Quantum Computation with Classical Control. Master's thesis, Department of Mathematics and Statistics, University of Ottawa.
35. Valiron, B. (2004b) Quantum typing. In Proceedings of the Second International Workshop on Quantum Programming Languages, QPL 2004, TUCS General Publication 33, pages 163-178. Turku Centre for Computer Science, Turku, Finland.
36. Valiron, B. (2008) Semantics for a Higher-Order Functional Programming Language for Quantum Computation. Ph.D. thesis, Department of Mathematics and Statistics, University of Ottawa.
37. van Tonder, A. (2004) A lambda calculus for quantum computation. SIAM Journal of Computing 33(5):1109-1135.