{"id":"https://openalex.org/W2073131294","doi":"https://doi.org/10.1145/2528932","title":"Three syntactic theories for combinatory graph reduction","display_name":"Three syntactic theories for combinatory graph reduction","publication_year":2013,"publication_date":"2013-11-01","ids":{"openalex":"https://openalex.org/W2073131294","doi":"https://doi.org/10.1145/2528932","mag":"2073131294"},"language":"en","primary_location":{"id":"doi:10.1145/2528932","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2528932","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","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/A5016621051","display_name":"Olivier Danvy","orcid":"https://orcid.org/0000-0002-3890-3630"},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Olivier Danvy","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark","Aarhus University, Aarhus , Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Aarhus , Denmark","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063302317","display_name":"Ian Zerny","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Ian Zerny","raw_affiliation_strings":["Aarhus University, Aarhus, Denmark","Aarhus University, Aarhus , Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University, Aarhus , Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":0.9735,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.82690689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"4","first_page":"1","last_page":"27"},"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.9991999864578247,"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.9991999864578247,"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/T11567","display_name":"semigroups and automata theory","score":0.9980000257492065,"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/T10142","display_name":"Formal Methods in Verification","score":0.9973000288009644,"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/graph-reduction","display_name":"Graph reduction","score":0.6359001398086548},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5670133829116821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5168857574462891},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48781970143318176},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4724869132041931},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32629847526550293},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3184956908226013},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.1622321903705597}],"concepts":[{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.6359001398086548},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5670133829116821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5168857574462891},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48781970143318176},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4724869132041931},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32629847526550293},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3184956908226013},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.1622321903705597},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/2528932","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2528932","pdf_url":null,"source":{"id":"https://openalex.org/S117153874","display_name":"ACM Transactions on Computational Logic","issn_l":"1529-3785","issn":["1529-3785","1557-945X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computational Logic","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.297.3194","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.3194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://tocl.acm.org/accepted/denvy_zenry-syntactic.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/5f499709-f7ec-499e-8514-0c691123cb2d","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/5f499709-f7ec-499e-8514-0c691123cb2d","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Danvy, O & Zerny, I 2013, 'Three Syntactic Theories for Combinatory Graph Reduction', A C M Transactions on Computational Logic, vol. 14, no. 4, 29. https://doi.org/10.1145/2528932","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W22089940","https://openalex.org/W321621052","https://openalex.org/W398758961","https://openalex.org/W1520096901","https://openalex.org/W1543641760","https://openalex.org/W1554854089","https://openalex.org/W1557619244","https://openalex.org/W1560420247","https://openalex.org/W1582280888","https://openalex.org/W1627010835","https://openalex.org/W1892209699","https://openalex.org/W1918523847","https://openalex.org/W1982122213","https://openalex.org/W2000196688","https://openalex.org/W2002529995","https://openalex.org/W2007809070","https://openalex.org/W2016550363","https://openalex.org/W2020259928","https://openalex.org/W2030663607","https://openalex.org/W2062838731","https://openalex.org/W2063068243","https://openalex.org/W2064236106","https://openalex.org/W2077365304","https://openalex.org/W2078807176","https://openalex.org/W2090036644","https://openalex.org/W2102435409","https://openalex.org/W2112022010","https://openalex.org/W2118172707","https://openalex.org/W2118229393","https://openalex.org/W2139626883","https://openalex.org/W2151423950","https://openalex.org/W2154273644","https://openalex.org/W2156231390","https://openalex.org/W2158105805","https://openalex.org/W2160646753","https://openalex.org/W2326697462","https://openalex.org/W2408231473","https://openalex.org/W2490166346","https://openalex.org/W3013606704","https://openalex.org/W3101867176","https://openalex.org/W4205241946","https://openalex.org/W4231445347","https://openalex.org/W4301171710","https://openalex.org/W4406166094","https://openalex.org/W6666679710","https://openalex.org/W6674721091","https://openalex.org/W6677551240","https://openalex.org/W6713700034","https://openalex.org/W7056712498"],"related_works":["https://openalex.org/W2094190051","https://openalex.org/W2088032442","https://openalex.org/W4251763581","https://openalex.org/W2770410918","https://openalex.org/W1511068207","https://openalex.org/W1555211306","https://openalex.org/W2291398792","https://openalex.org/W4242223307","https://openalex.org/W4384785625","https://openalex.org/W2088104192"],"abstract_inverted_index":{"We":[0,28,42,81,103,135,157,198],"present":[1],"a":[2,35,95,111,149,165],"purely":[3],"syntactic":[4,32,85,139,186,203],"theory":[5,33],"of":[6,39,48,61,77,99,153,171,179,218],"graph":[7,18,55,195,223],"reduction":[8,37,97,151,162,182,196],"for":[9,193],"the":[10,46,75,92,146,208,215,227],"canonical":[11],"combinators":[12],"S,":[13],"K,":[14],"and":[15,25,220],"I,":[16],"where":[17],"vertices":[19,56],"are":[20],"represented":[21],"with":[22,177],"evaluation":[23],"contexts":[24],"let":[26,49,106],"expressions.":[27],"express":[29,82,136],"this":[30,83,137,160,172],"first":[31],"as":[34,53,57,71,94,108,132,148],"storeless":[36,96],"semantics":[38,98,152,163],"combinatory":[40,100,154,194,229],"terms.":[41],"then":[43,104,158],"factor":[44],"out":[45],"introduction":[47],"expressions":[50],"to":[51,91,122,145,206],"denote":[52],"many":[54],"possible":[58],"upfront":[59],"instead":[60],"on":[62],"demand":[63],".":[64],"The":[65,125,169,184],"factored":[66],"terms":[67,127],"can":[68,128],"be":[69,130],"interpreted":[70,131],"term":[72,101,133,155],"graphs":[73],"in":[74,110,116],"sense":[76],"Barendregt":[78],"et":[79],"al.":[80],"second":[84],"theory,":[86,140],"which":[87,141],"we":[88,142],"prove":[89,143],"equivalent":[90,144],"first,":[93],"graphs.":[102,134,156],"recast":[105],"bindings":[107,109],"global":[112],"store,":[113],"thus":[114],"shifting,":[115],"Strachey's":[117],"words,":[118],"from":[119],"denotable":[120],"entities":[121],"storable":[123],"entities.":[124],"store-based":[126,150,161,166,173],"still":[129],"third":[138],"second,":[147],"refocus":[159],"into":[164],"abstract":[167,174],"machine.":[168,183],"architecture":[170],"machine":[175],"coincides":[176],"that":[178],"Turner's":[180],"original":[181],"three":[185,202],"theories":[187,204],"presented":[188],"here":[189],"therefore":[190,213],"properly":[191],"account":[192],"As":[197],"Know":[199],"It.":[200],"These":[201],"scale":[205],"handling":[207],"Y":[209],"combinator.":[210],"This":[211],"article":[212],"illustrates":[214],"scientific":[216],"consensus":[217],"theoreticians":[219],"implementors":[221],"about":[222],"reduction:":[224],"it":[225],"is":[226],"same":[228],"elephant.":[230]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}