{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:44Z","timestamp":1725490244145},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540442332"},{"type":"electronic","value":"9783540457886"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45788-7_3","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:04:02Z","timestamp":1188313442000},"page":"47-66","source":"Crossref","is-referenced-by-count":7,"title":["To the Gates of HAL: A HAL Tutorial"],"prefix":"10.1007","author":[{"given":"Mar\u00eda","family":"Garc\u00eda de la Banda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bart","family":"Demoen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"3_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/3-540-45142-0_6","volume-title":"Procs of LOPSTR2000","author":"F. Bueno","year":"2001","unstructured":"F. Bueno, M. Garcia de la Banda, M. Hermenegildo, K. Marriott, G. Puebla, and P. J. Stuckey. A model for inter-module analysis and optimizing compilation. In Procs of LOPSTR2000, volume 2042 of LNCS, pages 86\u2013102, 2001. 55"},{"key":"3_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/3-540-45635-X_14","volume-title":"Logic Programming: Proceedings of the 17th International Conference","author":"M. Garc\u00eda de la Banda","year":"2001","unstructured":"M. Garc\u00eda de la Banda, D. Jeffery, K. Marriott, P. J. Stuckey, N. Nethercote, and C. Holzbaur. Building constraint solvers with HAL. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 90\u2013104. Springer-Verlag, 2001. 49"},{"key":"3_CR3","unstructured":"B. Demoen, M. Garc\u00eda de la Banda, W. Harvey, K. Marriott, and P. J. Stuckey. Herbrand constraint solving in HAL. In D. De Schreye, editor, Logic Programming: Proceedings of the 16th International Conference, pages 260\u2013274. MIT Press, 1999. 49, 64"},{"key":"3_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-48085-3_13","volume-title":"Proceedings of the Fourth International Conference on Principles and Practices of Constraint Programming","author":"B. Demoen","year":"1999","unstructured":"B. Demoen, M. Garc\u00eda de la Banda, W. Harvey, K. Marriott, and P. J. Stuckey. An overview of HAL. In J. Jaffar, editor, Proceedings of the Fourth International Conference on Principles and Practices of Constraint Programming, LNCS, pages 174\u2013188. Springer-Verlag, October 1999. 49"},{"key":"3_CR5","unstructured":"B. Demoen, M. Garc\u00eda de la Banda, and P. J. Stuckey. Type constraint solving for parametric and ad-hoc polymorphism. In Procs. of the 22nd Australian Comp. Sci. Conf., pages 217\u2013228, 1999. 64"},{"key":"3_CR6","unstructured":"D. Diaz and P. Codognet. A minimal extension of the WAM for clp(fd). In Procs. of ICLP93, pages 774\u2013790, 1993. 47"},{"key":"3_CR7","unstructured":"A. J. Fern\u00e1ndez and B. C. Ruiz Jim\u00e9nez. Una sem\u00e1ntica operacional para CProlog. In Proceedings of II Jornadas de Inform\u00e1tica, pages 21\u201330, 1996. 53"},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fcwirth","year":"1998","unstructured":"T. Fr\u00fcwirth. Theory and practice of constraint handling rules. Journal of Logic Programming, 37:95\u2013138, 1998. 47, 62","journal-title":"Journal of Logic Programming"},{"key":"3_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1007\/3-540-44957-4_85","volume-title":"Proceedings of the First International Conference on Computational Logic","author":"M. Garc\u00eda de la Banda","year":"2000","unstructured":"M. Garc\u00eda de la Banda, P. J. Stuckey, W. Harvey, and K. Marriott. Mode checking in HAL. In J. LLoyd et al., editor, Proceedings of the First International Conference on Computational Logic, LNCS 1861, pages 1270\u20131284. Springer-Verlag, July 2000. 49, 54, 64"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"W. Harvey and P. J. Stuckey. Constraint representation for propagation. In Procs. of PPCP98, pages 235\u2013249, 1998. 64","DOI":"10.1007\/3-540-49481-2_18"},{"key":"3_CR11","unstructured":"M. Hermenegildo, F. Bueno, D. Cabeza, M. Garc\u00eda de la Banda, P. L\u00f3pez, and G. Puebla. The CIAO multi-dialect compiler and system. In Parallelism and Implementation of Logic and Constraint Logic Programming. Nova Science, 1999. 51"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"C. Holzbaur. Metastructures vs. attributed variables in the context of extensible unification. In Procs. of the PLILP92, pages 260\u2013268, 1992. 47","DOI":"10.1007\/3-540-55844-6_141"},{"key":"3_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1007\/3-540-45635-X_13","volume-title":"Logic Programming: Proceedings of the 17th International Conference","author":"C. Holzbaur","year":"2001","unstructured":"C. Holzbaur, P. J. Stuckey, M. Garc\u00eda de la Banda, and D. Jeffery. Optimizing compilation of constraint handling rules. In P. Codognet, editor, Logic Programming: Proceedings of the 17th International Conference, LNCS, pages 74\u201389. Springer-Verlag, 2001. 49, 62"},{"key":"3_CR14","unstructured":"ILOG. CPLEX product page. http:\/\/www.ilog.com\/products\/cplex\/ . 64"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/129393.129398","volume":"4","author":"J. Jaffar","year":"1992","unstructured":"J. Jaffar, S. Michaylov, P. Stuckey, and R. Yap. The CLP(\u211c) language and system. ACM Transactions on Programming Languages and Systems, 4(3):339\u2013395, 1992. 47","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"3_CR16","series-title":"Technical Report","volume-title":"Type classes in Mercury","author":"D. Jeffery","year":"1998","unstructured":"D. Jeffery, F. Henderson, and Z. Somogyi. Type classes in Mercury. Technical Report 98\/13, University of Melbourne, Australia, 1998. 53"},{"key":"3_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/3-540-19027-9_9","volume-title":"ESOP\u201988 Programming Languages and Systems","author":"S. Kaes","year":"1988","unstructured":"S. Kaes. Parametric overloading in polymorphic programming languages. In ESOP\u201988 Programming Languages and Systems, volume 300 of LNCS, pages 131\u2013141, 1988. 53"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"K. Marriott and P. J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998. 49","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"3_CR19","unstructured":"N. Nethercote. The analysis framework for HAL. Master\u2019s thesis, Dept. of Comp. Sci and Soft. Eng, University of Melbourne, 2002. 64"},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Z. Somogyi, F. Henderson, and T. Conway. The execution algorithm of Mercury: an efficient purely declarative logic programming language. Journal of Logic Programming, 29:17\u201364, 1996. 49","journal-title":"Journal of Logic Programming"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"P. Wadler and S. Blott. How to make ad-hoc polymorphism less ad-hoc. In Proc. 16th ACM POPL, pages 60\u201376, 1989. 53","DOI":"10.1145\/75277.75283"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45788-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:11:13Z","timestamp":1556817073000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45788-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540442332","9783540457886"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45788-7_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}