{"id":"https://openalex.org/W2010624368","doi":"https://doi.org/10.1145/1389449.1389475","title":"Comprehending finite maps for algorithmic debugging of higher-order functional programs","display_name":"Comprehending finite maps for algorithmic debugging of higher-order functional programs","publication_year":2008,"publication_date":"2008-07-15","ids":{"openalex":"https://openalex.org/W2010624368","doi":"https://doi.org/10.1145/1389449.1389475","mag":"2010624368"},"language":"en","primary_location":{"id":"doi:10.1145/1389449.1389475","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389449.1389475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-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/A5018345365","display_name":"Olaf Chitil","orcid":"https://orcid.org/0000-0001-7986-9929"},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Olaf Chitil","raw_affiliation_strings":["University of Kent, UK","University of Kent (UK)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kent, UK","institution_ids":["https://openalex.org/I20581793"]},{"raw_affiliation_string":"University of Kent (UK)","institution_ids":["https://openalex.org/I20581793"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5054622391","display_name":"Thomas Davie","orcid":null},"institutions":[{"id":"https://openalex.org/I20581793","display_name":"University of Kent","ror":"https://ror.org/00xkeyj56","country_code":"GB","type":"education","lineage":["https://openalex.org/I20581793"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Thomas Davie","raw_affiliation_strings":["University of Kent, UK","University of Kent (UK)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Kent, UK","institution_ids":["https://openalex.org/I20581793"]},{"raw_affiliation_string":"University of Kent (UK)","institution_ids":["https://openalex.org/I20581793"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20581793"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.07130605,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"216"},"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.9998000264167786,"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.9998000264167786,"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.9970999956130981,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/debugging","display_name":"Debugging","score":0.9397900104522705},{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.9120374917984009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8144248127937317},{"id":"https://openalex.org/keywords/algorithmic-program-debugging","display_name":"Algorithmic program debugging","score":0.7824831604957581},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6353574395179749},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.5425454378128052},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4849279224872589},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.478233277797699},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4400932490825653},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13332700729370117}],"concepts":[{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.9397900104522705},{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.9120374917984009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8144248127937317},{"id":"https://openalex.org/C136388014","wikidata":"https://www.wikidata.org/wiki/Q17084976","display_name":"Algorithmic program debugging","level":3,"score":0.7824831604957581},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6353574395179749},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.5425454378128052},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4849279224872589},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.478233277797699},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4400932490825653},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13332700729370117},{"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},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1389449.1389475","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389449.1389475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming","raw_type":"proceedings-article"},{"id":"pmh:oai:kar.kent.ac.uk:24054","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1389449.1389475>)","pdf_url":null,"source":{"id":"https://openalex.org/S4377196264","display_name":"Kent Academic Repository (University of Kent)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20581793","host_organization_name":"University of Kent","host_organization_lineage":["https://openalex.org/I20581793"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"Book section"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.116.4255","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ukc.ac.uk/~oc/TraceTheory/mpc.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.189.2448","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.2448","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kent.ac.uk/pubs/2008/2861/content.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W78774630","https://openalex.org/W1483817851","https://openalex.org/W1514468887","https://openalex.org/W1527457931","https://openalex.org/W1534285741","https://openalex.org/W1592890940","https://openalex.org/W1593962268","https://openalex.org/W1798975336","https://openalex.org/W2015675686","https://openalex.org/W2117123451","https://openalex.org/W2153842012","https://openalex.org/W2166822586","https://openalex.org/W2211582590","https://openalex.org/W2260184634","https://openalex.org/W2501868459","https://openalex.org/W2917990073","https://openalex.org/W4285719527","https://openalex.org/W6629054655","https://openalex.org/W6631718073","https://openalex.org/W6688288038"],"related_works":["https://openalex.org/W2950202488","https://openalex.org/W2604424424","https://openalex.org/W2396596882","https://openalex.org/W2098290990","https://openalex.org/W2119199043","https://openalex.org/W2801084903","https://openalex.org/W2377280071","https://openalex.org/W2060682672","https://openalex.org/W2375626968","https://openalex.org/W4242908235"],"abstract_inverted_index":{"Algorithmic":[0],"debuggers":[1],"for":[2,66,73,151],"higher-order":[3],"functional":[4,9,12,30,78,120],"languages":[5],"have":[6],"to":[7,45,48],"display":[8],"values.":[10],"Originally":[11],"values":[13,31],"had":[14],"been":[15],"represented":[16],"as":[17,32],"partial":[18],"applications":[19],"of":[20,87,104,141,154,157],"function":[21],"and":[22,76,137,147],"constructor":[23],"symbols,":[24],"but":[25,122],"a":[26,58,97],"recent":[27],"approach":[28],"represents":[29],"finite":[33,91,114,145],"maps.":[34,92],"The":[35,107],"two":[36],"representations":[37,68],"require":[38],"the":[39,85,126,132],"computation":[40],"tree":[41],"that":[42,61,110],"is":[43],"central":[44],"algorithmic":[46,64,88,105,111,142],"debugging":[47,65,89,112,143,158],"be":[49],"structured":[50],"rather":[51],"differently.":[52],"In":[53],"this":[54,81,155],"paper":[55],"we":[56,83],"present":[57],"unifying":[59],"framework":[60,94,136],"formally":[62],"defines":[63],"both":[67,74,102],"in":[69,123],"an":[70],"implementation-independent":[71],"way":[72],"strict":[75],"non-strict":[77],"languages.":[79],"On":[80],"basis":[82],"prove":[84],"soundness":[86],"with":[90,113,144],"Our":[93],"shows":[95],"how":[96],"single":[98],"implementation":[99],"can":[100],"support":[101],"forms":[103],"debugging.":[106],"proof":[108,138],"exposed":[109],"maps":[115,146],"does":[116],"not":[117],"handle":[118],"arbitrary":[119],"programs,":[121],"current":[124],"practice":[125],"problematic":[127],"ones":[128],"are":[129,149],"excluded":[130],"by":[131],"type":[133],"system.":[134],"Both":[135],"suggest":[139],"variations":[140],"thus":[148],"tools":[150],"further":[152],"improvement":[153],"form":[156]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}