论文信息 - Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities - 字舞流文

Initial and Terminal Algebra Semantics of Parameterized Abstract Data Type Specifications With Inequalities

A generalization of our terminal algebra semantics approach is presented. We then give a uniform initial/terminal semantics of parameterized data type specifications.

Peter Raulefs | Günter Hornung | P. Raulefs | G. Hornung

[1] Joseph A. Goguen,et al. Initial Algebra Semantics and Continuous Algebras , 1977, J. ACM.

[2] Manfred Broy,et al. Abstract Data Types as Lattices of Finitely Generated Models , 1980, MFCS.

[3] Samuel N. Kamin. Final data type specifications: a new data type specification method , 1980, POPL '80.

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

[5] Ellis Horowitz,et al. The design of data type specifications , 1976, ICSE '76.

[6] J. V. Tucker,et al. A natural data type with a finite equational final semantics specifcation, but no effective equational initial specification , 1979 .

[7] Hartmut Ehrig,et al. A Kernel Language for Algebraic Specification and Implementation , 1983, ADT.

[8] Hartmut Ehrig,et al. Parameter Passing in Algebraic Specification Languages , 1981, Theor. Comput. Sci..

[9] Peter Raulefs,et al. Terminal Algebra Semantics and Retractions for Abstract Data Types , 1980, ICALP.

[10] J. V. Tucker,et al. A natural data type with a finite equational final semantics specification but no effective equational initial semantics specification : (preprint) , 1980 .

[11] James W. Thatcher,et al. Data Type Specification: Parameterization and the Power of Specification Techniques , 1982, TOPL.