{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:21:05Z","timestamp":1725484865287},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_85","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:24:41Z","timestamp":1180675481000},"page":"1270-1284","source":"Crossref","is-referenced-by-count":4,"title":["Mode Checking in HAL"],"prefix":"10.1007","author":[{"given":"Mar\u00eda Garc\u00eda","family":"de la Banda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Warwick","family":"Harvey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Marriott","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"85_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/3540543961_21","volume-title":"Proc. of the 5th FPCA","author":"A. Aiken","year":"1991","unstructured":"A. Aiken and B.R. Murphy. Implementing regular tree expressions. In Proc. of the 5th FPCA, LNCS, 427\u2013447. Springer-Verlag, 1991."},{"issue":"3","key":"85_CR2","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"S. K. Debray","year":"1989","unstructured":"S. K. Debray. Static Inference of Modes and Data Dependencies in Logic Programs. ACM Transactions on Programming Languages and Systems, 11(3):418\u2013450, 1989.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"85_CR3","unstructured":"B. Demoen, M. Garc\u00eda de la Banda, W. Harvey, K. Marriott, and P.J. Stuckey. Herbrand constraint solving in HAL. In Proc. of ICLP, 260\u2013274. MIT Press, 1999."},{"key":"85_CR4","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of CP99","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 Proc. of CP99, LNCS. Springer-Verlag, October 1999."},{"key":"85_CR5","unstructured":"B. Demoen, M. Garc\u00eda de la Banda, and P.J. Stuckey. Type constraint solving for parametric and ad-hoc polymorphism. In Proc. of 22nd ACSC, 217\u2013228. Springer-Verlag, 1999."},{"key":"85_CR6","doi-asserted-by":"crossref","unstructured":"T. Fru\u00fcwirth, E. Shapiro, M. Vardi, and E. Yardeni. Logic programs as types for logic programs. In Procs. IEEE Symp. on Logic in Computer Science, 1991.","DOI":"10.1109\/LICS.1991.151654"},{"key":"85_CR7","volume-title":"Tree Automata","author":"F. Gecseg","year":"1984","unstructured":"F. Gecseg and M. Steinby. Tree Automata. Academei Kaido, Budapest, 1984."},{"key":"85_CR8","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0743-1066(92)90032-X","volume":"13","author":"G. Janssens","year":"1993","unstructured":"G. Janssens and M. Bruynooghe. Deriving descriptions of possible value of program variables by means of abstract interpretation. JLP, 13:205\u2013258, 1993.","journal-title":"JLP"},{"key":"85_CR9","doi-asserted-by":"crossref","unstructured":"K. Marriott and P. Stuckey. The 3 R\u2019s of Optimizing Constraint Logic Programs: Refinement, Removal, and Reordering. In Proc. of 19th POPL, 334\u2013344. 1992.","DOI":"10.1145\/158511.158685"},{"key":"85_CR10","doi-asserted-by":"crossref","unstructured":"K. Marriott and P.J. Stuckey. Programming with Constraints: an Introduction. MIT Press, 1998.","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"85_CR11","unstructured":"C.S. Mellish. Abstract Interpretation of Prolog Programs. Abstract Interpretation of Declarative Languages, 181\u2013198, 1987."},{"key":"85_CR12","unstructured":"Z. Somogyi. A system of precise modes for logic programs. In Proc. of 4th ICLP, 769\u2013787, MIT Press, 1987."},{"key":"85_CR13","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. JLP, 29:17\u201364, 1996.","journal-title":"JLP"},{"key":"85_CR14","doi-asserted-by":"crossref","unstructured":"P. Wadler. Theorems for free. In FPCA\u2019 89 Conference on Functional Programming Languages and Computer Architecture, 347\u2013359. ACM, 1989.","DOI":"10.1145\/99370.99404"}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_85","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:23:47Z","timestamp":1556465027000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_85","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}