{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:57Z","timestamp":1759638417068},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70590-1_2","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"17-31","source":"Crossref","is-referenced-by-count":25,"title":["Linear-algebraic \u03bb-calculus: higher-order, encodings, and confluence."],"prefix":"10.1007","author":[{"given":"Pablo","family":"Arrighi","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Dowek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols LICS. IEEE Computer Society, 415\u2013425 (2004)","DOI":"10.1109\/LICS.2004.1319636"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Altenkirch, T., Grattage, J., Vizzotto, J.K., Sabry, A.: An Algebra of Pure Quantum Programming. In: Third International Workshop on Quantum Programming Languages. Electronic Notes of Theoretical Computer Science, vol.\u00a0170C, pp. 23\u201347 (2007)","DOI":"10.1016\/j.entcs.2006.12.010"},{"key":"2_CR3","first-page":"249","volume":"117","author":"P. Arrighi","year":"2005","unstructured":"Arrighi, P., Dowek, G.: A computational definition of the notion of vectorial space. ENTCS\u00a0117, 249\u2013261 (2005)","journal-title":"ENTCS"},{"key":"2_CR4","unstructured":"Arrighi, P., Dowek, G.: Linear-algebraic lambda-calculus. In: Selinger, P. (ed.) International workshop on quantum programming languages, Turku Centre for Computer Science General Publication, vol.\u00a033, pp. 21\u201338 (2004)"},{"key":"2_CR5","unstructured":"Arrighi, P., Dowek, G.: Linear-algebraic lambda-calculus: higher-order, encodings, confluence, arXiv:quant-ph\/0612199."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Bernstein, E., Vazirani, U.: Quantum Complexity Theory. In: Annual ACM symposium on Theory of Computing, vol.\u00a025 (1993)","DOI":"10.1145\/167088.167097"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/inco.1994.1003","volume":"108","author":"G. Boudol","year":"1994","unstructured":"Boudol, G.: Lambda-calculi for (strict) parallel functions. Information and Computation\u00a0108(1), 51\u2013127 (1994)","journal-title":"Information and Computation"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","author":"O. Bournez","year":"2003","unstructured":"Bournez, O., Hoyrup, M.: Rewriting Logic and Probabilities. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706. Springer, Heidelberg (2003)"},{"key":"2_CR9","unstructured":"Boykin, P., Mor, T., Pulver, M., Roychowdhury, V., Vatan, F.: On universal and fault-taulerant quantum computing, arxiv:quant-ph\/9906054"},{"key":"2_CR10","unstructured":"http:\/\/cime.lri.fr\/"},{"key":"2_CR11","series-title":"formal models and semantics","volume-title":"Handbook of theoretical computer science","author":"N. Dershowitz","year":"1991","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: Handbook of theoretical computer science. formal models and semantics, vol.\u00a0B. MIT press, Cambridge (1991)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D. Deutsch","year":"1992","unstructured":"Deutsch, D., Josza, R.: Rapid solution of problems by quantum computation. Proc. of the Roy. Soc. of London A\u00a0439, 553\u2013558 (1992)","journal-title":"Proc. of the Roy. Soc. of London A"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Dougherty, D.: Adding Algebraic Rewriting to the Untyped Lambda Calculus. In: Proc. of the Fourth International Conference on Rewriting Techniques and Applications (1992)","DOI":"10.1016\/0890-5401(92)90064-M"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(03)00392-X","volume":"309","author":"T. Ehrhard","year":"2003","unstructured":"Ehrhard, T., Regnier, L.: The differential lambda-calculus. Theoretical Computer Science\u00a0309, 1\u201341 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1093\/logcom\/exi008","volume":"15","author":"A. Pierro Di","year":"2005","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Probabilistic \u03bb-calculus and quantitative program analysis. J. of Logic and Computation\u00a015(2), 159\u2013179 (2005)","journal-title":"J. of Logic and Computation"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2_CR17","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L.K. Grover","year":"1997","unstructured":"Grover, L.K.: Quantum Mechanics Helps in Searching for a Needle in a Haystack. Phys. Rev. Lett.\u00a079(2), 325\u2013328 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-46432-8_10","volume-title":"Foundation of Software Science and Computation Structures","author":"O.M. Herescu","year":"2000","unstructured":"Herescu, O.M., Palamidessi, C.: Probabilistic asynchronous pi-calculus. In: Tiuryn, J. (ed.) ETAPS 2000 and FOSSACS 2000. LNCS, vol.\u00a01784, pp. 146\u2013160. Springer, Heidelberg (2000)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Kirchner, H.: Completion of a Set of Rules Modulo a Set of Equations. SIAM J. of Computing\u00a015(14), 1155\u20131194","DOI":"10.1137\/0215084"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.2307\/1968867","volume":"432","author":"M.H.A. Newman","year":"1942","unstructured":"Newman, M.H.A.: On theories with a combinatorial definition of \u201dequivalence\u201d. Annals of Mathematics\u00a0432, 223\u2013243 (1942)","journal-title":"Annals of Mathematics"},{"key":"2_CR21","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1063\/1.1582232","volume":"308","author":"M.A. Nielsen","year":"2003","unstructured":"Nielsen, M.A.: Universal quantum computation using only projective measurement, quantum memory, and preparation of the 0 state. Phys. Rev. A\u00a0308, 96\u2013100 (2003)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"2_CR22","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/322248.322251","volume":"28","author":"G.E. Peterson","year":"1981","unstructured":"Peterson, G.E., Stickel, M.E.: Complete Sets of Reductions for Some Equational Theories. J. ACM\u00a028(2), 233\u2013264 (1981)","journal-title":"J. ACM"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1142\/S0219749905000785","volume":"1","author":"S. Perdrix","year":"2005","unstructured":"Perdrix, S.: State transfer instead of teleportation in measurement-based quantum computation. Int. J. of Quantum Information\u00a01(1), 219\u2013223 (2005)","journal-title":"Int. J. of Quantum Information"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"1299","DOI":"10.1080\/09500340110107487","volume":"49","author":"R. Raussendorf","year":"2002","unstructured":"Raussendorf, R., Browne, D.E., Briegel, H.J.: The one-way quantum computer - a non-network model of quantum computation. Journal of Modern Optics\u00a049, 1299 (2002)","journal-title":"Journal of Modern Optics"},{"issue":"4","key":"2_CR25","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129504004256","volume":"14","author":"P. Selinger","year":"2004","unstructured":"Selinger, P.: Towards a quantum programming language. Math. Struc. in Computer Science\u00a014(4), 527\u2013586 (2004)","journal-title":"Math. Struc. in Computer Science"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129506005238","volume":"16","author":"P. Selinger","year":"2006","unstructured":"Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. Math. Struc. in Computer Science\u00a016(3), 527\u2013552 (2006)","journal-title":"Math. Struc. in Computer Science"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P.W. Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM J. on Computing\u00a026, 1484\u20131509 (1997)","journal-title":"SIAM J. on Computing"},{"key":"2_CR28","unstructured":"Van Tonder, A.: A Lambda Calculus for Quantum Computation, arXiv:quant-ph\/0307150 (July 2003)"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-540-73449-9_28","volume-title":"Term Rewriting and Applications","author":"L. Vaux","year":"2007","unstructured":"Vaux, L.: On linear combinations of lambda-terms. In: Baader, F. (ed.) RTA 2007. LNCS, vol.\u00a04533, pp. 374\u2013388. Springer, Heidelberg (2007)"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W.K. Wooters","year":"1982","unstructured":"Wooters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature\u00a0299, 802\u2013803 (1982)","journal-title":"Nature"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70590-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:08:19Z","timestamp":1605744499000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705888","9783540705901"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}