论文信息 - Final data type specifications: a new data type specification method

Final data type specifications: a new data type specification method

A new specification method for data types is presented, which is distinguished by the semantic objects it specifies. In particular, only final data types [GGM,W] are specifiable. A final data type is one in which no two elements are "input-output equivalent". It is argued that the mathematical properties of final data types characterize abstractness on the semantic level.Examples are given to show that final data type specifications are easy to construct and use.

Samuel N. Kamin

[1] Gilles Kahn,et al. The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[2] Mitchell Wand,et al. Final Algebra Semantics and Data Type Extensions , 1979, J. Comput. Syst. Sci..

[3] Ugo Montanari,et al. Observability Concepts in Abstract Data Type Specifications , 1976, MFCS.

[4] Robin Milner. Implementation and applications of Scott's logic for computable functions , 1972 .

[5] Manfred Broy,et al. Existential Quantifiers in Abstract Data Types , 1979, ICALP.

[6] Mary Shaw,et al. An introduction to the construction and verification of Alphard programs , 1976, ICSE '76.

[7] Jay Earley. Toward an understanding of data structures , 1970 .

[8] J. Vuillemin. Proof techniques for recursive programs , 1973 .

[9] Stephen N. Zilles,et al. Specification techniques for data abstractions , 1975 .

[10] Richard G. Hamlet,et al. The Structure of Specifications and Implementations of Data Abstractions. , 1979 .

[11] John V. Guttag,et al. The specification and application to programming of abstract data types. , 1975 .

[12] Ellis Horowitz,et al. Abstract data types and software validation , 1978, CACM.