{"id":"https://openalex.org/W2006660981","doi":"https://doi.org/10.1016/j.entcs.2011.02.015","title":"Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers","display_name":"Attribute Grammars as Recursion Schemes over Cyclic Representations of Zippers","publication_year":2011,"publication_date":"2011-03-01","ids":{"openalex":"https://openalex.org/W2006660981","doi":"https://doi.org/10.1016/j.entcs.2011.02.015","mag":"2006660981"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2011.02.015","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.02.015","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.entcs.2011.02.015","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110490128","display_name":"\u00c9ric Badouel","orcid":null},"institutions":[{"id":"https://openalex.org/I4210133778","display_name":"Centre Inria de l'Universit\u00e9 de Rennes","ror":"https://ror.org/04040yw90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]},{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en sciences et technologies du num\u00e9rique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"government","lineage":["https://openalex.org/I1326498283"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Eric Badouel","raw_affiliation_strings":["INRIA Rennes - Bretagne Atlantique, Campus universitaire de Beaulieu, F-35402 Rennes, France"],"affiliations":[{"raw_affiliation_string":"INRIA Rennes - Bretagne Atlantique, Campus universitaire de Beaulieu, F-35402 Rennes, France","institution_ids":["https://openalex.org/I4210133778","https://openalex.org/I1326498283"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066199634","display_name":"Bernard Fotsing","orcid":null},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Bernard Fotsing","raw_affiliation_strings":["IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France","IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France#TAB#"],"affiliations":[{"raw_affiliation_string":"IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France","institution_ids":["https://openalex.org/I56067802","https://openalex.org/I2802519937"]},{"raw_affiliation_string":"IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France#TAB#","institution_ids":["https://openalex.org/I56067802"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025730918","display_name":"Rodrigue Tchougong","orcid":null},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]},{"id":"https://openalex.org/I56067802","display_name":"Universit\u00e9 de Rennes","ror":"https://ror.org/015m7wh34","country_code":"FR","type":"education","lineage":["https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Rodrigue Tchougong","raw_affiliation_strings":["IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France","IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France#TAB#"],"affiliations":[{"raw_affiliation_string":"IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France","institution_ids":["https://openalex.org/I56067802","https://openalex.org/I2802519937"]},{"raw_affiliation_string":"IRISA, Universit\u00e9 de Rennes 1, Campus universitaire de Beaulieu, F-35402 Rennes, France#TAB#","institution_ids":["https://openalex.org/I56067802"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025730918","https://openalex.org/A5066199634","https://openalex.org/A5110490128"],"corresponding_institution_ids":["https://openalex.org/I1326498283","https://openalex.org/I2802519937","https://openalex.org/I4210133778","https://openalex.org/I56067802"],"apc_list":null,"apc_paid":null,"fwci":0.8805,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79579639,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"229","issue":"5","first_page":"39","last_page":"56"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","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/T10181","display_name":"Natural Language Processing Techniques","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.9987000226974487,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9968000054359436,"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/haskell","display_name":"Haskell","score":0.7652624845504761},{"id":"https://openalex.org/keywords/l-attributed-grammar","display_name":"L-attributed grammar","score":0.7203012108802795},{"id":"https://openalex.org/keywords/functional-programming","display_name":"Functional programming","score":0.719363808631897},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6787481904029846},{"id":"https://openalex.org/keywords/tree-adjoining-grammar","display_name":"Tree-adjoining grammar","score":0.6506944298744202},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5849840044975281},{"id":"https://openalex.org/keywords/rule-based-machine-translation","display_name":"Rule-based machine translation","score":0.5789073705673218},{"id":"https://openalex.org/keywords/attribute-domain","display_name":"Attribute domain","score":0.4952618181705475},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.49067556858062744},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4885769784450531},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4835483729839325},{"id":"https://openalex.org/keywords/context-free-grammar","display_name":"Context-free grammar","score":0.4807700514793396},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4627665579319},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4221789240837097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31209683418273926},{"id":"https://openalex.org/keywords/natural-language-processing","display_name":"Natural language processing","score":0.2899843454360962},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.28375038504600525},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.17805403470993042}],"concepts":[{"id":"https://openalex.org/C2780624054","wikidata":"https://www.wikidata.org/wiki/Q34010","display_name":"Haskell","level":3,"score":0.7652624845504761},{"id":"https://openalex.org/C67621940","wikidata":"https://www.wikidata.org/wiki/Q3113340","display_name":"L-attributed grammar","level":4,"score":0.7203012108802795},{"id":"https://openalex.org/C42383842","wikidata":"https://www.wikidata.org/wiki/Q193076","display_name":"Functional programming","level":2,"score":0.719363808631897},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6787481904029846},{"id":"https://openalex.org/C134083981","wikidata":"https://www.wikidata.org/wiki/Q1754022","display_name":"Tree-adjoining grammar","level":4,"score":0.6506944298744202},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5849840044975281},{"id":"https://openalex.org/C53893814","wikidata":"https://www.wikidata.org/wiki/Q7378909","display_name":"Rule-based machine translation","level":2,"score":0.5789073705673218},{"id":"https://openalex.org/C75814411","wikidata":"https://www.wikidata.org/wiki/Q4818714","display_name":"Attribute domain","level":3,"score":0.4952618181705475},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.49067556858062744},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4885769784450531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4835483729839325},{"id":"https://openalex.org/C97212296","wikidata":"https://www.wikidata.org/wiki/Q338047","display_name":"Context-free grammar","level":3,"score":0.4807700514793396},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4627665579319},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4221789240837097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31209683418273926},{"id":"https://openalex.org/C204321447","wikidata":"https://www.wikidata.org/wiki/Q30642","display_name":"Natural language processing","level":1,"score":0.2899843454360962},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.28375038504600525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.17805403470993042},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C111012933","wikidata":"https://www.wikidata.org/wiki/Q3137210","display_name":"Rough set","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1016/j.entcs.2011.02.015","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.02.015","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-00650799v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00650799","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":"Electronic Notes in Theoretical Computer Science, 2011, Proceedings of the Second Workshop on Mathematically Structured Functional Programming (MSFP 2008), 229 (5), pp.39-56","raw_type":"Journal articles"},{"id":"pmh:oai:HAL:hal-00748204v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00748204","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Electronic Notes in Theoretical Computer Science, 2011, 229 (5), pp.39-56. ⟨10.1016/j.entcs.2011.02.015⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2011.02.015","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.02.015","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W3781596","https://openalex.org/W178941037","https://openalex.org/W1485908855","https://openalex.org/W1492206522","https://openalex.org/W1527090010","https://openalex.org/W1554303319","https://openalex.org/W1565899642","https://openalex.org/W1588030620","https://openalex.org/W1792446329","https://openalex.org/W1964071625","https://openalex.org/W1974588568","https://openalex.org/W1977434346","https://openalex.org/W1981992674","https://openalex.org/W1997644097","https://openalex.org/W2011998974","https://openalex.org/W2043548135","https://openalex.org/W2061786858","https://openalex.org/W2070811535","https://openalex.org/W2126599323","https://openalex.org/W2219039774","https://openalex.org/W2264716425","https://openalex.org/W2912166712","https://openalex.org/W2912949875","https://openalex.org/W4210277633","https://openalex.org/W4290977268","https://openalex.org/W6607334712","https://openalex.org/W6629136188","https://openalex.org/W6631604094","https://openalex.org/W6633145094","https://openalex.org/W6633695829","https://openalex.org/W6635069235","https://openalex.org/W6638258705","https://openalex.org/W6643668574","https://openalex.org/W6758157533"],"related_works":["https://openalex.org/W2153803459","https://openalex.org/W2136486688","https://openalex.org/W1608157979","https://openalex.org/W4285260839","https://openalex.org/W1968022708","https://openalex.org/W2019001464","https://openalex.org/W1980918784","https://openalex.org/W2012632856","https://openalex.org/W2918124307","https://openalex.org/W2072591577"],"abstract_inverted_index":{"Evaluation":[0],"of":[1,18,64,80,84,102,111],"attributes":[2,21],"w.r.t.":[3],"an":[4,59,74,89,117],"attribute":[5,30,65],"grammar":[6],"can":[7],"be":[8],"obtained":[9],"by":[10],"inductively":[11],"computing":[12],"a":[13,34,38],"function":[14],"expressing":[15],"the":[16,19,68,94],"dependencies":[17],"synthesized":[20],"on":[22],"inherited":[23],"attributes.":[24],"This":[25],"higher-order":[26,39],"functional":[27,41,62],"approach":[28],"to":[29,33,54,114],"grammars":[31,66],"leads":[32],"straightforward":[35],"implementation":[36],"using":[37],"lazy":[40],"language":[42],"like":[43],"Haskell.":[44],"The":[45],"resulting":[46],"evaluation":[47],"functions":[48],"are,":[49],"however,":[50],"not":[51],"easily":[52],"amenable":[53],"optimization":[55],"rules.":[56],"We":[57],"present":[58],"alternative":[60],"first-order":[61],"interpretation":[63],"where":[67],"input":[69],"tree":[70,77],"is":[71,82],"replaced":[72],"with":[73,105],"extended":[75],"cyclic":[76,100],"each":[78],"node":[79],"which":[81],"aware":[83],"its":[85],"context":[86],"viewed":[87],"as":[88],"additional":[90],"child":[91],"tree.":[92],"By":[93],"way,":[95],"we":[96],"demonstrate":[97],"that":[98],"these":[99],"representations":[101],"zippers":[103],"(trees":[104],"their":[106],"context)":[107],"are":[108],"natural":[109],"generalizations":[110],"doubly-linked":[112],"lists":[113],"trees":[115],"over":[116],"arbitrary":[118],"signature.":[119]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}