首页 | 本学科首页   官方微博 | 高级检索  
     

重写系统的模块分解
引用本文:陈意云. 重写系统的模块分解[J]. 计算机学报, 1994, 17(3): 161-167
作者姓名:陈意云
作者单位:中国科学技术大学计算机科学与技术系
摘    要:Middeldorp和Toyama证明,强加构造原则到项重写系统可获得完备概念的模块性,并且系统分解成的各部分间可共亨函数符号和重量写规则。本文推广他们的结论,当构造性的项重写系统引用定义在其它系统中的函数符号时,完备概念的模块性仍保持。该结论对代数规范和基于项重写的编程语言等方面是很有意义的。

关 键 词:项重写系统 程序语言 代数规范

DECOMPOSING REWRITING SYSTEMS INTO MODULES
Chen Yiyun. DECOMPOSING REWRITING SYSTEMS INTO MODULES[J]. Chinese Journal of Computers, 1994, 17(3): 161-167
Authors:Chen Yiyun
Abstract:Middeldorp and Toyama showed that it is sufficient to impose the constructor discipline to term rewriting systems for obtaining the modularity of completeness and a constructor system may be decomposed into parts which possibly share function symbols and rewrite rules in order to infer completeness.This paper generalizes their conclusion.When constructor system refer to some function symbols defined in other systems,modularity of completeness are preserved.This conclusion is useful for algebraic specification and programming languages based on term rewriting.
Keywords:Term rewriting system  algebraic specification  completeness
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号