ログイン
言語:

WEKO3

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

Field does not validate



インデックスリンク

インデックスツリー

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

WEKO

One fine body…

WEKO

One fine body…

アイテム

{"_buckets": {"deposit": "a0153ea0-a9c6-4a41-a093-99aa88a969d0"}, "_deposit": {"id": "9338", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "9338"}, "status": "published"}, "_oai": {"id": "oai:nagoya.repo.nii.ac.jp:00009338"}, "item_10_biblio_info_6": {"attribute_name": "\u66f8\u8a8c\u60c5\u5831", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2007", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "5", "bibliographicPageEnd": "431", "bibliographicPageStart": "407", "bibliographicVolumeNumber": "18", "bibliographic_titles": [{"bibliographic_title": "Applicable Algebra in Engineering, Communication and Computing"}]}]}, "item_10_description_4": {"attribute_name": "\u6284\u9332", "attribute_value_mlt": [{"subitem_description": "We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational models of functional programs. The primary advantage of our method is that one can exclude higher-order variables which are difficult to analyze theoretically, from recursive structure analysis. The key idea of our method is to analyze recursive structure from the viewpoint of strong computability. This property was introduced for proving termination in typed \u03bb-calculus, and is a stronger condition than the property of termination. The difficulty in incorporating this concept into recursive structure analysis is that because it is defined inductively over type structure, it is not closed under the subterm relation. This breaks the correspondence between strong computability and recursive structure. In order to guarantee the correspondence, we propose plain function-passing as a restriction, which is satisfied by many non-artificial functional programs.", "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/11112"}]}, "item_10_publisher_32": {"attribute_name": "\u51fa\u7248\u8005", "attribute_value_mlt": [{"subitem_publisher": "Springer-International"}]}, "item_10_select_15": {"attribute_name": "\u8457\u8005\u7248\u30d5\u30e9\u30b0", "attribute_value_mlt": [{"subitem_select_item": "author"}]}, "item_10_source_id_7": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "09381279", "subitem_source_identifier_type": "ISSN"}]}, "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": "\u8349\u5208, \u572d\u4e00\u6717"}], "nameIdentifiers": [{"nameIdentifier": "26678", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Kusakari, Keiichirou"}], "nameIdentifiers": [{"nameIdentifier": "26679", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "\u9152\u4e95, \u6b63\u5f66"}], "nameIdentifiers": [{"nameIdentifier": "26680", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Sakai, Masahiko"}], "nameIdentifiers": [{"nameIdentifier": "26681", "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-20"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "aaecc07.pdf", "filesize": [{"value": "164.0 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 164000.0, "url": {"label": "aaecc07.pdf", "url": "https://nagoya.repo.nii.ac.jp/record/9338/files/aaecc07.pdf"}, "version_id": "3ea5fd5f-2f4c-49c1-b208-7e67f0050050"}]}, "item_keyword": {"attribute_name": "\u30ad\u30fc\u30ef\u30fc\u30c9", "attribute_value_mlt": [{"subitem_subject": "Termination", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Simply-Typed Term Rewriting System", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Plain Function-Passing", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Dependency Pair", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Strong Computability", "subitem_subject_scheme": "Other"}]}, "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": "Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting", "item_titles": {"attribute_name": "\u30bf\u30a4\u30c8\u30eb", "attribute_value_mlt": [{"subitem_title": "Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting"}]}, "item_type_id": "10", "owner": "1", "path": ["312/313/314"], "permalink_uri": "http://hdl.handle.net/2237/11112", "pubdate": {"attribute_name": "\u516c\u958b\u65e5", "attribute_value": "2009-02-13"}, "publish_date": "2009-02-13", "publish_status": "0", "recid": "9338", "relation": {}, "relation_version_is_last": true, "title": ["Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting"], "weko_shared_id": 3}
  1. A500 情報学部/情報学研究科・情報文化学部・情報科学研究科
  2. A500a 雑誌掲載論文
  3. 学術雑誌

Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting

http://hdl.handle.net/2237/11112
dcc62b8a-c6ec-4119-aceb-ebfd0e704b8e
名前 / ファイル ライセンス アクション
aaecc07.pdf aaecc07.pdf (164.0 kB)
Item type 学術雑誌論文 / Journal Article(1)
公開日 2009-02-13
タイトル
タイトル Enhancing Dependency Pair Method using Strong Computability in Simply-Typed Term Rewriting
著者 草刈, 圭一朗

× 草刈, 圭一朗

WEKO 26678

草刈, 圭一朗

Search repository
Kusakari, Keiichirou

× Kusakari, Keiichirou

WEKO 26679

Kusakari, Keiichirou

Search repository
酒井, 正彦

× 酒井, 正彦

WEKO 26680

酒井, 正彦

Search repository
Sakai, Masahiko

× Sakai, Masahiko

WEKO 26681

Sakai, Masahiko

Search repository
キーワード
主題Scheme Other
主題 Termination
キーワード
主題Scheme Other
主題 Simply-Typed Term Rewriting System
キーワード
主題Scheme Other
主題 Plain Function-Passing
キーワード
主題Scheme Other
主題 Dependency Pair
キーワード
主題Scheme Other
主題 Strong Computability
抄録
内容記述 We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational models of functional programs. The primary advantage of our method is that one can exclude higher-order variables which are difficult to analyze theoretically, from recursive structure analysis. The key idea of our method is to analyze recursive structure from the viewpoint of strong computability. This property was introduced for proving termination in typed λ-calculus, and is a stronger condition than the property of termination. The difficulty in incorporating this concept into recursive structure analysis is that because it is defined inductively over type structure, it is not closed under the subterm relation. This breaks the correspondence between strong computability and recursive structure. In order to guarantee the correspondence, we propose plain function-passing as a restriction, which is satisfied by many non-artificial functional programs.
内容記述タイプ Abstract
出版者
出版者 Springer-International
言語
言語 eng
資源タイプ
資源タイプresource http://purl.org/coar/resource_type/c_6501
タイプ journal article
ISSN
収録物識別子タイプ ISSN
収録物識別子 09381279
書誌情報 Applicable Algebra in Engineering, Communication and Computing

巻 18, 号 5, p. 407-431, 発行日 2007
フォーマット
application/pdf
著者版フラグ
値 author
URI
識別子 http://hdl.handle.net/2237/11112
識別子タイプ HDL
戻る
0
views
See details
Views

Versions

Ver.1 2021-03-01 12:00:36.295511
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