ログイン
言語:

WEKO3

  • トップ
  • コミュニティ
  • ランキング
AND
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "c3fec835-5684-4c25-b15a-02bdcf9f75f1"}, "_deposit": {"id": "7549", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "7549"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00007549"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2007-06", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "81", "bibliographicPageStart": "77", "bibliographic_titles": [{"bibliographic_title": "Proceedings of the 9th International Workshop on Termination"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "This paper shows a sufficient syntactic condition for constructor TRSs whose inverse-computation CTRSs generated by Nishida, Sakai and Sakabe\u0027s inversion compiler are confluent and operationally terminating. By replacing the unraveling at the second phase of the compiler with Serbanuta and Rosu\u0027s transformation, we generate convergent TRSs for inverse computation of injective functions satisfying the sufficient condition.", "subitem_description_type": "Abstract"}]}, "item_10_identifier_60": {"attribute_name": "URI", "attribute_value_mlt": [{"subitem_identifier_type": "HDL", "subitem_identifier_uri": "http://hdl.handle.net/2237/9239"}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "publisher"}]}, "item_10_text_14": {"attribute_name": "\u30d5\u30a9\u30fc\u30de\u30c3\u30c8", "attribute_value_mlt": [{"subitem_text_value": "application/pdf"}]}, "item_creator": {"attribute_name": "\u8457\u8005", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Nishida, Naoki"}], "nameIdentifiers": [{"nameIdentifier": "21265", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "21266", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kato, Terutoshi"}], "nameIdentifiers": [{"nameIdentifier": "21267", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "\u30d5\u30a1\u30a4\u30eb\u60c5\u5831", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-02-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "sakai_3.pdf", "filesize": [{"value": "127.5 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 127500.0, "url": {"label": "sakai_3.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/7549/files/sakai_3.pdf"}, "version_id": "747bc3e7-5150-4904-b241-b7d36432f64f"}]}, "item_language": {"attribute_name": "\u8a00\u8a9e", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "\u8cc7\u6e90\u30bf\u30a4\u30d7", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "Convergent Term Rewriting Systems for Inverse Computation of Injective Functions", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Convergent Term Rewriting Systems for Inverse Computation of Injective Functions"}]}, "item_type_id": "10", "owner": "1", "path": ["312/598/599"], "permalink_uri": "http://hdl.handle.net/2237/9239", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2008-01-04"}, "publish_date": "2008-01-04", "publish_status": "0", "recid": "7549", "relation": {}, "relation_version_is_last": true, "title": ["Convergent Term Rewriting Systems for Inverse Computation of Injective Functions"], "weko_shared_id": null}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500e 会議資料
  3. 国際会議

Convergent Term Rewriting Systems for Inverse Computation of Injective Functions

http://hdl.handle.net/2237/9239
2288abb0-f5af-4e2c-aae2-b4d41a4b8684
名前 / ファイル ライセンス アクション
sakai_3.pdf sakai_3.pdf (127.5 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2008-01-04
タイトル
タイトル Convergent Term Rewriting Systems for Inverse Computation of Injective Functions
著者 Nishida, Naoki

× Nishida, Naoki

WEKO 21265

Nishida, Naoki

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 21266

Sakai, Masahiko

Search repository
Kato, Terutoshi

× Kato, Terutoshi

WEKO 21267

Kato, Terutoshi

Search repository
抄録
内容記述 This paper shows a sufficient syntactic condition for constructor TRSs whose inverse-computation CTRSs generated by Nishida, Sakai and Sakabe's inversion compiler are confluent and operationally terminating. By replacing the unraveling at the second phase of the compiler with Serbanuta and Rosu's transformation, we generate convergent TRSs for inverse computation of injective functions satisfying the sufficient condition.
内容記述タイプ Abstract
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
書誌情報 Proceedings of the 9th International Workshop on Termination

p. 77-81, 発行日 2007-06
フォーマット
application/pdf
著者版フラグ
値 publisher
URI
識別子 http://hdl.handle.net/2237/9239
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 20:10:12.961810
Show All versions

Share

Mendeley CiteULike Twitter Facebook Print Addthis

Cite as

Export

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by CERN Data Centre & Invenio


Powered by CERN Data Centre & Invenio