摘要
本文考虑如何设计高效率(即重写步数较少的)重写型程序。文中以计算Fibonacci数列的程序为例,比较具有相同功能的重写型程序,展示编写高效率重写型程序的可能性。介绍利用动态项重写计算编写高效率重写型程序的直观、简洁的方法。其中,动态项重写计算是项重写系统的元计算模型,其计算同样基于项重写。
This paper considers how to design effective,that is,computes with less rewritingsteps,rewriting program- s. We use programs computing Fibonacci numbers as examples,compare the effectiveness of these programs, illustrate the possibility of designing effective rewritingprograms,and show how to use dynamic term rewriting calculus,a meta computation model of term rewriting systems whose computation is also based on term rewriting,to design efective programs naturally.
出处
《计算机科学》
CSCD
北大核心
2005年第2期150-152,共3页
Computer Science
基金
国家自然科学基金(60273015)
教育部留学回国人员科研启动基金
关键词
元计算
程序
设计
动态
系统
模型
高效率
编写
可能性
展示
Term rewriting systems
Effectiveness
Dynamic term rewriting calculus
Rewrite controlling
