{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:12:09Z","timestamp":1648955529040},"publisher-location":"Berlin, Heidelberg","reference-count":59,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540654612","type":"print"},{"value":"9783540492542","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49254-2_2","type":"book-chapter","created":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T11:12:19Z","timestamp":1196507539000},"page":"27-68","source":"Crossref","is-referenced-by-count":3,"title":["Streams, Stream Transformers and Domain Representations"],"prefix":"10.1007","author":[{"given":"Jens","family":"Blanck","sequence":"first","affiliation":[]},{"given":"Viggo","family":"Stoltenberg-Hansen","sequence":"additional","affiliation":[]},{"given":"John V.","family":"Tucker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,11]]},"reference":[{"key":"2_CR1","unstructured":"J. A. Anderson and E. R\n OSENFELD (eds.), Neurocomputing, MIT Press, 1988."},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0168-0072(96)00017-6","volume":"83","author":"J. Blanck","year":"1997","unstructured":"J. Blanck, Domain representability of metric spaces, Annals of Pure and Applied Logic 83 (1997), 225\u2013247.","journal-title":"Annals of Pure and Applied Logic"},{"key":"2_CR3","first-page":"26","volume":"1997","author":"J. Blanck","year":"1997","unstructured":"J. Blanck, Domain representations of topological spaces, U.U.D.M. Report 1997:26, 1997. Theoretical Computer Science, to appear.","journal-title":"U.U.D.M. Report"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"L. Blum, M. Shub and S. Smale, On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions, and universal machines, Bulletin of the American Mathematical Society 21 (1989), 1\u201346.","DOI":"10.1090\/S0273-0979-1989-15750-9"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(95)00249-9","volume":"162","author":"V. Brattka","year":"1996","unstructured":"V. Brattka, Recursive characterisation of computable real valued functions and relations, Theoretical Computer Science 162 (1996), 45\u201377.","journal-title":"Theoretical Computer Science"},{"key":"2_CR6","unstructured":"M. Broy, F. Dederichs, C. Dendorfer, M. Fuchs, T. F. Gritzner and R. Weber, The design of distributed systems \u2014 An introduction to FOCUS, Technical Report TUM 19202-2, Institut f\u00fcr Informatik, Technical University Munich, 1993."},{"key":"2_CR7","first-page":"49","volume":"128","author":"G. S. Ceitin","year":"1959","unstructured":"G. S. Ceitin, Algorithmic operators in constructive complete separable metric spaces, Doklady Akademii Nauk SSSR 128, 49\u201352, 1959.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"J. P. Crutchfield and K. Kaneko, Phenomenology of spatio-temporal chaos, in H Bai-lin (ed.), Directions in Chaos, World Scientific, 1987.","DOI":"10.1142\/9789814415712_0008"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"N. J. Cutland, Computability: An Introduction to Recursive Function Theory, Cambridge University Press, 1980.","DOI":"10.1017\/CBO9781139171496"},{"key":"2_CR10","unstructured":"S. M. Eker and J. V. Tucker, Specification and verification of synchronous concurrent algorithms: a case study of the Pixel Planes architecture, in P. M. Dew et al. (eds.), Parallel processing for computer vision and display, Addison-Wesley."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"S. M. Eker, V. Stavridou and J. V. Tucker, Verification of synchronous con-current algorithms using OBJ3. A case study of the Pixel Planes architecture, in G Jones and M Sheeran (eds.), Designing Correct Circuits, Springer, 1991, 231\u2013252.","DOI":"10.1007\/978-1-4471-3544-9_13"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19770231902","volume":"23","author":"Yu. L. Ershov","year":"1977","unstructured":"Yu. L. Ershov, Theorie der Numerierungen III, Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik 23 (1977), 289\u2013371.","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"2_CR13","unstructured":"F. Fogelman Soulie, Y. Robert and M. Tchuente (eds.), Automata networks in computer science, Manchester University Press, 1986."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1006\/inco.1996.0046","volume":"127","author":"P. Gianantonio di","year":"1996","unstructured":"P. di Gianantonio, Real number computability an domain theory, Information and Computation 127 (1996) 11\u201325.","journal-title":"Information and Computation"},{"key":"2_CR15","unstructured":"E. R. Griffor (ed.), Handbook of Computability Theory, Elsevier, to appear."},{"key":"2_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Hybrid Systems","year":"1993","unstructured":"R. L. Grossman, A. Nerode, A. P. Ravn and H. Rischel (eds.), Hybrid Systems, Lecture Notes in Computer Science vol. 736, Springer-Verlag, 1993."},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"168","DOI":"10.4064\/fm-42-1-168-202","volume":"42","author":"A. Grzegorczyk","year":"1955","unstructured":"A. Grzegorczyk, Computable functionals, Fundamenta Mathematicae 42, 168\u2013202, 1955.","journal-title":"Fundamenta Mathematicae"},{"key":"2_CR18","unstructured":"N. A. Harman and J. V. Tucker, Clocks, retimings, and the formal specification of a UART, in G Milne (ed.), The fusion of hardware design and verification(Proceedings of IFIP Working Group 10.2 Working Conference), North-Holland, 375\u2013396."},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"N. A. Harman and J. V. Tucker, The formal specification of a digital correlator I: User specification process, in K McEvoy and J V Tucker (eds.), Theoretical foundations of VLSI design, Cambridge University Press, 1990, 161\u2013262.","DOI":"10.1017\/CBO9780511569838.008"},{"key":"2_CR20","first-page":"281","volume-title":"Proceedings of ESPRIT BRA CHARME Advanced Research Workshop on Correct hardware design methodologies","author":"N. A. Harman","year":"1991","unstructured":"N. A. Harman and J. V. Tucker, Consistent refinements of specifications for digital systems, in: P Prinetto and P Camurati (eds.), Proceedings of ESPRIT BRA CHARME Advanced Research Workshop on Correct hardware design methodologies, Elsevier, Amsterdam, 1991, 281\u2013304."},{"key":"2_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/BFb0021717","volume-title":"Correct hardware design and verification methods (Proceedings of IFIP Working Group 10.2","author":"N. A. Harman","year":"1993","unstructured":"N. A. Harman and J. V. Tucker, Algebraic models computers and the correctness of micro processors, in G J Milne and L Pierre (eds.), Correct hardware design and verification methods (Proceedings of IFIP Working Group 10.2, May 1993), Springer Lecture Notes in Computer Science 683, Berlin, 1993, 92\u2013108."},{"key":"2_CR22","first-page":"421","volume":"33","author":"N. A. Harman","year":"1996","unstructured":"N. A. Harman and J. V. Tucker, Algebraic models of microprocessors: architecture and organisation, 33 (1996) 421\u2013456.","journal-title":"Algebraic models of microprocessors: architecture and organisation"},{"key":"2_CR23","unstructured":"N. A. Harman and J. V. Tucker, Algebraic models of microprocessors: the verification of a simple computer, in V Stavridou (ed.), Mathematics for dependable systems II, Proceedings of the Second IMA Conference, Oxford University Press, 1997, 135\u2013169"},{"key":"2_CR24","unstructured":"K. M. Hobley, B. C. Thompson and J. V. Tucker, Specification and verification of synchronous concurrent algorithms: a case study of a convolution algorithm, in G Milne (ed.), The fusion of hardware design and verification (Proceedings of IFIP Working Group 10.2 Working Conference), North-Holland, 347\u2013374."},{"key":"2_CR25","unstructured":"K. Hobley and J. V. Tucker, Clocks, retimings and the transformation of synchronous concurrent algorithms. in G Megson (ed.), Transformational approaches to systolic design, Chapman Hall, 1994, 99\u2013132."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"A. V. Holden, J. V. Tucker, H. Zhang and M. Poole, Coupled map lattices as computational systems, American Institute of Physics-Chaos 2 (1992) 367\u2013376.","DOI":"10.1063\/1.165879"},{"key":"2_CR27","first-page":"471","volume":"74","author":"G. Kahn","year":"1974","unstructured":"G. Kahn, The semantics of a simple language for parallel processing, in Proceedings IFIP Congress 74, IFIP, 1974, 471\u2013475","journal-title":"Proceedings IFIP Congress"},{"key":"2_CR28","unstructured":"K. Kaneko (ed.), Coupled Map Lattices-Theory and Applications, Wiley, 1993."},{"issue":"240","key":"2_CR29","first-page":"2478","volume":"A","author":"D. Lacombe","year":"1955","unstructured":"D. Lacombe, Extension de la notion de fonction r\u00e9cursive aux fonctions d\u2019une ou plusieurs variables r\u00e9elles I, II, III, Comptes Rendus de l\u2019Acad\u00e9mie des Sciences, S\u00e9rie A240, 2478\u20132480, and 241, 13\u201314, 151\u2013153, 1955.","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences"},{"key":"2_CR30","first-page":"148","volume-title":"The Metamathematics of Algebraic Systems. Collected Papers: 1936\u20131967","author":"A. I. Malcev","year":"1971","unstructured":"A. I. Mal\u2019cev, The Metamathematics of Algebraic Systems. Collected Papers: 1936\u20131967, North-Holland, Amsterdam, 1971, 148\u2013212."},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"K. McEvoy and J. V. Tucker, Theoretical foundations of hardware design, in K McEvoy and J. V. Tucker (eds)., Theoretical foundations of VLSI design, Cambridge University Press, 1990, 1\u201362.","DOI":"10.1017\/CBO9780511569838.002"},{"key":"2_CR32","unstructured":"G. Megson, An introduction to systolic algorithm design, Oxford University Press, 1992."},{"key":"2_CR33","unstructured":"K. Meinke and J. V. Tucker, Scope and limits of synchronous concurrent computation, in F. H. Vogt (ed.), Concurrency\u2019 88, Springer Lecture Notes in Computer Science 335, Springer-Verlag, 163\u2013180."},{"key":"2_CR34","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4064\/fm-55-3-215-238","volume":"55","author":"Y. N. Moscoschovakis","year":"1964","unstructured":"Y. N. Moscoschovakis, Recursive metric spaces, Fundamenta Mathematicae 55 (1964), 215\u2013238.","journal-title":"Fundamenta Mathematicae"},{"key":"2_CR35","unstructured":"D. Normann, The continuous functionals of finite types over the reals, manuscript, 1998."},{"key":"2_CR36","unstructured":"M. J. Poole, J. V-Tucker and A. V. Holden, Hierarchies of spatially extended systems and synchronous concurrent algorithms, this volume."},{"key":"2_CR37","doi-asserted-by":"crossref","volume-title":"Computability in Analysis and Physics","author":"M. B. Pour-El","year":"1989","unstructured":"M. B. Pour-El and J. I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1989.","DOI":"10.1007\/978-3-662-21717-7"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"341","DOI":"10.2307\/1993295","volume":"95","author":"M. O. Rabin","year":"1960","unstructured":"M. O. Rabin, Computable algebra, general theory and theory of computable fields, Transactions of the American Mathematical Society 95 (1960), 341\u2013360.","journal-title":"Transactions of the American Mathematical Society"},{"key":"2_CR39","unstructured":"A. Rabinovich, Automata over continuous time, manuscript, 1997."},{"key":"2_CR40","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr","year":"1967","unstructured":"H. Rogers, Jr, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967."},{"key":"2_CR41","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s002360050095","volume":"34","author":"R. Stephens","year":"1997","unstructured":"R. Stephens, A survey of stream processing, Acta Informatica 34 (1997), 491\u2013541.","journal-title":"Acta Informatica"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"V. Soltenberg-Hansen, I. Lindstrom and E. R. Griffor, Mathematical Theory of Domains, Cambridge University Press, 1994.","DOI":"10.1017\/CBO9781139166386"},{"key":"2_CR43","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Complete local rings as domains, CTCS Report 1.85, University of Leeds, 1985."},{"key":"2_CR44","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1017\/S0022481200028498","volume":"53","author":"V. Stoltenberg-Hansen","year":"1988","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Complete local rings as domains, Journal of Symbolic Logic 53 (1988), 603\u2013624.","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR45","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(06)80002-2","volume":"87","author":"V. Stoltenberg-Hansen","year":"1991","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Algebraic and fixed point equations over inverse limits of algebras, Theoretical Computer Science 87 (1991), 1\u201324.","journal-title":"Theoretical Computer Science"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Infinite systems of equations over inverse limits and infinite synchronous concurrent algorithms, in J. W. de Bakker and W.-P. de Roever and G. Rozenberg (eds.), Semantics-Foundations and Applications. Lecture Notes in Computer Science vol 666, 1993, 531\u2013562.","DOI":"10.1007\/3-540-56596-5_46"},{"key":"2_CR47","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Effective algebra, in S. Abramsky et al. (eds.), Handbook of Logic in Computer Science, vol. IV, Oxford University Press, 1995, 357\u2013526."},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Concrete models of computation for topological algebras, Theoretical Computer Science, to appear.","DOI":"10.1016\/S0304-3975(98)00296-5"},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"V. Stoltenberg-Hansen and J. V. Tucker, Computable rings and fields, in E. R. Griffor (ed.), Handbook of Computability Theory, Elsevier, to appear.","DOI":"10.1016\/S0049-237X(99)80028-7"},{"key":"2_CR50","unstructured":"B. C. Thompson and J. V. Tucker, Equational specification of synchronous concurrent algorithms and architectures, Computer Division Research Report CSR 9-91, University College of Swansea, 1991Second Edition1994."},{"key":"2_CR51","doi-asserted-by":"crossref","unstructured":"B. Trakhtenbrot, Origins and metamorphoses of the Trinity: Logics, Nets, Automata, in Proceedings of Logic in Computer Science, IEEE Computer Society Press, 1995, 506\u2013507.","DOI":"10.1109\/LICS.1995.523284"},{"key":"2_CR52","volume-title":"Program Correctness over Abstract Data Types with Error-State Semantics","author":"J. V. Tucker","year":"1988","unstructured":"J. V. Tucker and J. I. Zucker, Program Correctness over Abstract Data Types with Error-State Semantics, North-Holland, Amsterdam, 1988."},{"key":"2_CR53","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-55808-X_6","volume-title":"Mathematical Foundations of Computer Science","author":"J. V. Tucker","year":"1992","unstructured":"J. V. Tucker and J. I. Zucker, Theory of computation over stream algebras, and its applications, inI. M. Havel and V. Koubek (eds.), Mathematical Foundations of Computer Science 1992, 17th International Symposium, Prague, Springer Lecture Notes in Computer Science 629, Berlin, 62\u201380."},{"key":"2_CR54","unstructured":"J. V. Tucker and J. I. Zucker, Computable functions on stream algebras, in H. Schwichtenberg (ed.), Proof and Computation, Proceedings of NATO Advanced Study Institute, International Summer School 1993 at Marktoberdorf, Springer, 1994, 341\u2013382."},{"key":"2_CR55","unstructured":"J. V. Tucker and J. I. Zucker, Computable functions and semicomputable sets on many sorted algebras, in S. Abramsky et al. (eds.), Handbook of Logic in Computer Science, vol. V, Oxford University Press, to appear."},{"key":"2_CR56","unstructured":"J. V. Tucker and J. I. Zucker, Computation by \u201cWhile\u201d programs on topological partial algebras, University of Wales Swansea Computer Science Report 10.97, 1997. Theoretical Computer Science, to appear."},{"key":"2_CR57","volume-title":"EATCS Monographs on Theoretical Computer Science","author":"K. Weihrauch","year":"1987","unstructured":"K. Weihrauch, Computability, EATCS Monographs on Theoretical Computer Science 9, Springer-Verlag, Berlin, 1987."},{"key":"2_CR58","unstructured":"G. J. Whitrow, The natural philosophy of time, Second Edition, 1980."},{"key":"2_CR59","volume-title":"Theory and applications of cellular automata","year":"1986","unstructured":"S. Wolfram (ed.), Theory and applications of cellular automata, World Scientific, Singapore, 1986."}],"container-title":["Prospects for Hardware Foundations","Lecture Notes in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49254-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,26]],"date-time":"2019-02-26T03:26:58Z","timestamp":1551151618000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49254-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540654612","9783540492542"],"references-count":59,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-49254-2_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"published":{"date-parts":[[1998]]}}}