{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:58Z","timestamp":1725664498257},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540616047"},{"type":"electronic","value":"9783540706250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61604-7_68","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:03:01Z","timestamp":1330293781000},"page":"422-437","source":"Crossref","is-referenced-by-count":1,"title":["Algebraic interpretation of lambda calculus with resources"],"prefix":"10.1007","author":[{"given":"Carolina","family":"Lavatelli","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Cardelli, P.-L. Curien, J.-J. L\u00e9vy. Explicit Substitutions. Journal of Functional Programming, 1. 1991.","DOI":"10.1017\/S0956796800000186"},{"key":"25_CR2","unstructured":"S. Abramsky. The Lazy Lambda Calculus. In D. Turner, editor, Research Topics in Functional Programming. Addison Wesley. 1989."},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"S. Abramsky, L. Ong. Full Abstraction in the lazy lambda calculus. Information and Computation, 105(2). 1993.","DOI":"10.1006\/inco.1993.1044"},{"key":"25_CR4","unstructured":"H.P. Barendregt. The Lambda Calculus. North-Holland. 1985."},{"key":"25_CR5","volume-title":"Technical Report 1231","author":"G. Boudol","year":"1990","unstructured":"G. Boudol. A Lambda-Calculus for Parallel Functions. Technical Report 1231, INRIA Sophia-Antipolis. 1990."},{"key":"25_CR6","volume-title":"Technical Report 2025","author":"G. Boudol","year":"1993","unstructured":"G. Boudol. The lambda calculus with multiplicities. Technical Report 2025, INRIA Sophia-Antipolis. 1993."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"G. Boudol. Lambda-calculi for (strict) parallel functions. Information and Computation, 108(1). 1994.","DOI":"10.1006\/inco.1994.1003"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"G. Boudol, C. Laneve. The discriminating power of multiplicities in the \u03bb-calculus. Information and Computation 126 (1). 1996.","DOI":"10.1006\/inco.1996.0037"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"G. Boudol, C. Laneve. Termination, deadlock and divergence in the \u03bb-calculus with multiplicities. Proceedings of the 11th Conference on the Mathematical Foundations of Programming Semantics, Electronic Notes in Computer Science 1. 1995.","DOI":"10.1016\/S1571-0661(04)00003-9"},{"key":"25_CR10","volume-title":"Technical Report 2581","author":"G. Boudol","year":"1995","unstructured":"G. Boudol, C. Laneve. \u03bb-calculus, Multiplicities and the \u03c0-calculus. Technical Report 2581, INRIA Sophia-Antipolis. 1995."},{"key":"25_CR11","volume-title":"LNCS 1059","author":"G. Boudol","year":"1996","unstructured":"G. Boudol, C. Lavatelli. Full Abstraction for Lambda Calculus with Resources and Convergence Testing. CAAP'96. LNCS 1059, Springer-Verlag, Berlin. 1996."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"P.-L. Curien, T.Hardin, J.-J. L\u00e9vy. Confluence Properties of Weak and Strong Calculi of Explicit Substitutions. Journal of ACM 43(2). 1996.","DOI":"10.1145\/226643.226675"},{"key":"25_CR13","volume-title":"TACS'94. LNCS 789","author":"M. Dezani-Ciancaglini","year":"1994","unstructured":"M. Dezani-Ciancaglini, U. de Liguoro, A. Piperno. Fully Abstract Semantics for Concurrent \u03bb-calculus. TACS'94. LNCS 789, Springer-Verlag, Berlin. 1994."},{"key":"25_CR14","unstructured":"M. Dezani-Ciancaglini, U. de Liguoro, A. Piperno. Filter Models for Conjunctive-Disjunctive \u03bb-calculi. To appear in TCS."},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"J.M.E. Hyland. A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus. Journal of the London Mathematical Society 12. 1976.","DOI":"10.1112\/jlms\/s2-12.3.361"},{"key":"25_CR16","unstructured":"C. Lavatelli. Non-deterministic lazy \u03bb-calculus vs. \u03c0-calculus. Technical Report LIENS 93-1. 1993."},{"key":"25_CR17","volume-title":"PhD. Thesis","author":"C. Lavatelli","year":"1996","unstructured":"C. Lavatelli. S\u00e9mantique du lambda-calcul avec ressources. PhD. Thesis. Universit\u00e9 Paris 7. France. Janvier 1996."},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"J.-J. L\u00e9vy. An algebraic interpretation of the \u03bb\u0392K-calculus; and an application of a labelled \u03bb-calculus. Theoretical Computer Science, 2(1). 1976.","DOI":"10.1016\/0304-3975(76)90009-8"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"G. Longo. Set Theoretical Models of Lambda Calculus: Theories, expansions and isomorphisms. Annals of Pure and Applied Logic, 24. 1983.","DOI":"10.1016\/0168-0072(83)90030-1"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"R. Milner, J. Parrow, D. Walker. A Calculus of Mobile Processes, Parts I and II. Information and Computation, 100(1). 1992.","DOI":"10.1016\/0890-5401(92)90009-5"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"R. Milner. Functions as Processes. Mathematical Structures in Computer Science, 2. 1992.","DOI":"10.1017\/S0960129500001407"},{"key":"25_CR22","unstructured":"C.-H. Luke Ong. The Lazy Lambda Calculus\/ An Investigation into the Foundations of Functional Programming. PhD Thesis, Imperial College. 1988."},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"G. Plotkin. LCF Considered as a Programming Language. Theoretical Computer Science, 5. 1975.","DOI":"10.1016\/0304-3975(77)90044-5"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"C. Wadsworth. The relation between computational and denotational properties for Scott D\u221e-model of the lambda-calculus. SIAM Journal on Computing, 5. 1976.","DOI":"10.1137\/0205036"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"C. Wadsworth. Approximate Reduction and Lambda-Calculus Models. SIAM Journal on Computing, 7. 1978.","DOI":"10.1137\/0207028"}],"container-title":["Lecture Notes in Computer Science","CONCUR '96: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61604-7_68.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T10:49:36Z","timestamp":1640947776000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61604-7_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540616047","9783540706250"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/3-540-61604-7_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}