{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:37:14Z","timestamp":1728175034597},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540770497"},{"type":"electronic","value":"9783540770503"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77050-3_45","type":"book-chapter","created":{"date-parts":[[2007,11,26]],"date-time":"2007-11-26T08:39:22Z","timestamp":1196066362000},"page":"544-556","source":"Crossref","is-referenced-by-count":2,"title":["Closures and Modules Within Linear Logic Concurrent Constraint Programming"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Haemmerl\u00e9","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Fages","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Soliman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF03037173","volume":"9","author":"J.-M. Andreoli","year":"1991","unstructured":"Andreoli, J.-M., Pareschi, R.: Linear objects: Logical processes with built-in inheritance. New Generation Computing\u00a09, 445\u2013473 (1991)","journal-title":"New Generation Computing"},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of Coordination","author":"E. Best","year":"1997","unstructured":"Best, E., de Boer, F.S., Palamidessi, C.: Concurrent constraint programming with information removal. In: Proceedings of Coordination. LNCS, Springer, Heidelberg (1997)"},{"key":"45_CR3","unstructured":"Diaz, D.: GNU Prolog user\u2019s manual (1999\u20132003)"},{"key":"45_CR4","unstructured":"Duchier, D., Kornstaedt, L., Schulte, C., Smolka, G.: A higher-order module discipline with separate compilation, dynamic linking, and pickling. draft (1998)"},{"key":"45_CR5","volume-title":"Prolog: The Standard","author":"P.D.A. Ed-Dbali","year":"1996","unstructured":"Ed-Dbali, P.D.A., Cervoni, L.: Prolog: The Standard. Springer, Heidelberg (1996)"},{"issue":"1","key":"45_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1006\/inco.2000.3002","volume":"165","author":"F. Fages","year":"2001","unstructured":"Fages, F., Ruet, P., Soliman, S.: Linear concurrent constraint programming: operational and phase semantics. Infor. and Comput.\u00a0165(1), 14\u201341 (2001)","journal-title":"Infor. and Comput."},{"issue":"1-3","key":"45_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of constraint handling rules. Journal of Logic Programming\u00a037(1-3), 95\u2013138 (1998)","journal-title":"Journal of Logic Programming"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050(1) (1987)","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/11562931_50","volume-title":"Logic Programming","author":"R. Haemmerl\u00e9","year":"2005","unstructured":"Haemmerl\u00e9, R.: SiLCC is linear concurrent constraint programming (doctoral consortium). In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 448\u2013449. Springer, Heidelberg (2005)"},{"key":"45_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/11799573_6","volume-title":"Logic Programming","author":"R. Haemmerl\u00e9","year":"2006","unstructured":"Haemmerl\u00e9, R., Fages, F.: Modules for Prolog revisited. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 41\u201355. Springer, Heidelberg (2006)"},{"issue":"5","key":"45_CR11","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1093\/logcom\/1.5.635","volume":"1","author":"L. Halln\u00e4s","year":"1991","unstructured":"Halln\u00e4s, L.: A proof-theoretic approach to logic programming. ii. programs as definitions. Journal of Logic and Computation\u00a01(5), 635\u2013660 (1991)","journal-title":"Journal of Logic and Computation"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Harland, J., Pym, D.J., Winikoff, M.: Programming in lygon: An overview. In: Proceedings of the Fifth International Conference on Algebraic Methodology and Software Technology, Munich, pp. 391\u2013405 (July 1996)","DOI":"10.1007\/BFb0014329"},{"issue":"2","key":"45_CR13","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1994.1036","volume":"110","author":"J.S. Hodas","year":"1994","unstructured":"Hodas, J.S., Miller, D.: Logic programming in a fragment of intuitionistic linear logic. Information and Computation\u00a0110(2), 327\u2013365 (1994)","journal-title":"Information and Computation"},{"key":"45_CR14","unstructured":"Holzbaur, C.: Metastructures vs. attributed variables in the context of extensible unification. TR-92-23, \u00d6sterreichisches Forschungsinstitut f\u00fcr AI, Wien (1992)"},{"issue":"3","key":"45_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S0956796800003683","volume":"10","author":"X. Leroy","year":"2000","unstructured":"Leroy, X.: A modular module system. J. of Func. Prog.\u00a010(3), 269\u2013303 (2000)","journal-title":"J. of Func. Prog."},{"key":"45_CR16","first-page":"59","volume-title":"Proc. of the 21th Annual IEEE Symposium on Logic In Computer Science","author":"C. Palamidessi","year":"2006","unstructured":"Palamidessi, C., Saraswat, V.A., Valencia, F.D., Victor, B.: On the expressiveness of linearity vs persistence in the asychronous pi-calculus. In: Proc. of the 21th Annual IEEE Symposium on Logic In Computer Science, pp. 59\u201368. IEEE Computer Society Press, Los Alamitos (2006)"},{"issue":"6","key":"45_CR17","first-page":"715","volume":"3","author":"P.V. Roy","year":"2003","unstructured":"Roy, P.V., et al.: Logic programming in the context of multiparadigm programming: the Oz experience. TPLP\u00a03(6), 715\u2013763 (2003)","journal-title":"TPLP"},{"key":"45_CR18","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2086.001.0001","volume-title":"Concurrent constraint programming","author":"V.A. Saraswat","year":"1993","unstructured":"Saraswat, V.A.: Concurrent constraint programming. ACM Doctoral Dissertation Awards. MIT Press, Cambridge (1993)"},{"key":"45_CR19","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF00297245","volume":"44","author":"M.E. Stickel","year":"1988","unstructured":"Stickel, M.E.: A prolog technology theorem prover: implementation by an extended prolog compiler. Journal of Automated Reasoning\u00a044, 353\u2013380 (1988)","journal-title":"Journal of Automated Reasoning"}],"container-title":["Lecture Notes in Computer Science","FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77050-3_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:08:48Z","timestamp":1606183728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77050-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540770497","9783540770503"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77050-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}