Specification of abstract data types with partially defined operations
暂无分享,去创建一个
We investigate equational inference rules for partial algebras and propose conditionally complete equational inference rules for partial algebras. Based on the results obtained from the investigation we propose a new algebraic specification technique for partial abstract data types. It requires no superfluous equations concerning undefinedness.
[1] Stephen N. Zilles,et al. Specification techniques for data abstractions , 1975 .
[2] J. A. Goguen,et al. Completeness of many-sorted equational logic , 1981, SIGP.
[3] Yuuji Sugiyama. A Specification Defined as an Extension of a Base Algebra , 1981 .
[4] Ellis Horowitz,et al. Abstract data types and software validation , 1978, CACM.
[5] J. D. Monk,et al. Mathematical Logic , 1976 .