Skip to main content
SpringerLink
Log in

Streams, Stream Transformers and Domain Representations

  • Chapter
  • First Online:
Prospects for Hardware Foundations

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1546))

Abstract

We present a general theory for the computation of stream transformers of the form F: (R → B) »r (T → A), where time T and R and data A and B, are discrete or continuous. We show how methods for representing topological algebras by algebraic domains can be applied to transformations of continuous streams. A stream transformer is continuous in the compact-open topology on continuous streams if and only if it has a continuous lifting to a standard algebraic domain representation of such streams. We also examine the important problem of representing discontinuous streams, such as signals T → A, where time T is continuous and data A is discrete

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. A. Anderson and E. R OSENFELD (eds.), Neurocomputing, MIT Press, 1988.

    Google Scholar 

  2. J. Blanck, Domain representability of metric spaces, Annals of Pure and Applied Logic 83 (1997), 225–247.

    Article  MATH  MathSciNet  Google Scholar 

  3. J. Blanck, Domain representations of topological spaces, U.U.D.M. Report 1997:26, 1997. Theoretical Computer Science, to appear.

    Google Scholar 

  4. 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–46.

    Google Scholar 

  5. V. Brattka, Recursive characterisation of computable real valued functions and relations, Theoretical Computer Science 162 (1996), 45–77.

    Article  MATH  MathSciNet  Google Scholar 

  6. M. Broy, F. Dederichs, C. Dendorfer, M. Fuchs, T. F. Gritzner and R. Weber, The design of distributed systems — An introduction to FOCUS, Technical Report TUM 19202-2, Institut für Informatik, Technical University Munich, 1993.

    Google Scholar 

  7. G. S. Ceitin, Algorithmic operators in constructive complete separable metric spaces, Doklady Akademii Nauk SSSR 128, 49–52, 1959.

    MathSciNet  Google Scholar 

  8. J. P. Crutchfield and K. Kaneko, Phenomenology of spatio-temporal chaos, in H Bai-lin (ed.), Directions in Chaos, World Scientific, 1987.

    Google Scholar 

  9. N. J. Cutland, Computability: An Introduction to Recursive Function Theory, Cambridge University Press, 1980.

    Google Scholar 

  10. 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.

    Google Scholar 

  11. 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–252.

    Google Scholar 

  12. Yu. L. Ershov, Theorie der Numerierungen III, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 23 (1977), 289–371.

    Article  MATH  Google Scholar 

  13. F. Fogelman Soulie, Y. Robert and M. Tchuente (eds.), Automata networks in computer science, Manchester University Press, 1986.

    Google Scholar 

  14. P. di Gianantonio, Real number computability an domain theory, Information and Computation 127 (1996) 11–25.

    Article  MATH  MathSciNet  Google Scholar 

  15. E. R. Griffor (ed.), Handbook of Computability Theory, Elsevier, to appear.

    Google Scholar 

  16. R. L. Grossman, A. Nerode, A. P. Ravn and H. Rischel (eds.), Hybrid Systems, Lecture Notes in Computer Science vol. 736, Springer-Verlag, 1993.

    Google Scholar 

  17. A. Grzegorczyk, Computable functionals, Fundamenta Mathematicae 42, 168–202, 1955.

    MATH  MathSciNet  Google Scholar 

  18. 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–396.

    Google Scholar 

  19. 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–262.

    Google Scholar 

  20. 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–304.

    Google Scholar 

  21. 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–108.

    Google Scholar 

  22. N. A. Harman and J. V. Tucker, Algebraic models of microprocessors: architecture and organisation, 33 (1996) 421–456.

    MATH  MathSciNet  Google Scholar 

  23. 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–169

    Google Scholar 

  24. 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–374.

    Google Scholar 

  25. 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–132.

    Google Scholar 

  26. 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–376.

    Google Scholar 

  27. G. Kahn, The semantics of a simple language for parallel processing, in Proceedings IFIP Congress 74, IFIP, 1974, 471–475

    MathSciNet  Google Scholar 

  28. K. Kaneko (ed.), Coupled Map Lattices-Theory and Applications, Wiley, 1993.

    Google Scholar 

  29. D. Lacombe, Extension de la notion de fonction récursive aux fonctions d’une ou plusieurs variables réelles I, II, III, Comptes Rendus de l’Académie des Sciences, Série A240, 2478–2480, and 241, 13–14, 151–153, 1955.

    MathSciNet  Google Scholar 

  30. A. I. Mal’cev, The Metamathematics of Algebraic Systems. Collected Papers: 1936–1967, North-Holland, Amsterdam, 1971, 148–212.

    Google Scholar 

  31. 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–62.

    Google Scholar 

  32. G. Megson, An introduction to systolic algorithm design, Oxford University Press, 1992.

    Google Scholar 

  33. K. Meinke and J. V. Tucker, Scope and limits of synchronous concurrent computation, in F. H. Vogt (ed.), Concurrency’ 88, Springer Lecture Notes in Computer Science 335, Springer-Verlag, 163–180.

    Google Scholar 

  34. Y. N. Moscoschovakis, Recursive metric spaces, Fundamenta Mathematicae 55 (1964), 215–238.

    MathSciNet  Google Scholar 

  35. D. Normann, The continuous functionals of finite types over the reals, manuscript, 1998.

    Google Scholar 

  36. M. J. Poole, J. V-Tucker and A. V. Holden, Hierarchies of spatially extended systems and synchronous concurrent algorithms, this volume.

    Google Scholar 

  37. M. B. Pour-El and J. I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer-Verlag, Berlin, 1989.

    MATH  Google Scholar 

  38. M. O. Rabin, Computable algebra, general theory and theory of computable fields, Transactions of the American Mathematical Society 95 (1960), 341–360.

    Article  MATH  MathSciNet  Google Scholar 

  39. A. Rabinovich, Automata over continuous time, manuscript, 1997.

    Google Scholar 

  40. H. Rogers, Jr, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.

    MATH  Google Scholar 

  41. R. Stephens, A survey of stream processing, Acta Informatica 34 (1997), 491–541.

    Article  MATH  MathSciNet  Google Scholar 

  42. V. Soltenberg-Hansen, I. Lindstrom and E. R. Griffor, Mathematical Theory of Domains, Cambridge University Press, 1994.

    Google Scholar 

  43. V. Stoltenberg-Hansen and J. V. Tucker, Complete local rings as domains, CTCS Report 1.85, University of Leeds, 1985.

    Google Scholar 

  44. V. Stoltenberg-Hansen and J. V. Tucker, Complete local rings as domains, Journal of Symbolic Logic 53 (1988), 603–624.

    Google Scholar 

  45. V. Stoltenberg-Hansen and J. V. Tucker, Algebraic and fixed point equations over inverse limits of algebras, Theoretical Computer Science 87 (1991), 1–24.

    Article  MATH  MathSciNet  Google Scholar 

  46. 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–562.

    Google Scholar 

  47. 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–526.

    Google Scholar 

  48. V. Stoltenberg-Hansen and J. V. Tucker, Concrete models of computation for topological algebras, Theoretical Computer Science, to appear.

    Google Scholar 

  49. V. Stoltenberg-Hansen and J. V. Tucker, Computable rings and fields, in E. R. Griffor (ed.), Handbook of Computability Theory, Elsevier, to appear.

    Google Scholar 

  50. 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.

    Google Scholar 

  51. B. Trakhtenbrot, Origins and metamorphoses of the Trinity: Logics, Nets, Automata, in Proceedings of Logic in Computer Science, IEEE Computer Society Press, 1995, 506–507.

    Google Scholar 

  52. J. V. Tucker and J. I. Zucker, Program Correctness over Abstract Data Types with Error-State Semantics, North-Holland, Amsterdam, 1988.

    MATH  Google Scholar 

  53. 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–80.

    Google Scholar 

  54. 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–382.

    Google Scholar 

  55. 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.

    Google Scholar 

  56. J. V. Tucker and J. I. Zucker, Computation by “While” programs on topological partial algebras, University of Wales Swansea Computer Science Report 10.97, 1997. Theoretical Computer Science, to appear.

    Google Scholar 

  57. K. Weihrauch, Computability, EATCS Monographs on Theoretical Computer Science 9, Springer-Verlag, Berlin, 1987.

    Google Scholar 

  58. G. J. Whitrow, The natural philosophy of time, Second Edition, 1980.

    Google Scholar 

  59. S. Wolfram (ed.), Theory and applications of cellular automata, World Scientific, Singapore, 1986.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics, Uppsala University, Box 480, SE-751 06, Uppsala, Sweden

    Jens Blanck & Viggo Stoltenberg-Hansen

  2. Dept. of Computer Science, University of Wales Swansea, Swansea, SA2 8PP, Wales

    John V. Tucker

Authors
  1. Jens Blanck
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Viggo Stoltenberg-Hansen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. John V. Tucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Augsburg, Universitätsstr. 14, D-86135, Augsburg, Germany

    Bernhard Möller

  2. Department of Computer Science, University of Wales at Swansea, Singleton Park, Swansea, SA2 8PP, Wales, UK

    John V. Tucker

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Blanck, J., Stoltenberg-Hansen, V., Tucker, J.V. (1998). Streams, Stream Transformers and Domain Representations. In: Möller, B., Tucker, J.V. (eds) Prospects for Hardware Foundations. Lecture Notes in Computer Science, vol 1546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49254-2_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-49254-2_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65461-2

  • Online ISBN: 978-3-540-49254-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation