{"id":"https://openalex.org/W2033405134","doi":"https://doi.org/10.1017/s1471068401001120","title":"Typing constraint logic programs","display_name":"Typing constraint logic programs","publication_year":2001,"publication_date":"2001-11-01","ids":{"openalex":"https://openalex.org/W2033405134","doi":"https://doi.org/10.1017/s1471068401001120","mag":"2033405134"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068401001120","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068401001120","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000983836","display_name":"Fran\u00e7ois Fages","orcid":"https://orcid.org/0000-0001-5650-8266"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"FRAN\u00c7OIS FAGES","raw_affiliation_strings":["Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail:","Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail: francois.fages@inria.fr, emmanuel.coquery@inria.fr)#TAB#"],"affiliations":[{"raw_affiliation_string":"Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail:","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail: francois.fages@inria.fr, emmanuel.coquery@inria.fr)#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075564092","display_name":"Emmanuel Coquery","orcid":"https://orcid.org/0000-0001-7015-5604"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"EMMANUEL COQUERY","raw_affiliation_strings":["Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail:","Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail: francois.fages@inria.fr, emmanuel.coquery@inria.fr)#TAB#"],"affiliations":[{"raw_affiliation_string":"Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail:","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Projet Contraintes, INRIA-Rocquencourt, BP105, 78153 Le Chesnay Cedex, France, (e-mail: francois.fages@inria.fr, emmanuel.coquery@inria.fr)#TAB#","institution_ids":["https://openalex.org/I1326498283"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000983836"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":3.6904,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.93089046,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"1","issue":"6","first_page":"751","last_page":"777"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9853000044822693,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.8100804090499878},{"id":"https://openalex.org/keywords/type-inference","display_name":"Type inference","score":0.8001160621643066},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7897906303405762},{"id":"https://openalex.org/keywords/subtyping","display_name":"Subtyping","score":0.7347675561904907},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.7149804830551147},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.6804794073104858},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.6761431097984314},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.603847861289978},{"id":"https://openalex.org/keywords/concurrent-constraint-logic-programming","display_name":"Concurrent constraint logic programming","score":0.5523701906204224},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49084264039993286},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3828156292438507},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.34383559226989746},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.3373463749885559},{"id":"https://openalex.org/keywords/programming-paradigm","display_name":"Programming paradigm","score":0.3060482144355774},{"id":"https://openalex.org/keywords/functional-logic-programming","display_name":"Functional logic programming","score":0.29553496837615967},{"id":"https://openalex.org/keywords/inductive-programming","display_name":"Inductive programming","score":0.25209444761276245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13320717215538025},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1137615442276001}],"concepts":[{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.8100804090499878},{"id":"https://openalex.org/C198370458","wikidata":"https://www.wikidata.org/wiki/Q586459","display_name":"Type inference","level":3,"score":0.8001160621643066},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7897906303405762},{"id":"https://openalex.org/C83852419","wikidata":"https://www.wikidata.org/wiki/Q2713292","display_name":"Subtyping","level":2,"score":0.7347675561904907},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.7149804830551147},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.6804794073104858},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.6761431097984314},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.603847861289978},{"id":"https://openalex.org/C204306468","wikidata":"https://www.wikidata.org/wiki/Q5159106","display_name":"Concurrent constraint logic programming","level":5,"score":0.5523701906204224},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49084264039993286},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3828156292438507},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.34383559226989746},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.3373463749885559},{"id":"https://openalex.org/C34165917","wikidata":"https://www.wikidata.org/wiki/Q188267","display_name":"Programming paradigm","level":2,"score":0.3060482144355774},{"id":"https://openalex.org/C96315309","wikidata":"https://www.wikidata.org/wiki/Q5508829","display_name":"Functional logic programming","level":4,"score":0.29553496837615967},{"id":"https://openalex.org/C50033165","wikidata":"https://www.wikidata.org/wiki/Q15712089","display_name":"Inductive programming","level":3,"score":0.25209444761276245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13320717215538025},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1137615442276001},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068401001120","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068401001120","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W14971117","https://openalex.org/W60619409","https://openalex.org/W68738721","https://openalex.org/W136042709","https://openalex.org/W137633024","https://openalex.org/W152230367","https://openalex.org/W1504949952","https://openalex.org/W1539226363","https://openalex.org/W1569918838","https://openalex.org/W1575633021","https://openalex.org/W1579672261","https://openalex.org/W1606504862","https://openalex.org/W1616475887","https://openalex.org/W1703087989","https://openalex.org/W1721979108","https://openalex.org/W1982243747","https://openalex.org/W2035182234","https://openalex.org/W2038037493","https://openalex.org/W2057219663","https://openalex.org/W2090430576","https://openalex.org/W2091776887","https://openalex.org/W2093036100","https://openalex.org/W2123396057","https://openalex.org/W2123727486","https://openalex.org/W2125357395","https://openalex.org/W2293278021","https://openalex.org/W2403892066"],"related_works":["https://openalex.org/W1531664660","https://openalex.org/W1980681296","https://openalex.org/W1486916474","https://openalex.org/W2097415053","https://openalex.org/W1548409801","https://openalex.org/W200657494","https://openalex.org/W1514298554","https://openalex.org/W1496100162","https://openalex.org/W2495969191","https://openalex.org/W1567852657"],"abstract_inverted_index":{"We":[0,124,137],"present":[1],"a":[2,29,70,79,88],"prescriptive":[3,71],"type":[4,19,30,72,120,132,135,143],"system":[5,20,73,130],"with":[6,119],"parametric":[7],"polymorphism":[8],"and":[9,36,50,113,134,152],"subtyping":[10],"for":[11,32,122,131],"constraint":[12,33,48,104],"logic":[13,34],"programs.":[14,155],"The":[15,61],"aim":[16],"of":[17,42,51,59,63,69,103,110,128,149],"this":[18],"is":[21,81,96],"to":[22,56],"detect":[23],"programming":[24,105],"errors":[25],"statically.":[26],"It":[27],"introduces":[28],"discipline":[31],"programs":[35],"modules,":[37],"while":[38],"maintaining":[39],"the":[40,44,57,67,75,99,129,146],"capabilities":[41],"performing":[43],"usual":[45],"coercions":[46],"between":[47],"domains,":[49],"typing":[52],"meta-programming":[53],"predicates,":[54],"thanks":[55],"exibility":[58],"subtyping.":[60],"property":[62,95],"subject":[64],"reduction":[65],"expresses":[66],"consistency":[68],"w.r.t.":[74,98,114],"execution":[76,101,117],"model:":[77],"if":[78],"program":[80],"\u2018well-typed\u2019,":[82],"then":[83],"all":[84],"derivations":[85],"starting":[86],"from":[87],"\u2018well-typed\u2019":[89],"goal":[90],"are":[91],"again":[92],"\u2018well-typed\u2019.":[93],"That":[94],"proved":[97],"abstract":[100],"model":[102,118],"which":[106],"proceeds":[107],"by":[108],"accumulation":[109],"constraints":[111,121],"only,":[112],"an":[115],"enriched":[116],"substitutions.":[123],"describe":[125],"our":[126,139],"implementation":[127],"checking":[133,144],"inference.":[136],"report":[138],"experimental":[140],"results":[141],"on":[142],"ISO-Prolog,":[145],"(constraint)":[147],"libraries":[148],"Sicstus":[150],"Prolog":[151,154],"other":[153]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}