[1] J., Blanck, V., Stoltenberg-Hansen, and J.V., Tucker, Domain representation of streams, In Möller and Tucker [20].

[2] H.J., Boehm, R., Cartwright, M., Riggle, andM.J. O'Donnell, Exact real arithmetic: A case study in higher programming, ACMsymposium on Lisp and functional programming, 1986.

[3] M.H., Escardó, Effective and sequential definition by cases on the reals via infinite signed-digit numerals, Electronic Notes in Theoretical Computer Science, vol. 13 (1998).Google Scholar

[4] S., Feferman, Computation on abstract data types: The extensional approach, with an application to streams, Annals of Pure & Applied Logic, vol. 81 (1996), pp. 75-113.Google Scholar

[5] J.E., Fenstad, Computability theory: Structure or algorithms, In this volume.

[6] J.A., Goguen, J.W., Thatcher, E.G., Wagner, and J.B., Wright, Initial algebra semantics and continuous algebras, Journal of the Association for Computing Machinery, vol. 24 (1977), pp. 68-95.Google Scholar

[7] J.V., Guttag and J.J., Horning, The algebraic specification of abstract data types, Acta Informatica, vol. 10 (1978), pp. 27-52.Google Scholar

[8] J., Heering, K., Meinke, B, Moller, and T, Nipkow (editors), Hoa –93: International workshop on higher-order algebra, logic and term rewriting, Lecture Notes in Computer Science, vol. 816, Springer- Verlag, 1994.

[9] C.R., Karp, Languages with expressions of infinite length, North Holland, 1964.

[10] J.R., Kennaway, J.W., Klop,M.R., Sleep, and F.J., de Vries, Transfinite reductions in orthogonal term rewriting systems, Information & Control, vol. 119 (1995), pp. 18-38.Google Scholar

[11] P., Kosiuczenko and K., Meinke, On the power of higher-order algebraic specification methods, Information & Computation, vol. 124 (1995), pp. 85-101.Google Scholar

[12] A.I., Mal'cev, Algebraic systems, Grundlehren der mathematischenWissenschaften, vol. 192, Springer-Verlag, 1973.

[13] K., Meinke, Universal algebra in higher types, Theoretical Computer Science, vol. 100 (1992), pp. 385-417.Google Scholar

[14] K., Meinke, Topological methods for algebraic specification, TheoreticalComputer Science, vol. 166 (1996), pp. 263-290.Google Scholar

[15] K., Meinke and J., Steggles, Specification and verification in higher order algebra: a case study of convolution, Higher order algebra, logic and term rewriting (J, Heering, K, Meinke, B, Moller, and TNipkow, editors), Lecture Notes inComputer Science, vol. 816, Springer-Verlag, 1994, pp. 189-222.

[16] K., Meinke and J.V., Tucker, Universal algebra, Handbook of logic in computer science (S., Abramsky, D., Gabbay, and T., Maibaum, editors), vol. 1, Oxford University Press, 1992, pp. 189- 411.

[17] J., Meseguer and J.A., Goguen, Initiality, induction and computability, Algebraic methods in semantics (M., Nivat and J., Reynolds, editors), Cambridge University Press, 1985, pp. 459-541.

[18] B., Möller, On the algebraic specification of infinite objects — ordered and continuous models of algebraic types, Acta Informatica, vol. 22 (1985), pp. 537-578.Google Scholar

[19] B., Möller, Higher-order algebraic specifications, Habilitationsschrift, Technische Universität München, 1987.

[20] B., Möller and J.V., Tucker (editors), Prospects for hardware foundations, Lecture Notes in Computer Science, vol. 1546, Springer-Verlag, 1998.

[21] Y.N., Moschovakis, The formal language of recursion, The Journal of Symbolic Logic, vol. 54 (1989), pp. 1216-1252.Google Scholar

[22] M.B., Pour-El and J.I., Richards, Computability in analysis and physics, Springer-Verlag, 1989.

[23] H., Rogers, Jr., Theory of recursive functions and effective computability,McGraw-Hill, 1967.

[24] R., Stephens, Asurvey of stream processing, Acta Informatica, vol. 34 (1997), pp. 491-541.Google Scholar

[25] V., Stoltenberg-Hansen and J.V., Tucker, Effective algebras, Handbook of logic in computer science (S., Abramsky, D., Gabbay, and T., Maibaum, editors), vol. 4, Oxford University Press, 1995, pp. 357-526.

[26] G., Takeuti, Proof theory (2nd ed.), North Holland, 1987.

[27] J.V., Tucker and J.I., Zucker, Program correctness over abstract data types, with error-state semantics, CWI Monographs, vol. 6, North Holland, 1988.

[28] J.V., Tucker and J.I., Zucker, Projections of semicomputable relations on abstract data types, International Journal of Foundations of Computer Science, vol. 2 (1991), pp. 267-296.Google Scholar

[29] J.V., Tucker and J.I., Zucker, Provable computable selection functions on abstract structures, Proof theory (P., Aczel, H., Simmons, and S.S., Wainer, editors), Cambridge University Press, 1993, pp. 277-306.

[30] J.V., Tucker and J.I., Zucker, Computable functions on stream algebras, Proof and computation: NATO Advanced Study Institute International Summer School at Marktoberdorf, 1993 (H., Schwichtenberg, editor), Springer-Verlag, 1994, pp. 341-382.

[31] J.V., Tucker and J.I., Zucker, Computation by ‘while’ programs on topological partial algebras, Theoretical Computer Science, vol. 219 (1999), pp. 379-420.Google Scholar

[32] J.V., Tucker and J.I., Zucker, Computable functions and semicomputable sets on many-sorted algebras, Handbook of logic in computer science (S., Abramsky, D., Gabbay, and T., Maibaum, editors), vol. 5, Oxford University Press, 2000, pp. 317-523.

[33] J.V., Tucker and J.I., Zucker, Abstract computability, algebraic specification and initiality, ACM Transactions on Computational Logic, (2001), To appear.

[34] W., Wechler, Universal algebra for computer scientists, EATCS Monographs, vol. 25, Springer-Verlag, 1992.

[35] K., Weihrauch, Computable analysis: An introduction, Springer-Verlag, 2000.

[36] E., Wiedmer, Computing with infinite objects, Theoretical Computer Science, vol. 10 (1980), pp. 133-155.Google Scholar

[37] M., Wirsing, Algebraic specification, Handbook of theoretical computer science, Vol. B: Formal methods and semantics (J., van Leeuwen, editor), North Holland, 1991, pp. 675-788.