Presentation 2003/3/11
変換パターンに基づく高階プログラム変換
Toshitaka TSURUKAWA, Keiichirou KUSAKARI, Yoshihito TOYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In the program transformation based on patterns, we can get a new program by computing a substitution of matching problem for the transformation patterns. So far the matching algorithm computes all the second order substitutions of a matching problem. However, it is not necessary to compute all the solutions in the program transformation. in this paper, we improve their algorithm without computing redundant substitutions. Furthermore, we show that our improved algorithm can be effectively applied to higher order program transformations.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Transformation Pattern / Higher Order Program Transformation / Matching
Paper # COMP2002-83
Date of Issue

Conference Information
Committee COMP
Conference Date 2003/3/11(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English)
Sub Title (in English)
Keyword(1) Transformation Pattern
Keyword(2) Higher Order Program Transformation
Keyword(3) Matching
1st Author's Name Toshitaka TSURUKAWA
1st Author's Affiliation Research Institute of Electrical Communication, Tohoku University()
2nd Author's Name Keiichirou KUSAKARI
2nd Author's Affiliation Research Institute of Electrical Communication, Tohoku University
3rd Author's Name Yoshihito TOYAMA
3rd Author's Affiliation Research Institute of Electrical Communication, Tohoku University
Date 2003/3/11
Paper # COMP2002-83
Volume (vol) vol.102
Number (no) 733
Page pp.pp.-
#Pages 8
Date of Issue