{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:09:50Z","timestamp":1725574190709},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540653844"},{"type":"electronic","value":"9783540493822"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-3-540-49382-2_4","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T23:37:34Z","timestamp":1294443454000},"page":"30-41","source":"Crossref","is-referenced-by-count":0,"title":["Deadlock Sensitive Types for Lambda Calculus with Resources"],"prefix":"10.1007","author":[{"given":"Carolina","family":"Lavatelli","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Abramsky, S., Ong, L.: Full Abstraction in the lazy lambda calculus. Information and Computation\u00a0105(2) (1993)","DOI":"10.1006\/inco.1993.1044"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Boudol, G.: The lambda calculus with multiplicities. Rapport de Recherche 2025, INRIA Sophia-Antipolis (1993)","DOI":"10.1007\/3-540-57208-2_1"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Computing Science - ASIAN\u201997","author":"G. Boudol","year":"1997","unstructured":"Boudol, G.: Typing the use of resources in a Concurrent Calculus. In: Shyamasundar, R.K. (ed.) ASIAN 1997. LNCS, vol.\u00a01345, Springer, Heidelberg (1997)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Boudol, G., Laneve, C.: The discriminating power of multiplicities in the \u03bb-calculus. Information and Computation\u00a0126(1) (1996)","DOI":"10.1006\/inco.1996.0037"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Boudol, G., Laneve, C.: Termination, deadlock and divergence in the \u03bb-calculus with multiplicities. In: Proc. 11th Mathematical Foundations of Programming Semantics Conference. Electronic Notes in Computer Science (1995)","DOI":"10.1016\/S1571-0661(04)00003-9"},{"key":"4_CR6","unstructured":"Boudol, G., Laneve, C.: \u03bb-Calculus, Multiplicities and the \u03c0-Calculus. Rapport de Recherche 2581, INRIA Sophia-Antipolis (1995)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Boudol, G., Lavatelli, C.: Full Abstraction for lambda-calculus with resources and convergence testing. In: Kirchner, H. (ed.) CAAP 1996. LNCS, vol.\u00a01059. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-61064-2_45"},{"key":"4_CR8","unstructured":"Kobayashi, N.: A partially deadlock-free types process calculus. In: Proceedings of LICS 1997 (1997)"},{"key":"4_CR9","unstructured":"Lavatelli, C.: S\u00e9mantique du Lambda Calcul avec Ressources. Th\u00e8se de Doctorat. Universit\u00e9 Paris VII, France (1996)"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Lavatelli, C.: Algebraic Interpretation of the Lambda Calculus with Resources. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol.\u00a01119. Springer, Heidelberg (1996)","DOI":"10.1007\/3-540-61604-7_68"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"L\u00e9vy, J.-J.: An algebraic interpretation of the \u03bb\u03b2K-calculus; and an application of a labeled \u03bb-calculus. Theoretical Computer Science\u00a02(1) (1976)","DOI":"10.1016\/0304-3975(76)90009-8"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Longo, G.: Set Theoretical Models of Lambda Calculus: Theories, expansions and isomorphisms. Annals of Pure and Applied Logic\u00a024 (1983)","DOI":"10.1016\/0168-0072(83)90030-1"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Parts I and II. Information and Computation\u00a0100(1) (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Milner, R.: Functions as Processes. Mathematical Structures in Computer Science\u00a02 (1992)","DOI":"10.1017\/S0960129500001407"},{"key":"4_CR15","volume-title":"Proceedings of the 29th Conference on Foundations of Computer Science","author":"C.-H. Luke Ong","year":"1988","unstructured":"Luke Ong, C.-H.: Fully Abstract Models of the Lazy Lambda Calculus. In: Proceedings of the 29th Conference on Foundations of Computer Science. The Computer Science Press, Rockville (1988)"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D.: The Lazy Lambda Calculus in a Concurrency Scenario. Information and Computation\u00a0120(1) (1994)","DOI":"10.1006\/inco.1994.1042"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-49382-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T22:07:03Z","timestamp":1637100423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-49382-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540653844","9783540493822"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-49382-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}