{"id":"https://openalex.org/W1530237295","doi":"https://doi.org/10.7551/mitpress/4298.003.0059","title":"Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance","display_name":"Ensuring Global Termination of Partial Deduction While Allowing Flexible Polyvariance","publication_year":1995,"publication_date":"1995-06-16","ids":{"openalex":"https://openalex.org/W1530237295","doi":"https://doi.org/10.7551/mitpress/4298.003.0059","mag":"1530237295"},"language":"en","primary_location":{"id":"doi:10.7551/mitpress/4298.003.0059","doi":"https://doi.org/10.7551/mitpress/4298.003.0059","is_oa":false,"landing_page_url":"https://doi.org/10.7551/mitpress/4298.003.0059","pdf_url":null,"source":{"id":"https://openalex.org/S4306463997","display_name":"The MIT Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Programming","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4233185143","display_name":"Logic Programming"},"type":"book-chapter","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/retrieve/6ac4e0e8-053f-4982-a67e-f247ff2883e4","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5113466437","display_name":"Bern Martens","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]},{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE","GB"],"is_corresponding":false,"raw_author_name":"Bern Martens","raw_affiliation_strings":["Department of Computer Science University of Bristol Queen's Building University Walk Bristol BS8 1TR U.K","Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium,","University of Bristol by the European Community Human Capital and Mobility Network LPST"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Bristol Queen's Building University Walk Bristol BS8 1TR U.K","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium,","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"University of Bristol by the European Community Human Capital and Mobility Network LPST","institution_ids":["https://openalex.org/I36234482"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020698393","display_name":"John P. Gallagher","orcid":"https://orcid.org/0000-0001-6984-7419","observed_orcids":["https://orcid.org/0000-0001-6984-7419"]},"institutions":[{"id":"https://openalex.org/I36234482","display_name":"University of Bristol","ror":"https://ror.org/0524sp257","country_code":"GB","type":"education","lineage":["https://openalex.org/I36234482"]},{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE","GB"],"is_corresponding":true,"raw_author_name":"John Gallagher","raw_affiliation_strings":["Department of Computer Science University of Bristol Queen's Building University Walk Bristol BS8 1TR U.K","Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium,","University of Bristol by the European Community Human Capital and Mobility Network LPST"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science University of Bristol Queen's Building University Walk Bristol BS8 1TR U.K","institution_ids":["https://openalex.org/I36234482"]},{"raw_affiliation_string":"Department of Computer Science, K.U.Leuven, Celestijnenlaan 200A, B-3001 Heverlee, Belgium,","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"University of Bristol by the European Community Human Capital and Mobility Network LPST","institution_ids":["https://openalex.org/I36234482"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5020698393"],"corresponding_institution_ids":["https://openalex.org/I36234482","https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":28.1459,"has_fulltext":true,"cited_by_count":68,"citation_normalized_percentile":{"value":0.99783784,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"597","last_page":"612"},"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.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.9883000254631042,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.0066999997943639755,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.0006000000284984708,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/partial-deduction","display_name":"partial deduction","score":0.9860000014305115},{"id":"https://openalex.org/keywords/logic-programs","display_name":"logic programs","score":0.9359999895095825},{"id":"https://openalex.org/keywords/well-founded-orderings","display_name":"well-founded orderings","score":0.972000002861023},{"id":"https://openalex.org/keywords/tree-structure","display_name":"tree structure","score":0.7160000205039978}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6626015901565552},{"id":"https://openalex.org/C195701839","wikidata":"https://www.wikidata.org/wiki/Q4008398","display_name":"Partial evaluation","level":2,"score":0.5995810627937317},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5945869088172913},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42594286799430847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4223385155200958},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4150674045085907},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31744611263275146},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24224677681922913},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.7551/mitpress/4298.003.0059","doi":"https://doi.org/10.7551/mitpress/4298.003.0059","is_oa":false,"landing_page_url":"https://doi.org/10.7551/mitpress/4298.003.0059","pdf_url":null,"source":{"id":"https://openalex.org/S4306463997","display_name":"The MIT Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logic Programming","raw_type":"book-chapter"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/133131","doi":null,"is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/133131","pdf_url":"https://lirias.kuleuven.be/retrieve/6ac4e0e8-053f-4982-a67e-f247ff2883e4","source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICLP'95, the Twelfth International Conference on Logic Programming","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.7854","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7854","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://hypatia.dcs.qmw.ac.uk/data/uk/cs.bris.ac.uk/1994/1994-cstr-16.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.56.8261","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.8261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.kuleuven.ac.be/pub/logic-prgm/publications/conferences/iclp95.martens.ps","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/1b4ee9e2-dfe5-44af-90ac-c68c79eef0a3","doi":null,"is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/1b4ee9e2-dfe5-44af-90ac-c68c79eef0a3","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Martens, B & Gallagher, J 1995, Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance. in Unknown. Massachusetts Institute of Technology (MIT) Press, pp. 597 - 614. < http://www.cs.bris.ac.uk/Tools/Reports/Abstracts/martens-gallagher-iclp95.html >","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/7dc2176e-4211-4aa2-bc42-bfc488c1c39d","doi":null,"is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/7dc2176e-4211-4aa2-bc42-bfc488c1c39d","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Martens, B & Gallagher, J 1994 'Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance' University of Bristol. < http://www.cs.bris.ac.uk/Tools/Reports/Abstracts/1994-cstr-16.html >","raw_type":"workingPaper"},{"id":"mag:3021266064","doi":null,"is_oa":false,"landing_page_url":"http://research-information.bristol.ac.uk/en/publications/ensuring-global-termination-of-partial-deduction-while-allowing-flexible-polyvariance(1b4ee9e2-dfe5-44af-90ac-c68c79eef0a3).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306463997","display_name":"The MIT Press eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718","https://openalex.org/P4310316440"],"host_organization_lineage_names":["The MIT Press","Massachusetts Institute of Technology"],"type":"ebook platform"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"MIT Press eBooks","raw_type":null}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/133131","doi":null,"is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/133131","pdf_url":"https://lirias.kuleuven.be/retrieve/6ac4e0e8-053f-4982-a67e-f247ff2883e4","source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICLP'95, the Twelfth International Conference on Logic Programming","raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1530237295.pdf","grobid_xml":"https://content.openalex.org/works/W1530237295.grobid-xml"},"referenced_works_count":27,"referenced_works":["https://openalex.org/W8663418","https://openalex.org/W92496487","https://openalex.org/W145290699","https://openalex.org/W153405243","https://openalex.org/W178589107","https://openalex.org/W1481320527","https://openalex.org/W1487533857","https://openalex.org/W1512183835","https://openalex.org/W1522948470","https://openalex.org/W1556604985","https://openalex.org/W1572344684","https://openalex.org/W1579170619","https://openalex.org/W1985933047","https://openalex.org/W1988185893","https://openalex.org/W2020024606","https://openalex.org/W2026288226","https://openalex.org/W2037035101","https://openalex.org/W2049362499","https://openalex.org/W2058958439","https://openalex.org/W2118383426","https://openalex.org/W2135124683","https://openalex.org/W2143044990","https://openalex.org/W2154320795","https://openalex.org/W2243212299","https://openalex.org/W2522304419","https://openalex.org/W4206370914","https://openalex.org/W4301968143"],"related_works":["https://openalex.org/W7096488151","https://openalex.org/W7065179717","https://openalex.org/W2137818097","https://openalex.org/W1559076591","https://openalex.org/W143840059","https://openalex.org/W1482061011","https://openalex.org/W1991589943","https://openalex.org/W7096163287","https://openalex.org/W1485184152","https://openalex.org/W2056410280"],"abstract_inverted_index":{"The":[0],"control":[1],"of":[2,11,19,58,105,114,131],"polyvariance":[3],"is":[4,53,78],"a":[5,43,71,81,90,98],"key":[6],"issue":[7],"in":[8,119],"partial":[9,65,106],"deduction":[10],"logic":[12],"programs.Certainly,":[13],"only":[14],"nitely":[15],"many":[16],"specialised":[17],"versions":[18],"any":[20],"procedure":[21],"should":[22,33],"be":[23,35,117],"generated,":[24],"while,":[25],"on":[26,128],"the":[27,56,129,137],"other":[28],"hand,":[29],"overly":[30],"severe":[31],"limitations":[32],"not":[34],"imposed.In":[36],"this":[37,48,76],"paper,":[38],"well-founded":[39,91],"orderings":[40],"serve":[41],"as":[42,80],"starting":[44],"point":[45],"for":[46,100],"tackling":[47],"so-called":[49],"\\global":[50],"termination\"":[51],"problem.Polyvariance":[52],"determined":[54],"by":[55],"set":[57,77],"distinct":[59],"\\partially":[60],"deduced\"":[61],"atoms":[62],"generated":[63],"during":[64],"deduction.Avoiding":[66],"ad-hoc":[67],"techniques,":[68],"we":[69,87,134],"formulate":[70],"quite":[72],"general":[73],"framework":[74,139],"where":[75],"represented":[79],"tree":[82],"structure.Associating":[83],"weights":[84],"with":[85],"nodes,":[86],"de":[88],"ne":[89],"order":[92],"among":[93],"such":[94],"structures,":[95],"thus":[96],"obtaining":[97],"foundation":[99],"certi":[101],"ed":[102],"global":[103],"termination":[104,123],"deduction.We":[107],"include":[108],"an":[109],"algorithm":[110],"template,":[111],"concrete":[112],"instances":[113],"which":[115],"can":[116,140],"used":[118],"actual":[120],"implementations,":[121],"prove":[122],"and":[124,126],"correctness,":[125],"report":[127],"results":[130],"some":[132],"experiments.Finally,":[133],"conjecture":[135],"that":[136],"proposed":[138],"support":[141],"further":[142],"advances":[143],"towards":[144],"(fully":[145],"automatic)":[146],"optimal":[147],"program":[148],"specialisation.":[149]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-06T12:05:46.655746","created_date":"2016-06-24T00:00:00"}