Research performed under the auspices of the Italian CNR and MPI. This is a revised version of previous (unpublished) paper which circulated under the title: Finite Specification of Data Types with extra Operations.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J.A. GOGUEN, J.W. THATCHER, E.G. WAGNER and J.B. WRIGHT, Abstract data types as initial algebras and correctness of data representations, in Proceedings ACM Conference on Computer Graphics, Pattern Recognition and Data Structure, NY 1975, 89–93.
J.A. GOGUEN, J.W. THATCHER and E.G. WAGNER, An initial algebra approach to the specification, correctness and implementation of abstract data types, Current trends in Programming Methodology, Vol. 4: Data Structuring (R.T. Yeh, ed.), Prentice-Hall (1978), 80–149.
J.W. THATCHER, E.G. WAGNER and J.B. WRIGHT, Data type specification: parametrization and the power of specification technique, TOPLAS 4(4), 1982, 711–732.
H.P. BARENDREGT, The lambda calculus, its syntax and semantics, North-Holland, Amsterdam 1981.
J.A. BERGSTRA and J.V. TUCKER, On bounds for the specification of finite data types by means of equations and conditional equations, preprint IW 131/80 Amsterdam 1980.
J.A. BERGSTRA and J.V. TUCKER, Initial and final algebra semantics for data type specifications: two characterization theorems", SIAM J. of Computing 12 (1983), 366–387.
J.A. BERGSTRA and J.V. TUCKER, Algebraic specifications of Computable and Semicomputable Data Types, Department Computer Science Research Report CS-R8619, Amsterdam (May 1986).
H. EHRIG and B. MAHR, Fundamentals of Algebraic Specification 1, Monograph EATCS, Springer-Verlag 1985.
G. GRATZER, Universal Algebra, 2nd ed. Springer-Verlag, 1979.
J.R. HINDLEY and J.P. SELDIN (Eds.), To. H.B. Curry: Essays on combinatory logic, lambda-calculus and formalism, Academic Press, NY 1980.
B.H. LISKOV and S.M. ZILLES, Programming with Abstract Data Types, Proc. ACM Symp. on very high level languages, SIGPLAN Notices 9, (1974), 50–59.
B. LISKOV and S. ZILLES, Specification techniques for data abstractions, IEEE Transactions on Software Engineering 1 (1975), 7–19.
A.I. MAL'CEV, Constructive algebras I, The Metamathemathics of Algebraic Systems, Collected papers: 1936–1967, North-Holland.
G. MARONGIU and S. TULIPANI, Remarks on complexity in specifying computable types, in preparation.
J. MALITZ, Introduction to Mathematical Logic, Springer-Verlag, 1979.
M.O. RABIN, Colputable algebra, general theory and the theory of computable fields, Trans. Amer. Math. Soc. 95 (1960), 341–360.
M. WAND, Final algebra semantics and data type extensions, J. Computer and Ststems Sciences 19 (1979), 27–44.
S. ZILLES, An introduction to data algebras Lect. Notes in Comp. Sci. 86, (1979), 248–270.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marongiu, G., Tulipani, S. (1987). Finite algebraic specifications of semicomputable data types. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds) TAPSOFT '87. CAAP 1987. Lecture Notes in Computer Science, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17660-8_51
Download citation
DOI: https://doi.org/10.1007/3-540-17660-8_51
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17660-2
Online ISBN: 978-3-540-47746-4
eBook Packages: Springer Book Archive