论文信息 - On a finite axiomatization of the data type L

On a finite axiomatization of the data type L

In the October '77 issue of SIGPLAN Notices Mile Majster [Ma77] discusses various alternatives to specifications of abstract data types, deliberates on the 'Limits of the "Algebraic" Specification of Abstract Data Types', and presents an example which she claims cannot be finitely axiomatised using algebraic specification techniques alone. It is the purpose of this note to make a conditional counter to this claim.

P. A. Subrahmanyam | P. Subrahmanyam | V. zv | Iz N Im

[1] Alfred Tarski,et al. Equational Logic and Equational Theories of Algebras , 1968 .

[2] Marvin Minsky,et al. Computation : finite and infinite machines , 2016 .

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

[4] Emil L. Post. Formal Reductions of the General Combinatorial Decision Problem , 1943 .

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

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