A linear-non-linear model for a computational call-by-value lambda calculus (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4962 LNCS, Issue , 2008, Pages 81-96

  Selinger, Peter ^a   Valiron, Benoît ^b  

^a DALHOUSIE UNIVERSITY   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CALL-BY-VALUE LAMBDA CALCULUS; CATEGORICAL SEMANTICS; COMPUTATIONAL LAMBDA-CALCULUS; COMPUTATIONAL STRUCTURES; EUROPEAN; FUNCTIONAL PROGRAMMING LANGUAGES; HEIDELBERG (CO); INTERNATIONAL (CO); LAMBDA CALCULUS; LINEAR LAMBDA CALCULUS; LINEAR LOGIC (LL); NON LINEAR MODELING; QUANTUM COMPUTATIONS; SIDE EFFECTS; SOFTWARE SCIENCE; TYPE SYSTEMS; VALUE REDUCTION;

BASIC (PROGRAMMING LANGUAGE); CALCULATIONS; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL MECHANICS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SOFTWARE; EIGENVALUES AND EIGENFUNCTIONS; FOUNDATIONS; FUNCTIONAL PROGRAMMING; FUZZY LOGIC; INFORMATION THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; MATHEMATICAL TECHNIQUES; QUANTUM COMPUTERS; SEMANTICS;

DIFFERENTIATION (CALCULUS);

EID: 47249119749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_7     Document Type: Conference Paper

References (23)

1. Abramsky, S.: Computational interpretations of linear logic. Theoretical Computer Science 111, 3-57 (1993)
2. Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proceedings of LICS 2004, pp. 415-425 (2004)
3. Barendregt, H.P.: The Lambda-Calculus, its Syntax and Semantics. North Holland, Amsterdam (1984)
4. Benton, N.: A mixed linear and non-linear logic: Proofs, terms and models (extended abstract). In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol. 933, pp. 121-135. Springer, Heidelberg (1995)
5. Benton, N., Bierman, G., de Paiva, V.C.V., Hyland, M.: A term calculus for intuitionistic linear logic. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol. 664, pp. 75-90. Springer, Heidelberg (1993)
6. Benton, N., Bierman, G., Hyland, M., de Paiva, V.C.V.: Linear lambda-calculus and categorical models revisited. In: Martini, S., Börger, E., Kleine Büning, H., Jäger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol. 702, Springer, Heidelberg (1993)
7. Benton, N., Wadler, P.: Linear logic, monads and the lambda calculus. In: Proceedings of LICS 1996, pp. 420-431 (1996)
8. Bierman, G.: On Intuitionistic Linear Logic. PhD thesis, Computer Science Department, Cambridge University, Cambridge (1993)
9. Coecke, B.: Quantum information-flow, concretely, abstractly. In: Selinger, P., (ed.) Proceedings of QPL 2004. TUCS General Publication No. 33, Turku Centre for Computer Science pp. 57-73 (2004)
10. Coecke, B., Pavlovic, D.: Quantum measurements without sums. In: Chen, G., Kauffman, L., Lomonaco, S.J. (eds.) Mathematics of Quantum Computation and Technology, pp. 559-596. Chapman & Hall, Boca Raton (2007)
11. Gay, S.J., Nagarajan, R.: Communicating quantum processes. In: Proceedings of POPL 2005, ACM Press, New York (2005)
12. Lalire, M., Jorrand, P.: A process algebraic approach to concurrent and distributed computation: Operational semantics. In: Selinger, P. (ed.) Proceedings of QPL 2004. TUCS General Publication No. 33, Turku Centre for Computer Science, pp. 109-126 (2004)
13. Mac Lane, S.: Categories for the Working Mathematician. Springer, Heidelberg (1998)
14. Moggi, E.: Notions of computation and monads. Information and Computation 93, 55-92 (1991)
15. Schalk, A.: What is a model for linear logic. Manuscript (2004)
16. Seely, R.A.G.: *-autonomous categories and cofree coalgebras. Contemporary Mathematics 92 (1989)
17. Selinger, P. (ed.): Proceedings of QPL 2004. TUCS General Publication No. 33, Turku Centre for Computer Science (2004)
18. Selinger, P.: Towards a quantum programming language. Mathematical Structures in Computer Science 14, 527-586 (2004)
19. Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. Mathematical Structures in Computer Science 16, 527-552 (2006)
20. Selinger, P., Valiron, B.: On a fully abstract model for a quantum linear functional language. In: Preliminary proceedings of QPL 2006, pp. 103-115 (2006)
21. van Tonder, A.: A lambda calculus for quantum computation. SIAM Journal of Computing 33, 1109-1135 (2004)
22. Wadler, P.: There's no substitute for linear logic. Manuscript, presented at MFPS 1992 (1992)
23. Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299, 802-803 (1982)