{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T00:49:31Z","timestamp":1673052571970},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:00:00Z","timestamp":1027641600000},"content-version":"unspecified","delay-in-days":25,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2002,7]]},"abstract":"<jats:p>This paper introduces a framework of parametric descriptive directional types for Constraint \nLogic Programming (CLP). It proposes a method for locating type errors in CLP programs, \nand presents a prototype debugging tool. The main technique used is checking correctness \nof programs w.r.t. type specifications. The approach is based on a generalization of known \nmethods for proving the correctness of logic programs to the case of parametric specifications. \nSet constraint techniques are used for formulating and checking verification conditions for \n(parametric) polymorphic type specifications. The specifications are expressed in a parametric \nextension of the formalism of term grammars. The soundness of the method is proved, and \nthe prototype debugging tool supporting the proposed approach is illustrated on examples. \nThe paper is a substantial extension of the previous work by the same authors concerning \nmonomorphic directional types.<\/jats:p>","DOI":"10.1017\/s1471068402001473","type":"journal-article","created":{"date-parts":[[2002,9,11]],"date-time":"2002-09-11T15:11:14Z","timestamp":1031757074000},"page":"549-610","source":"Crossref","is-referenced-by-count":5,"title":["Using parametric set constraints for locating \nerrors in CLP programs"],"prefix":"10.1017","volume":"2","author":[{"given":"W\u0141ODZIMIERZ","family":"DRABENT","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JAN","family":"MA\u0141USZY\u0143SKI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAWE\u0141","family":"PIETRZAK","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2002,7,26]]},"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068402001473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T18:55:33Z","timestamp":1554058533000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068402001473\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":0,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S1471068402001473"],"URL":"https:\/\/doi.org\/10.1017\/s1471068402001473","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}