{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:39:59Z","timestamp":1750307999455,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,7,10]],"date-time":"2006-07-10T00:00:00Z","timestamp":1152489600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,10]]},"DOI":"10.1145\/1140335.1140357","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"179-188","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Collection analysis for Horn clause programs"],"prefix":"10.1145","author":[{"given":"Dale","family":"Miller","sequence":"first","affiliation":[{"name":"INRIA & LIX, Palaiseau, France"}]}],"member":"320","published-online":{"date-parts":[[2006,7,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"171","volume-title":"PPCP94: Principles and Practice of Constraint Programming, number 874 in LNCS","author":"Aiken A.","year":"1994","unstructured":"A. Aiken . Set constraints: results, applications, and future directions . In PPCP94: Principles and Practice of Constraint Programming, number 874 in LNCS , pages 171 -- 179 , 1994 . A. Aiken. Set constraints: results, applications, and future directions. In PPCP94: Principles and Practice of Constraint Programming, number 874 in LNCS, pages 171--179, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037173"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/2.3.297"},{"key":"e_1_3_2_1_4_1","volume-title":"Eighth International Logic Programming Conference","author":"Brisset P.","year":"1991","unstructured":"P. Brisset and O. Ridoux . Na\u00efve reverse can be linear . In Eighth International Logic Programming Conference , Paris, France , June 1991 . MIT Press. P. Brisset and O. Ridoux. Na\u00efve reverse can be linear. In Eighth International Logic Programming Conference, Paris, France, June 1991. MIT Press."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/794199.795111"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/788018.788831"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.2307\/2266170"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_2_1_9_1","first-page":"244","article-title":"Decidability issues for petri nets - a survey","volume":"52","author":"Esparza J.","year":"1994","unstructured":"J. Esparza and M. Nielsen . Decidability issues for petri nets - a survey . Bulletin of the EATCS , 52 : 244 -- 262 , 1994 . J. Esparza and M. Nielsen. Decidability issues for petri nets - a survey. Bulletin of the EATCS, 52:244--262, 1994.","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(87)90045-4"},{"key":"e_1_3_2_1_11_1","volume-title":"February","author":"Girard J.-Y.","year":"1992","unstructured":"J.-Y. Girard . A fixpoint theorem in linear logic. An email posting to the mailing list linear@cs.stanford.edu , February 1992 . J.-Y. Girard. A fixpoint theorem in linear logic. An email posting to the mailing list linear@cs.stanford.edu, February 1992."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1017\/S096012950100336X"},{"key":"e_1_3_2_1_13_1","volume-title":"Proofs and Types","author":"Girard J.-Y.","year":"1989","unstructured":"J.-Y. Girard , P. Taylor , and Y. Lafont . Proofs and Types . Cambridge University Press , 1989 . J.-Y. Girard, P. Taylor, and Y. Lafont. Proofs and Types. Cambridge University Press, 1989."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.006"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1036"},{"key":"e_1_3_2_1_16_1","first-page":"279","article-title":"Asynchronous communication model based on linear logic","volume":"3","author":"Kobayashi N.","year":"1994","unstructured":"N. Kobayashi and A. Yonezawa . Asynchronous communication model based on linear logic . Formal Aspects of Computing , 3 : 279 -- 294 , 1994 . N. Kobayashi and A. Yonezawa. Asynchronous communication model based on linear logic. Formal Aspects of Computing, 3:279--294, 1994.","journal-title":"Formal Aspects of Computing"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00171-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647886.736329"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(96)00045-X"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of AMAST","author":"Miller D.","year":"2002","unstructured":"D. Miller . Higher-order quantification and proof search. In H. Kirchner and C. Ringeissen, editors , Proceedings of AMAST 2002 , number 2422 in LNCS, pages 60--74, 2002. D. Miller. Higher-order quantification and proof search. In H. Kirchner and C. Ringeissen, editors, Proceedings of AMAST 2002, number 2422 in LNCS, pages 60--74, 2002."},{"key":"e_1_3_2_1_21_1","first-page":"3","volume-title":"Proceedings of FCS'03: Foundations of Computer Security","author":"Miller D.","year":"2003","unstructured":"D. Miller . Encryption as an abstract data-type: An extended abstract. In I. Cervesato, editor , Proceedings of FCS'03: Foundations of Computer Security , pages 3 -- 14 , 2003 . D. Miller. Encryption as an abstract data-type: An extended abstract. In I. Cervesato, editor, Proceedings of FCS'03: Foundations of Computer Security, pages 3--14, 2003."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(91)90068-W"},{"key":"e_1_3_2_1_23_1","first-page":"810","volume-title":"Fifth International Logic Programming Conference","author":"Nadathur G.","year":"1988","unstructured":"G. Nadathur and D. Miller . An Overview of \u03bbProlog . In Fifth International Logic Programming Conference , pages 810 -- 827 , Seattle , August 1988 . MIT Press. G. Nadathur and D. Miller. An Overview of \u03bbProlog. In Fifth International Logic Programming Conference, pages 810--827, Seattle, August 1988. MIT Press."},{"key":"e_1_3_2_1_24_1","first-page":"245","volume-title":"Types in Logic Programming","author":"Nadathur G.","year":"1992","unstructured":"G. Nadathur and F. Pfenning . The type system of a higher-order logic programming language . In F. Pfenning, editor, Types in Logic Programming , pages 245 -- 283 . MIT Press , 1992 . G. Nadathur and F. Pfenning. The type system of a higher-order logic programming language. In F. Pfenning, editor, Types in Logic Programming, pages 245--283. MIT Press, 1992."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/BFb0017466","volume-title":"Principles and Practice of Constraint Programming - CP97, number 1330 in LNCS","author":"Pacholski L.","year":"1997","unstructured":"L. Pacholski and A. Podelski . Set constraints: A pearl in research on constraints . In Principles and Practice of Constraint Programming - CP97, number 1330 in LNCS , pages 549 -- 562 . Springer , 1997 . L. Pacholski and A. Podelski. Set constraints: A pearl in research on constraints. In Principles and Practice of Constraint Programming - CP97, number 1330 in LNCS, pages 549--562. Springer, 1997."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1993.287585"}],"event":{"name":"PPDP06: Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"],"location":"Venice Italy","acronym":"PPDP06"},"container-title":["Proceedings of the 8th ACM SIGPLAN international conference on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140335.1140357","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1140335.1140357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:24Z","timestamp":1750259184000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1140335.1140357"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,10]]},"references-count":26,"alternative-id":["10.1145\/1140335.1140357","10.1145\/1140335"],"URL":"https:\/\/doi.org\/10.1145\/1140335.1140357","relation":{},"subject":[],"published":{"date-parts":[[2006,7,10]]},"assertion":[{"value":"2006-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}