WEKO3
アイテム
{"_buckets": {"deposit": "2205dcae-5d7d-4957-8920-45dced15d975"}, "_deposit": {"id": "25691", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "25691"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00025691", "sets": ["314"]}, "author_link": ["76074", "76075", "76076"], "item_10_biblio_info_6": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2018-01", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "149", "bibliographicPageStart": "128", "bibliographicVolumeNumber": "94", "bibliographic_titles": [{"bibliographic_title": "Journal of Logical and Algebraic Methods in Programming", "bibliographic_titleLang": "en"}]}]}, "item_10_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Essentially, in a reversible programming language, for each forward computation from state S to state S\u0027, there exists a constructive method to go backwards from state S\u0027 to state S. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or quantum computing, to name a few. In this work, we focus on term rewriting, a computation model that underlies most rule-based programming languages. In general, term rewriting is not reversible, even for injective functions; namely, given a rewrite step t1→t2, we do not always have a decidable method to get t1 from t2. Here, we introduce a conservative extension of term rewriting that becomes reversible. Furthermore, we also define two transformations, injectivization and inversion, to make a rewrite system reversible using standard term rewriting. We illustrate the usefulness of our transformations in the context of bidirectional program transformation.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_10_description_5": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "ファイル公開:2020-01-01 ", "subitem_description_language": "ja", "subitem_description_type": "Other"}]}, "item_10_publisher_32": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "Elsevier", "subitem_publisher_language": "en"}]}, "item_10_relation_11": {"attribute_name": "DOI", "attribute_value_mlt": [{"subitem_relation_type": "isVersionOf", "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://doi.org/10.1016/j.jlamp.2017.10.003", "subitem_relation_type_select": "DOI"}}]}, "item_10_rights_12": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "© 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ ", "subitem_rights_language": "en"}]}, "item_10_select_15": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "23522208", "subitem_source_identifier_type": "PISSN"}]}, "item_1615787544753": {"attribute_name": "出版タイプ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_ab4af688f83e57aa", "subitem_version_type": "AM"}]}, "item_access_right": {"attribute_name": "アクセス権", "attribute_value_mlt": [{"subitem_access_right": "open access", "subitem_access_right_uri": "http://purl.org/coar/access_right/c_abf2"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Nishida, Naoki", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "76074", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Palacios, Adrián", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "76075", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Vidal, Germán", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "76076", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2020-01-01"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "paper_NPV17_jlamp_preprint.pdf", "filesize": [{"value": "494.7 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 494700.0, "url": {"label": "paper_NPV17_jlamp_preprint", "objectType": "fulltext", "url": "https://nagoya.repo.nii.ac.jp/record/25691/files/paper_NPV17_jlamp_preprint.pdf"}, "version_id": "c9540901-34a0-4585-b6a7-cd25f3d88f9a"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "Term rewriting", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Reversible computation", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Program transformation", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Reversible computation in term rewriting", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "Reversible computation in term rewriting", "subitem_title_language": "en"}]}, "item_type_id": "10", "owner": "1", "path": ["314"], "permalink_uri": "http://hdl.handle.net/2237/00027902", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2018-04-16"}, "publish_date": "2018-04-16", "publish_status": "0", "recid": "25691", "relation": {}, "relation_version_is_last": true, "title": ["Reversible computation in term rewriting"], "weko_shared_id": -1}
Reversible computation in term rewriting
http://hdl.handle.net/2237/00027902
http://hdl.handle.net/2237/0002790225c38879-15ed-4db8-904f-9844658cf705
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]() |
|
Item type | 学術雑誌論文 / Journal Article(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2018-04-16 | |||||
タイトル | ||||||
タイトル | Reversible computation in term rewriting | |||||
言語 | en | |||||
著者 |
Nishida, Naoki
× Nishida, Naoki× Palacios, Adrián× Vidal, Germán |
|||||
アクセス権 | ||||||
アクセス権 | open access | |||||
アクセス権URI | http://purl.org/coar/access_right/c_abf2 | |||||
権利 | ||||||
言語 | en | |||||
権利情報 | © 2018. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Term rewriting | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Reversible computation | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | Program transformation | |||||
抄録 | ||||||
内容記述 | Essentially, in a reversible programming language, for each forward computation from state S to state S', there exists a constructive method to go backwards from state S' to state S. Besides its theoretical interest, reversible computation is a fundamental concept which is relevant in many different areas like cellular automata, bidirectional program transformation, or quantum computing, to name a few. In this work, we focus on term rewriting, a computation model that underlies most rule-based programming languages. In general, term rewriting is not reversible, even for injective functions; namely, given a rewrite step t1→t2, we do not always have a decidable method to get t1 from t2. Here, we introduce a conservative extension of term rewriting that becomes reversible. Furthermore, we also define two transformations, injectivization and inversion, to make a rewrite system reversible using standard term rewriting. We illustrate the usefulness of our transformations in the context of bidirectional program transformation. | |||||
言語 | en | |||||
内容記述タイプ | Abstract | |||||
内容記述 | ||||||
内容記述 | ファイル公開:2020-01-01 | |||||
言語 | ja | |||||
内容記述タイプ | Other | |||||
出版者 | ||||||
言語 | en | |||||
出版者 | Elsevier | |||||
言語 | ||||||
言語 | eng | |||||
資源タイプ | ||||||
資源タイプresource | http://purl.org/coar/resource_type/c_6501 | |||||
タイプ | journal article | |||||
出版タイプ | ||||||
出版タイプ | AM | |||||
出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||
DOI | ||||||
関連タイプ | isVersionOf | |||||
識別子タイプ | DOI | |||||
関連識別子 | https://doi.org/10.1016/j.jlamp.2017.10.003 | |||||
ISSN | ||||||
収録物識別子タイプ | PISSN | |||||
収録物識別子 | 23522208 | |||||
書誌情報 |
en : Journal of Logical and Algebraic Methods in Programming 巻 94, p. 128-149, 発行日 2018-01 |
|||||
著者版フラグ | ||||||
値 | author |