Traversable stack with fewer errors
暂无分享,去创建一个
A complete finite "algebraic" specification for a version of traversable stack with fewer error conditions is presented. This is used to illustrate some issues concerning formal specification of data types, namely naturalness and clarity. Uncontrolled errors are considered harmful and canonical-term specifications are considered helpful.
[1] R. L. Wexelblat,et al. New books III , 1978, SIGP.
[2] John V. Guttag,et al. Abstract data types and the development of data structures , 1977, CACM.
[3] D. R. Ditzel,et al. Mask and format: operators for editing and formatting , 1977, SIGP.
[4] Michael R. Levy,et al. Some remarks on abstract data types , 1977, SIGP.