{"id":"https://openalex.org/W2535249784","doi":null,"title":"Constructs for Programming with Graph Rewrites","display_name":"Constructs for Programming with Graph Rewrites","publication_year":2000,"publication_date":"2000-03-01","ids":{"openalex":"https://openalex.org/W2535249784","mag":"2535249784"},"language":"en","primary_location":{"id":"pmh:oai:kar.kent.ac.uk:22043","doi":null,"is_oa":true,"landing_page_url":"https://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","pdf_url":"https://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference proceeding"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048815064","display_name":"Peter J. Rodgers","orcid":"https://orcid.org/0000-0002-4100-3596","observed_orcids":["https://orcid.org/0000-0002-4100-3596"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Peter Rodgers","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-4100-3596","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5048815064"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4257,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.48914616,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.5410000085830688,"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.5410000085830688,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.42800000309944153,"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/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.01679999940097332,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-transformation","display_name":"graph transformation","score":0.9959999918937683},{"id":"https://openalex.org/keywords/graph-data-structures","display_name":"graph data structures","score":0.6539999842643738},{"id":"https://openalex.org/keywords/program-size-reduction","display_name":"program size reduction","score":0.6349999904632568},{"id":"https://openalex.org/keywords/execution-efficiency","display_name":"execution efficiency","score":0.7440000176429749}],"concepts":[{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.8042044639587402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7325882911682129},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.7261192202568054},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.589539110660553},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5816414952278137},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5745134353637695}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:kar.kent.ac.uk:22043","doi":null,"is_oa":true,"landing_page_url":"https://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","pdf_url":"https://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference proceeding"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.645.7638","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.7638","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","raw_type":"text"},{"id":"mag:2535249784","doi":null,"is_oa":false,"landing_page_url":"https://kar.kent.ac.uk/22043/","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:oai:kar.kent.ac.uk:22043","doi":null,"is_oa":true,"landing_page_url":"https://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","pdf_url":"https://kar.kent.ac.uk/22043/1/Constructs_for_Programming_with_Graph_Rewrites.pdf","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,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference proceeding"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2535249784.pdf","grobid_xml":"https://content.openalex.org/works/W2535249784.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1514283508","https://openalex.org/W1559179632","https://openalex.org/W1596213896","https://openalex.org/W1953324153","https://openalex.org/W2022996285","https://openalex.org/W2080434206","https://openalex.org/W2120836608","https://openalex.org/W2160708853"],"related_works":["https://openalex.org/W2521132706","https://openalex.org/W2080434206","https://openalex.org/W7095368884","https://openalex.org/W2498009688","https://openalex.org/W1516046430","https://openalex.org/W1573790708","https://openalex.org/W7099697657","https://openalex.org/W1606757904","https://openalex.org/W7039792634","https://openalex.org/W1572593217"],"abstract_inverted_index":{"Abstract.":[0],"Graph":[1],"rewriting":[2,26,39],"is":[3,73],"becoming":[4],"increasingly":[5],"popular":[6],"as":[7],"a":[8,22],"method":[9],"for":[10],"programming":[11,40],"with":[12],"graph":[13,25,38,89],"based":[14],"data":[15],"structures.":[16],"We":[17,56],"present":[18,45],"several":[19],"modifica-tions":[20],"to":[21,74],"basic":[23],"serial":[24],"paradigm":[27],"and":[28,52,85],"discuss":[29],"how":[30],"they":[31],"improve":[32,80],"coding":[33],"programs":[34],"in":[35],"the":[36,58,61,76,81,87],"Grrr":[37],"language.":[41],"The":[42,65],"con-structs":[43],"we":[44],"are":[46],"once":[47],"only":[48],"nodes,":[49],"attractor":[50],"nodes":[51],"single":[53],"match":[54],"re-writes.":[55],"illustrate":[57],"operation":[59],"of":[60,67,78,83],"constructs":[62],"by":[63],"example.":[64],"advantages":[66],"adding":[68],"these":[69],"new":[70],"rewrite":[71],"modifiers":[72],"reduce":[75],"size":[77],"programs,":[79],"efficiency":[82],"execution":[84],"simplify":[86],"host":[88],"undergoing":[90],"rewriting.":[91],"1":[92]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-10-28T00:00:00"}