The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
HRS(고차 재작성 시스템) 및 STRS(단순 유형 용어 재작성 시스템)는 기능 프로그램의 계산 모델입니다. 우리는 최근 STRS의 종료를 증명하기 위해 강력한 계산 가능성 개념을 기반으로 하는 매우 강력한 방법인 정적 종속성 쌍 방법을 제안했습니다. 본 논문에서는 이 방법을 HRS로 확장합니다. HRS에는 람다 추상화가 포함되어 있지만 STRS에는 포함되어 있지 않기 때문에 우리는 람다 추상화를 허용하도록 정적 종속성 쌍 방법을 재구성하고 정적 종속성 쌍 방법이 새로운 제한 없이 HRS에서도 잘 작동함을 보여줍니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Keiichirou KUSAKARI, Yasuo ISOGAI, Masahiko SAKAI, Frederic BLANQUI, "Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems" in IEICE TRANSACTIONS on Information,
vol. E92-D, no. 10, pp. 2007-2015, October 2009, doi: 10.1587/transinf.E92.D.2007.
Abstract: Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include λ-abstraction but STRSs do not, we restructure the static dependency pair method to allow λ-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E92.D.2007/_p
부
@ARTICLE{e92-d_10_2007,
author={Keiichirou KUSAKARI, Yasuo ISOGAI, Masahiko SAKAI, Frederic BLANQUI, },
journal={IEICE TRANSACTIONS on Information},
title={Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems},
year={2009},
volume={E92-D},
number={10},
pages={2007-2015},
abstract={Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include λ-abstraction but STRSs do not, we restructure the static dependency pair method to allow λ-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.},
keywords={},
doi={10.1587/transinf.E92.D.2007},
ISSN={1745-1361},
month={October},}
부
TY - JOUR
TI - Static Dependency Pair Method Based on Strong Computability for Higher-Order Rewrite Systems
T2 - IEICE TRANSACTIONS on Information
SP - 2007
EP - 2015
AU - Keiichirou KUSAKARI
AU - Yasuo ISOGAI
AU - Masahiko SAKAI
AU - Frederic BLANQUI
PY - 2009
DO - 10.1587/transinf.E92.D.2007
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E92-D
IS - 10
JA - IEICE TRANSACTIONS on Information
Y1 - October 2009
AB - Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include λ-abstraction but STRSs do not, we restructure the static dependency pair method to allow λ-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.
ER -