{"id":"https://openalex.org/W2055717180","doi":"https://doi.org/10.1017/s0956796800003877","title":"Algorithms with polynomial interpretation termination proof","display_name":"Algorithms with polynomial interpretation termination proof","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2055717180","doi":"https://doi.org/10.1017/s0956796800003877","mag":"2055717180"},"language":"en","primary_location":{"id":"doi:10.1017/s0956796800003877","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800003877","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B4F33C45A883BF3C875699EAC091F86E/S0956796800003877a.pdf/div-class-title-algorithms-with-polynomial-interpretation-termination-proof-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"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":"Journal of Functional Programming","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B4F33C45A883BF3C875699EAC091F86E/S0956796800003877a.pdf/div-class-title-algorithms-with-polynomial-interpretation-termination-proof-div.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5109776712","display_name":"G. Bonfante","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"G. BONFANTE","raw_affiliation_strings":["Loria, Calligramme project, B.P. 239, 54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex, France","(e-mail:"],"affiliations":[{"raw_affiliation_string":"Loria, Calligramme project, B.P. 239, 54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex, France","institution_ids":["https://openalex.org/I4210121838"]},{"raw_affiliation_string":"(e-mail:","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078512799","display_name":"Adam Cichon","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"A. CICHON","raw_affiliation_strings":["Loria, Calligramme project, B.P. 239, 54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex, France","(e-mail:"],"affiliations":[{"raw_affiliation_string":"Loria, Calligramme project, B.P. 239, 54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex, France","institution_ids":["https://openalex.org/I4210121838"]},{"raw_affiliation_string":"(e-mail:","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110832035","display_name":"Jean-Yves Marion","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121838","display_name":"Laboratoire Lorrain de Recherche en Informatique et ses Applications","ror":"https://ror.org/02vnf0c38","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I277688954","https://openalex.org/I4210107720","https://openalex.org/I4210121838","https://openalex.org/I4210159245","https://openalex.org/I90183372"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"J.-Y. MARION","raw_affiliation_strings":["(e-mail:","Loria, Calligramme project, B.P. 239, 54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex, France"],"affiliations":[{"raw_affiliation_string":"(e-mail:","institution_ids":[]},{"raw_affiliation_string":"Loria, Calligramme project, B.P. 239, 54506 Vand\u0153uvre-l\u00e8s-Nancy Cedex, France","institution_ids":["https://openalex.org/I4210121838"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049507162","display_name":"H\u00e9l\u00e8ne Touzet","orcid":"https://orcid.org/0000-0001-5305-9987"},"institutions":[{"id":"https://openalex.org/I174424907","display_name":"Laboratoire d'Informatique Fondamentale de Lille","ror":"https://ror.org/05rhg0h08","country_code":"FR","type":"facility","lineage":["https://openalex.org/I174424907"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"H. TOUZET","raw_affiliation_strings":["(e-mail:","LIFL - USTL, 59655 Villeneuve d'Ascq Cedex, France"],"affiliations":[{"raw_affiliation_string":"(e-mail:","institution_ids":[]},{"raw_affiliation_string":"LIFL - USTL, 59655 Villeneuve d'Ascq Cedex, France","institution_ids":["https://openalex.org/I174424907"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5109776712"],"corresponding_institution_ids":["https://openalex.org/I4210121838"],"apc_list":null,"apc_paid":null,"fwci":1.0902,"has_fulltext":true,"cited_by_count":72,"citation_normalized_percentile":{"value":0.84043947,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"11","issue":"1","first_page":"33","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9962999820709229,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9962999820709229,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10317","display_name":"Advanced Database Systems and Queries","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematical-proof","display_name":"Mathematical proof","score":0.848931074142456},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6302098631858826},{"id":"https://openalex.org/keywords/interpretation","display_name":"Interpretation (philosophy)","score":0.5935077667236328},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.5823950171470642},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5649160146713257},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5515468120574951},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.542150616645813},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49513521790504456},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4403839409351349},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4304409921169281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4161108732223511},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.40624281764030457},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.391815185546875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.327068567276001},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.2075064480304718},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12893983721733093},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.11314946413040161}],"concepts":[{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.848931074142456},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6302098631858826},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.5935077667236328},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5823950171470642},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5649160146713257},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5515468120574951},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.542150616645813},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49513521790504456},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4403839409351349},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4304409921169281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4161108732223511},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40624281764030457},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.391815185546875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.327068567276001},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.2075064480304718},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12893983721733093},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.11314946413040161},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0956796800003877","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800003877","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B4F33C45A883BF3C875699EAC091F86E/S0956796800003877a.pdf/div-class-title-algorithms-with-polynomial-interpretation-termination-proof-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"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":"Journal of Functional Programming","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.43.1538","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.1538","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.loria.fr/~bonfante/publis/jfp.ps","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00100819v1","is_oa":false,"landing_page_url":"https://inria.hal.science/inria-00100819","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Functional Programming, 2001, 11 (1), pp.33-53","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1017/s0956796800003877","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0956796800003877","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B4F33C45A883BF3C875699EAC091F86E/S0956796800003877a.pdf/div-class-title-algorithms-with-polynomial-interpretation-termination-proof-div.pdf","source":{"id":"https://openalex.org/S12266929","display_name":"Journal of Functional Programming","issn_l":"0956-7968","issn":["0956-7968","1469-7653"],"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":"Journal of Functional Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2055717180.pdf","grobid_xml":"https://content.openalex.org/works/W2055717180.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W108460724","https://openalex.org/W1489374747","https://openalex.org/W1542943303","https://openalex.org/W1543527641","https://openalex.org/W1559507946","https://openalex.org/W1567604987","https://openalex.org/W1597089442","https://openalex.org/W1981324778","https://openalex.org/W2034895188","https://openalex.org/W2049865932","https://openalex.org/W2055717180","https://openalex.org/W2069792094","https://openalex.org/W2072181151","https://openalex.org/W2074466497","https://openalex.org/W2086747974","https://openalex.org/W2089982125","https://openalex.org/W2149605327","https://openalex.org/W2593186098","https://openalex.org/W2612949247","https://openalex.org/W4254964791"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1991001836"],"abstract_inverted_index":{"We":[0,87],"study":[1],"the":[2,38,41,46,58,75,93],"effect":[3],"of":[4,9,40,48,92],"polynomial":[5,62],"interpretation":[6,105],"termination":[7,106],"proofs":[8,107],"deterministic":[10,59],"(resp.":[11,18,60,82],"non-deterministic)":[12,61],"algorithms":[13],"defined":[14],"by":[15],"con":[16,80],"uent":[17,81],"non-con":[19,83],"uent)":[20,84],"rewrite":[21,85],"systems":[22],"over":[23],"data":[24],"structures":[25],"which":[26,52],"include":[27],"strings,":[28],"lists":[29],"and":[30,32,67],"trees,":[31],"we":[33,99],"classify":[34],"them":[35],"according":[36],"to":[37,45,55],"interpretations":[39],"constructors.":[42],"This":[43],"leads":[44],"definition":[47],"six":[49],"function":[50],"classes":[51],"turn":[53],"out":[54],"be":[56],"exactly":[57],"time,":[63],"linear":[64,68,94],"exponential":[65,70,104],"time":[66,71],"doubly":[69],"computable":[72,96],"functions":[73,102],"when":[74],"class":[76],"is":[77],"based":[78],"on":[79],"systems.":[86],"also":[88],"obtain":[89],"a":[90],"characterisation":[91],"space":[95],"functions.":[97],"Finally,":[98],"demonstrate":[100],"that":[101],"with":[103],"are":[108],"super-elementary.":[109]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}