{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:29:08Z","timestamp":1759638548064},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326202"},{"type":"electronic","value":"9783642326219"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32621-9_16","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T10:40:40Z","timestamp":1345286440000},"page":"216-231","source":"Crossref","is-referenced-by-count":9,"title":["Linearity in the Non-deterministic Call-by-Value Setting"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"D\u00edaz-Caro","sequence":"first","affiliation":[]},{"given":"Barbara","family":"Petit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"16_CR1","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"},{"issue":"7","key":"16_CR2","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1016\/j.apal.2011.09.008","volume":"163","author":"A. Bucciarelli","year":"2012","unstructured":"Bucciarelli, A., Ehrhard, T., Manzonetto, G.: A relational semantics for parallelism and non-determinism in a functional setting. Annals of Pure and Applied Logic\u00a0163(7), 918\u2013934 (2012)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1-2","key":"16_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0304-3975(96)80703-1","volume":"170","author":"M. Dezani-Ciancaglini","year":"1996","unstructured":"Dezani-Ciancaglini, M., de\u2019Liguoro, U., Piperno, A.: Filter models for conjunctive-disjunctive lambda-calculi. Theoretical Computer Science\u00a0170(1-2), 83\u2013128 (1996)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"16_CR4","doi-asserted-by":"publisher","first-page":"1376","DOI":"10.1137\/S0097539794275860","volume":"27","author":"M. Dezani-Ciancaglini","year":"1998","unstructured":"Dezani-Ciancaglini, M., de\u2019Liguoro, U., Piperno, A.: A filter model for concurrent lambda-calculus. SIAM Journal on Computing\u00a027(5), 1376\u20131419 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-70590-1_2","volume-title":"Rewriting Techniques and Applications","author":"P. Arrighi","year":"2008","unstructured":"Arrighi, P., Dowek, G.: Linear-algebraic Lambda-calculus: Higher-order, Encodings, and Confluence. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 17\u201331. Springer, Heidelberg (2008)"},{"issue":"5","key":"16_CR6","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.1017\/S0960129509990089","volume":"19","author":"L. Vaux","year":"2009","unstructured":"Vaux, L.: The algebraic lambda calculus. Mathematical Structures in Computer Science\u00a019(5), 1029\u20131059 (2009)","journal-title":"Mathematical Structures in Computer Science"},{"unstructured":"Assaf, A., Perdrix, S.: Completeness of algebraic cps simulations. In: Proceedings of the 7th International Workshop on Developments of Computational Models (DCM 2011), Zurich, Switzerland (2011), http:\/\/www.pps.univ-paris-diderot.fr\/~jkrivine\/conferences\/DCM2011\/DCM_2011.html","key":"16_CR7"},{"unstructured":"D\u00edaz-Caro, A., Perdrix, S., Tasson, C., Valiron, B.: Equivalence of algebraic \u03bb-calculi. In: Informal Proceedings of the 5th International Workshop on Higher-Order Rewriting, HOR 2010, Edinburgh, UK, pp. 6\u201311 (July 2010)","key":"16_CR8"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1137\/0209005","volume":"9","author":"M. Hennessy","year":"1980","unstructured":"Hennessy, M.: The semantics of call-by-value and call-by-name in a nondeterministic environment. SIAM Journal on Computing\u00a09(1), 67\u201384 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"16_CR10","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 Compututer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Compututer Science"},{"unstructured":"Cosmo, R.D.: Isomorphisms of Types: From Lambda-Calculus to Information Retrieval and Language Design. Progress in Theoretical Computer Science. Birkh\u00e4user (1995)","key":"16_CR11"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"W.K. Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature\u00a0299, 802\u2013803 (1982)","journal-title":"Nature"},{"issue":"25","key":"16_CR13","doi-asserted-by":"publisher","first-page":"4714","DOI":"10.1103\/PhysRevLett.75.4714","volume":"75","author":"C. Monroe","year":"1995","unstructured":"Monroe, C., Meekhof, D.M., King, B.E., Itano, W.M., Wineland, D.J.: Demonstration of a fundamental quantum logic gate. Physical Review Letters\u00a075(25), 4714\u20134717 (1995)","journal-title":"Physical Review Letters"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the \u03bb-calculus. Theoretical Computer Science\u00a01(2), 125\u2013159 (1975)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/0215084","volume":"15","author":"J.P. Jouannaud","year":"1986","unstructured":"Jouannaud, J.P., Kirchner, H.: Completion of a set of rules modulo a set of equations. SIAM Journal on Computing\u00a015(4), 1155\u20131194 (1986)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Barendregt, H.P.: The lambda calculus: its syntax and semantics. Studies in Logic and the Foundations of Mathematics, vol.\u00a0103. Elsevier (1984)","key":"16_CR16"},{"doi-asserted-by":"crossref","unstructured":"D\u00edaz-Caro, A., Dowek, G.: Non determinism through type isomorphism. Draft (April 2012), http:\/\/diaz-caro.info\/ndti.pdf","key":"16_CR17","DOI":"10.4204\/EPTCS.113.13"},{"doi-asserted-by":"crossref","unstructured":"Barendregt, H.P.: Lambda calculi with types. In: Handbook of Logic in Computer Science, vol.\u00a02. Oxford University Press (1992)","key":"16_CR18","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"unstructured":"Girard, J.Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge University Press (1989)","key":"16_CR19"},{"unstructured":"Krivine, J.L.: Lambda-calcul: types et mod\u00e8les. \u00c9tudes et recherches en informatique, Masson (1990)","key":"16_CR20"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32621-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T14:03:18Z","timestamp":1714312998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32621-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326202","9783642326219"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32621-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}