{"id":"https://openalex.org/W2158148651","doi":"https://doi.org/10.1145/2364394.2364399","title":"Expressing multi-way data-flow constraint systems as a commutative monoid makes many of their properties obvious","display_name":"Expressing multi-way data-flow constraint systems as a commutative monoid makes many of their properties obvious","publication_year":2012,"publication_date":"2012-09-12","ids":{"openalex":"https://openalex.org/W2158148651","doi":"https://doi.org/10.1145/2364394.2364399","mag":"2158148651"},"language":"en","primary_location":{"id":"doi:10.1145/2364394.2364399","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2364394.2364399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th ACM SIGPLAN workshop on Generic 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/A5047665290","display_name":"Jaakko J\u00e4rvi","orcid":"https://orcid.org/0000-0002-3418-7366"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jaakko J\u00e4rvi","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100786124","display_name":"Magne Haveraaen","orcid":"https://orcid.org/0000-0003-0836-8347"},"institutions":[{"id":"https://openalex.org/I4432739","display_name":"University of Bergen","ror":"https://ror.org/03zga2b32","country_code":"NO","type":"education","lineage":["https://openalex.org/I4432739"]}],"countries":["NO"],"is_corresponding":false,"raw_author_name":"Magne Haveraaen","raw_affiliation_strings":["University of Bergen, Bergen, Norway"],"affiliations":[{"raw_affiliation_string":"University of Bergen, Bergen, Norway","institution_ids":["https://openalex.org/I4432739"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082571821","display_name":"John P. Freeman","orcid":"https://orcid.org/0000-0001-8786-8344"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Freeman","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069691243","display_name":"Mat Marcus","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mat Marcus","raw_affiliation_strings":["Canoynlands Software Design Inc., Seattle, WA, USA"],"affiliations":[{"raw_affiliation_string":"Canoynlands Software Design Inc., Seattle, WA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047665290"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.6739,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7291185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"25","last_page":"32"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9965999722480774,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9939000010490417,"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/constraint","display_name":"Constraint (computer-aided design)","score":0.6069852113723755},{"id":"https://openalex.org/keywords/constraint-graph","display_name":"Constraint graph","score":0.519478440284729},{"id":"https://openalex.org/keywords/binary-constraint","display_name":"Binary constraint","score":0.5193173289299011},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4876812696456909},{"id":"https://openalex.org/keywords/commutative-property","display_name":"Commutative property","score":0.4821752905845642},{"id":"https://openalex.org/keywords/constraint-logic-programming","display_name":"Constraint logic programming","score":0.48045843839645386},{"id":"https://openalex.org/keywords/directed-acyclic-graph","display_name":"Directed acyclic graph","score":0.46714967489242554},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.44056305289268494},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4374050199985504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3872263431549072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3239310383796692},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2839314341545105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.23519378900527954}],"concepts":[{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6069852113723755},{"id":"https://openalex.org/C178481205","wikidata":"https://www.wikidata.org/wiki/Q5164372","display_name":"Constraint graph","level":5,"score":0.519478440284729},{"id":"https://openalex.org/C79475747","wikidata":"https://www.wikidata.org/wiki/Q4913885","display_name":"Binary constraint","level":5,"score":0.5193173289299011},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4876812696456909},{"id":"https://openalex.org/C183778304","wikidata":"https://www.wikidata.org/wiki/Q165474","display_name":"Commutative property","level":2,"score":0.4821752905845642},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.48045843839645386},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.46714967489242554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.44056305289268494},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4374050199985504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3872263431549072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3239310383796692},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2839314341545105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.23519378900527954},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2364394.2364399","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2364394.2364399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 8th ACM SIGPLAN workshop on Generic programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W58322501","https://openalex.org/W1538527501","https://openalex.org/W2017404992","https://openalex.org/W2053637323","https://openalex.org/W2074556793","https://openalex.org/W2078328646","https://openalex.org/W2100599950","https://openalex.org/W2105655803","https://openalex.org/W2121147677","https://openalex.org/W2132233302","https://openalex.org/W2296513191","https://openalex.org/W2611093227","https://openalex.org/W4232896595","https://openalex.org/W4297938573"],"related_works":["https://openalex.org/W1486916474","https://openalex.org/W2334636689","https://openalex.org/W1519282274","https://openalex.org/W2032348095","https://openalex.org/W1864499657","https://openalex.org/W1493198162","https://openalex.org/W2675278944","https://openalex.org/W1532176371","https://openalex.org/W1604441276","https://openalex.org/W1577743412"],"abstract_inverted_index":{"Here":[0],"multi-way":[1,11,118,141],"data-flow":[2,12,119,142],"constraints":[3,13,37,109],"systems":[4,160],"are":[5],"viewed":[6],"as":[7,25,40,87],"commutative":[8],"monoids.":[9],"A":[10],"system":[14,121,166],"consists":[15],"of":[16,19,28,43,51,63,69,98,105,108,136,140,154],"a":[17,26,70,76,92,123,133,164],"collection":[18],"constraints,":[20],"each":[21,57],"constraint":[22,82,94,120,143,159,165],"being":[23],"represented":[24],"set":[27,42],"directed":[29],"graphs.":[30],"The":[31],"monoid's":[32,173],"binary":[33,174],"operation":[34],"between":[35,47],"two":[36],"is":[38,75,102,129,185],"defined":[39],"the":[41,61,64,67,81,84,88,96,99,103,111,116,137,172,177],"(non-disjoint)":[44],"graph":[45,55,86],"unions":[46],"all":[48,106,132],"possible":[49],"pairs":[50],"graphs,":[52],"choosing":[53],"one":[54],"from":[56,110],"constraint,":[58],"such":[59],"that":[60],"result":[62],"union":[65],"satisfies":[66],"conditions":[68],"valid":[71],"solution.":[72],"This":[73,113,126],"clearly":[74],"commutative,":[77],"associative":[78],"operation,":[79],"with":[80,122],"containing":[83],"null":[85],"neutral":[89],"element.":[90],"For":[91,162],"given":[93],"system,":[95],"carrier":[97],"corresponding":[100],"monoid":[101],"closure":[104],"combinations":[107],"system.":[112],"then":[114],"unifies":[115],"entire":[117],"single":[124],"constraint.":[125],"generic":[127,147],"view":[128,148],"not":[130],"at":[131],"drastic":[134],"departure":[135],"established":[138],"descriptions":[139],"systems.":[144],"Defining":[145],"this":[146],"explicitly,":[149],"however,":[150],"makes":[151],"several":[152],"properties":[153],"and":[155],"algorithms":[156],"operating":[157],"on":[158],"obvious.":[161],"example,":[163],"can":[167],"be":[168],"solved":[169],"by":[170],"folding":[171],"operator":[175],"over":[176],"system's":[178],"constraints.":[179],"An":[180],"example":[181],"implementation":[182],"in":[183],"Haskell":[184],"described.":[186]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}