依赖项重写系统及其在程序设计语言中的应用  

A DEPENDENCE TERM REWRITING SYSTEM AND ITS APPLICATIONS IN PROGRAMMING LANGUAGES

作　　者：杨继锋[1] 孙永强[1] 

机构地区：[1]上海交通大学计算机科学与工程系

出　　处：《计算机研究与发展》1999年第4期434-439,共6页Journal of Computer Research and Development

基　　金：国家"九五"科技攻关项目基金

摘　　要：项重写系统是一种简洁通用的计算模型，在许多领域中有着重要的应用．但是，在一些应用中，它不能很好地解决问题，为此，文中提出了一种新的项重写计算模型——依赖项重写系统，并给出了它在程序设计语言中的应用．直观上说，依赖项重写系统是重写规则之间存在着关于函数符号的依赖关系的项重写系统．这一模型具有较好的性质（例如，合流性、终止性等）和很强的表达能力．应用它，能够解决某些计算不终止问题，并有利于并行性的开发．Term rewriting system is a simple and powerful computing model and it has important applications in many fields. However, it cant satisfy certain requirements well in some applications. In order to solve these problems, a new kind of computing model, called dependence term rewriting system, and its applications in programming language are introduced in the paper. Intuitively, the dependence term rewriting system is a kind of term rewriting system in which there exists dependence relation by function symbol between rewriting rules. This computing model has good properties (e.g., confluence and termination) and powerful expressibility, and by using it certain non termination problems can be solved and more parallelism can be exploited.

关 键 词：项重写系统 程序设计语言 计算模型 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]