摘要
本文给出代数规范可计算实现的定义,证明了每一个可计算实现都可用特定的三元组来形式描述.在该定理的基础上,可进一步讨论可计算实现的性质.
This paper presents the definition of computable implementation of algebraic s pecification, and shows the theorem that every computable implementation can be formally specified by a special 3-tuple.On the basis of the theorem, we can further discuss other properties of computable implementation.
出处
《华东师范大学学报（自然科学版）》
CAS
CSCD
1991年第1期20-26,共7页
Journal of East China Normal University(Natural Science)
关键词
代数规范
可计算实现
程序设计语言
algebraic specification, abstract implementation partial recursive function computable implementation
