{"id":"https://openalex.org/W11173561","doi":null,"title":"Infinite Unfolding and Transformations of Nondeterministic Programs","display_name":"Infinite Unfolding and Transformations of Nondeterministic Programs","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W11173561","mag":"11173561"},"language":"en","primary_location":{"id":"mag:11173561","doi":null,"is_oa":false,"landing_page_url":"https://content.iospress.com/articles/fundamenta-informaticae/fi66-4-06","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-c","cwts-core","ddh","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Fundamenta Informaticae","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5062612658","display_name":"Bj\u00f6rn Lisper","orcid":"https://orcid.org/0000-0001-5297-6548","observed_orcids":["https://orcid.org/0000-0001-5297-6548"]},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Bj\u00f6rn Lisper","raw_affiliation_strings":["(Correspd.) Dept. of Computer Science and Electronics M\u00e4lardalen University P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden#TAB#"],"raw_orcid":"https://orcid.org/0000-0001-5297-6548","affiliations":[{"raw_affiliation_string":"(Correspd.) Dept. of Computer Science and Electronics M\u00e4lardalen University P.O. Box 883, SE-721 23 V\u00e4ster\u00e5s, Sweden#TAB#","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062612658"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":{"value":4150,"currency":"USD","value_usd":4150},"apc_paid":null,"fwci":0.644,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.78243021,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"66","issue":"4","first_page":"415","last_page":"439"},"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.9994999766349792,"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.9994999766349792,"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/T11727","display_name":"Advanced Algebra and Logic","score":0.0,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.0,"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/nondeterministic-programs","display_name":"nondeterministic programs","score":0.9860000014305115},{"id":"https://openalex.org/keywords/program-transformation","display_name":"program transformation","score":0.6209999918937683},{"id":"https://openalex.org/keywords/unfold-fold-transformation","display_name":"unfold/fold transformations","score":0.8809999823570251},{"id":"https://openalex.org/keywords/program-equivalence","display_name":"program equivalence","score":0.6690000295639038},{"id":"https://openalex.org/keywords/reduction-sequences","display_name":"reduction sequences","score":0.6660000085830688},{"id":"https://openalex.org/keywords/higher-order-programs","display_name":"higher-order programs","score":0.734000027179718},{"id":"https://openalex.org/keywords/infinite-terms","display_name":"infinite terms","score":0.38999998569488525},{"id":"https://openalex.org/keywords/recursive-programs","display_name":"recursive programs","score":0.5180000066757202}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.9323127269744873},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.8790045380592346},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.7004189491271973},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5872712731361389},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5166888236999512},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5079441666603088},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4748699367046356},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.4562455713748932},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.44419389963150024},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4199671149253845},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3789776861667633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.364777147769928},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35034888982772827},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:11173561","doi":null,"is_oa":false,"landing_page_url":"https://content.iospress.com/articles/fundamenta-informaticae/fi66-4-06","pdf_url":null,"source":{"id":"https://openalex.org/S39012697","display_name":"Fundamenta Informaticae","issn_l":"0169-2968","issn":["0169-2968","1875-8681"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","ccf-c","cwts-core","ddh","dongbi-b","jufo-1","norway-1","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Fundamenta Informaticae","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W52128144","https://openalex.org/W224041582","https://openalex.org/W294941679","https://openalex.org/W1508399233","https://openalex.org/W1510115975","https://openalex.org/W1521416461","https://openalex.org/W1531044637","https://openalex.org/W1550809368","https://openalex.org/W1574340008","https://openalex.org/W1853649213","https://openalex.org/W1964596093","https://openalex.org/W1965996801","https://openalex.org/W1995270677","https://openalex.org/W1999005577","https://openalex.org/W2000196688","https://openalex.org/W2001937661","https://openalex.org/W2009332552","https://openalex.org/W2021515159","https://openalex.org/W2023299380","https://openalex.org/W2023307455","https://openalex.org/W2029074011","https://openalex.org/W2029770167","https://openalex.org/W2061786858","https://openalex.org/W2062838731","https://openalex.org/W2064236106","https://openalex.org/W2066030913","https://openalex.org/W2070558135","https://openalex.org/W2084745607","https://openalex.org/W2112022010","https://openalex.org/W2113991923","https://openalex.org/W2118172707","https://openalex.org/W2123364143","https://openalex.org/W2127455814","https://openalex.org/W2135359747","https://openalex.org/W2154273644","https://openalex.org/W2158805636","https://openalex.org/W2159214439","https://openalex.org/W2166089338","https://openalex.org/W2166853829","https://openalex.org/W2184268586"],"related_works":["https://openalex.org/W141761068","https://openalex.org/W1504860623","https://openalex.org/W2086108880","https://openalex.org/W4213187981","https://openalex.org/W7095189532","https://openalex.org/W7099056181","https://openalex.org/W3163406724","https://openalex.org/W2053843392","https://openalex.org/W2029770167","https://openalex.org/W1973899735"],"abstract_inverted_index":{"We":[0,72,125],"prove":[1,105],"some":[2],"new":[3],"results":[4],"about":[5,108],"the":[6,17,43,76,122,128,146],"correctness":[7,133,149],"of":[8,10,78,110,118,137,153],"transformations":[9],"nondeterministic":[11,31,94,138],"programs.":[12,140,155],"The":[13],"reported":[14],"work":[15],"formalises":[16],"intuitive":[18],"idea":[19],"that":[20,67],"two":[21,55],"recursive":[22,139],"programs":[23,92,111,119],"ought":[24],"to":[25,42,50,75,121,130,145],"be":[26,36],"equivalent,":[27],"also":[28],"in":[29],"a":[30,84,106,132],"setting,":[32],"if":[33],"they":[34,68],"can":[35],"symbolically":[37],"unfolded,":[38],"through":[39],"deterministic":[40,116],"reductions,":[41],"same,":[44],"possibly":[45,114],"infinite,":[46,115],"term.":[47,124],"In":[48,101],"order":[49,90],"do":[51],"this":[52,102],"we":[53,104],"develop":[54],"related":[56],"semantics,":[57],"based":[58,112],"on":[59,113],"computations":[60],"modeled":[61],"by":[62],"reduction":[63],"sequences,":[64],"and":[65],"argue":[66],"are":[69],"operationally":[70],"meaningful.":[71],"then":[73,126],"specialise":[74],"case":[77],"Combinatory":[79],"Reduction":[80],"Systems,":[81],"which":[82],"provides":[83],"suitable":[85],"rewrite":[86],"setting":[87,103],"for":[88,135,151],"higher":[89],"functional":[91],"with":[93],"constructs,":[95],"e.g.,":[96],"stream":[97],"or":[98],"process":[99],"primitives.":[100],"theorem":[107,129],"equivalence":[109],"unfoldings":[117],"converging":[120],"same":[123],"use":[127],"show":[131],"criterion":[134,142,150],"unfold/fold-transformations":[136,152],"This":[141],"is":[143],"similar":[144],"well-known":[147],"Tamaki-Sato":[148],"logic":[154]},"counts_by_year":[],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-06-24T00:00:00"}