{"id":"https://openalex.org/W1997163113","doi":"https://doi.org/10.1142/s012962640200094x","title":"TURING UNIVERSALITY OF RECURSIVE PATTERNS FOR PARALLEL PROGRAMMING","display_name":"TURING UNIVERSALITY OF RECURSIVE PATTERNS FOR PARALLEL PROGRAMMING","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W1997163113","doi":"https://doi.org/10.1142/s012962640200094x","mag":"1997163113"},"language":"en","primary_location":{"id":"doi:10.1142/s012962640200094x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640200094x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5041438847","display_name":"J\u00f6rg Fischer","orcid":null},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00d6RG FISCHER","raw_affiliation_strings":["Techische Universit\u00e4t Berlin,  Sekr. 5-6, Franklinstra\u00dfe 28/29,  10587 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Techische Universit\u00e4t Berlin,  Sekr. 5-6, Franklinstra\u00dfe 28/29,  10587 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061421539","display_name":"Sergei Gorlatch","orcid":"https://orcid.org/0000-0003-3857-9380"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"SERGEI GORLATCH","raw_affiliation_strings":["Techische Universit\u00e4t Berlin,  Sekr. 5-6, Franklinstra\u00dfe 28/29,  10587 Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Techische Universit\u00e4t Berlin,  Sekr. 5-6, Franklinstra\u00dfe 28/29,  10587 Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4577782"],"apc_list":null,"apc_paid":null,"fwci":0.4226,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68071688,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"12","issue":"02","first_page":"229","last_page":"246"},"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9986000061035156,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9973999857902527,"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/computer-science","display_name":"Computer science","score":0.6168711185455322},{"id":"https://openalex.org/keywords/morphism","display_name":"Morphism","score":0.5606167912483215},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.528685986995697},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45288822054862976},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.432148814201355},{"id":"https://openalex.org/keywords/generic-programming","display_name":"Generic programming","score":0.41784343123435974},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4101705849170685},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.290119469165802},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.0843706727027893}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6168711185455322},{"id":"https://openalex.org/C137212723","wikidata":"https://www.wikidata.org/wiki/Q1948412","display_name":"Morphism","level":2,"score":0.5606167912483215},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.528685986995697},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45288822054862976},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.432148814201355},{"id":"https://openalex.org/C7051814","wikidata":"https://www.wikidata.org/wiki/Q1051282","display_name":"Generic programming","level":2,"score":0.41784343123435974},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4101705849170685},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.290119469165802},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0843706727027893}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s012962640200094x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012962640200094x","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W148766658","https://openalex.org/W1985557227","https://openalex.org/W1994718921","https://openalex.org/W2090504951","https://openalex.org/W2095520948","https://openalex.org/W2101565274","https://openalex.org/W2102075452","https://openalex.org/W3012271422","https://openalex.org/W4244792373"],"related_works":["https://openalex.org/W2073905442","https://openalex.org/W2294870584","https://openalex.org/W2950633473","https://openalex.org/W2315104758","https://openalex.org/W2116825378","https://openalex.org/W4381854137","https://openalex.org/W1551708390","https://openalex.org/W2072174184","https://openalex.org/W2122272436","https://openalex.org/W150739485"],"abstract_inverted_index":{"Dijkstra's":[0],"famous":[1],"thesis":[2],"\"goto":[3],"considered":[4,45],"harmful\",":[5],"which":[6],"paved":[7],"the":[8,17,24,28,88,128,147,166],"way":[9],"for":[10,36,173],"structured":[11],"programming,":[12],"was":[13],"formally":[14,73],"substantiated":[15],"by":[16],"result":[18],"of":[19,27,62,70,82,91,130,149,169],"B\u00f6hm":[20],"and":[21,55,96,142,153,171],"Jacopini":[22],"on":[23,104,122,139,162],"Turing":[25],"universality":[26],"three":[29],"well-known":[30],"basic":[31],"programming":[32,42,119,136],"constructs.":[33,64],"We":[34,65,157],"argue":[35],"a":[37,59,77,99,159],"similar":[38],"ideal":[39],"in":[40,76],"parallel":[41,63,174],"\u2014":[43,47],"\"send-receive":[44],"harmful\"":[46],"i.e.":[48],"abandoning":[49],"explicit":[50],"send-receive":[51],"statements":[52],"between":[53],"processors":[54],"expressing":[56],"programs":[57],"using":[58],"restricted":[60,100],"set":[61],"deal":[66],"with":[67],"recursive":[68,132,151],"patterns":[69],"parallelism,":[71],"represented":[72],"as":[74],"morphisms":[75,93],"suitable":[78],"calculus.":[79],"The":[80],"aim":[81],"this":[83],"paper":[84],"is":[85,124,144,154],"to":[86,127,146],"study":[87,161],"expressive":[89,167],"power":[90,168],"two":[92,110],"\u2013":[94],"catamorphisms":[95,123,141,172],"anamorphisms.":[97],"For":[98],"program":[101],"calculus":[102],"based":[103,121,138],"these":[105],"morphisms,":[106],"we":[107],"constructively":[108],"prove":[109],"formal":[111],"results,":[112],"whose":[113],"pragmatic":[114],"message":[115],"is:":[116],"(1)":[117],"A":[118,135],"language":[120,137],"computationally":[125],"equivalent":[126,145],"class":[129,148],"primitive":[131],"functions;":[133],"(2)":[134],"both":[140],"anamorphisms":[143],"partial":[150],"functions":[152],"therefore":[155],"Turing-universal.":[156],"present":[158],"case":[160],"numerical":[163],"integration,":[164],"demonstrating":[165],"ana-":[170],"programming.":[175]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}