摘要
本文提出抽象数据类型的代数规格说明的一种新的语义。以该语义为基础,讨论代数方法的说明能力,并证明:所有部分可计算代数都存在代数规格说明。最后,文章还将论证代数规格说明的充分完备性、协调性、独立性的不可判定性。
This paper begins by presenting a new semantics of algebraic specification of abstract
data types,It then proceeds to discuss the power of the algebraic method and prove that the
partially-computable algebras can be specified by the method.Finally,it also shows that the
sufficient-completeness,consistency and independency of algebraic specifications are all undecidable
出处
《计算机研究与发展》
EI
CSCD
北大核心
1991年第7期6-11,共6页
Journal of Computer Research and Development
