Minimal term rewriting systems

被引：0
作者：
Kamperman, JFT
Walters, HR
机构：
来源：
RECENT TRENDS IN DATA TYPE SPECIFICATION | 1996年 / 1130卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented, under which an MTRS can be said to simulate a TRS. The MTRS rules can be directly interpreted as instructions for an extremely simple Abstract Rewriting Machine (ARM). Favourable practical results have already been obtained with an earlier version of ARM.
引用
收藏
页码：274 / 290
页数：17
相关论文
共 20 条
  • [1] Aho Alfred V., 2007, COMPILERS PRINCIPLES
  • [2] TERM-REWRITING SYSTEMS WITH RULE PRIORITIES
    BAETEN, JCM
    BERGSTRA, JA
    KLOP, JW
    WEIJLAND, WP
    [J]. THEORETICAL COMPUTER SCIENCE, 1989, 67 (2-3) : 283 - 301
  • [3] COUSINEAU G, 1985, LECT NOTES COMPUT SC, V201, P50
  • [4] DERSHOWITZ N, 1991, LECT NOTES COMPUT SC, V488, P445
  • [5] FAIRBAIRN J, 1987, LECT NOTES COMPUT SC, V274, P34
  • [6] COMPILATION OF FUNCTIONAL LANGUAGES BY PROGRAM TRANSFORMATION
    FRADET, P
    LEMETAYER, D
    [J]. ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1991, 13 (01): : 21 - 51
  • [7] HARTEL PH, 1996, IN PRESS J FUNCTIONA
  • [8] PATTERN-MATCHING IN TREES
    HOFFMANN, CM
    ODONNELL, MJ
    [J]. JOURNAL OF THE ACM, 1982, 29 (01) : 68 - 95
  • [9] JONES SLP, 1989, FPCA 89, P184
  • [10] KAMPERMAN JFT, 1993, COMPUTING SCI NETHER, P193
12