论文信息 - Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability - 字舞流文

Final Algebras, Cosemicomputable Algebras, and Degrees of Unsolvability

José Meseguer | Joseph A. Goguen | Lawrence S. Moss | J. Goguen | J. Meseguer | L. Moss

[1] José Meseguer,et al. Initiality, induction, and computability , 1986 .

[2] Jan A. Bergstra,et al. Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems , 1983, SIAM J. Comput..

[3] J. A. Goguen,et al. Completeness of many-sorted equational logic , 1981, SIGP.

[4] J. A. Bergstra,et al. I/O-computable data structures , 1981, SIGP.

[5] Jan A. Bergstra,et al. A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method , 1980, ICALP.

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

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

[8] D. C. Cooper,et al. Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[9] A. I. Mal'tsev. CONSTRUCTIVE ALGEBRAS I , 1961 .

[10] M. Rabin. Computable algebra, general theory and theory of computable fields. , 1960 .

[11] G. Huet,et al. Equations and rewrite rules: a survey , 1980 .

[12] Mila E. Majster,et al. Data types, abstract data types and their specification problem , 1979 .

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