2002 Fiscal Year Final Research Report Summary
Strategies on functional languages
| Project/Area Number |
11680352
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Nagoya University |
|---|
Principal Investigator |
SAKAI Masahiro Grad.School of Engineering, Nagoya Univ., Prof., 工学研究科, 教授 (50215597)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
KASUYA Hideto Auchi Prefectural Univ., Research Associate, 情報科学部, 助手 (10295579)
TOYAMA Yoshihito Res.Inst.of Elect.Communi., Tohoku Univ., Prof., 電気通信研究所, 教授 (00251968)
SAKABE Toshiki Grad.School of Engineering, Nagoya Univ., Prof., 工学研究科, 教授 (60111829)
|
|---|
| Project Period (FY) |
1999 – 2002
|
| Keywords | term rewriting system / normalizing strategy / functional language |
|---|
| Research Abstract |
This research is toward removing gaps that prevent from applying results of term rewriting systems (TRSs for short) to factional languages. The following results were obtained ;
(1) Only TRSs having few rules can be decided whether they are NV-sequential in realistic execution time. The execution time of the calculating an index of a given term and a TRS is similar to the decision problem.
(2) We extended the notion of root indexes of TRSs to TRSs with priorities and construct a prototype system that efficiently caliculate indexes for head normal forms of strongly sequential priority TRSs.
(3) The strategy that reduce needed redex is normalizing.
(4) We showd a class of higher-order TRSs in which the dependency pair method, a mecanized proof technique of termination, is effective.
(5) The leftmost innermost reduction strategy is normalizing for terminating, right-linear and root over-lapping TRSs.
|
