Skip to main content
SpringerLink
Log in

Is setl a suitable language for parallel programming — a theoretical approach

  • Conference paper
  • First Online:
CSL '87 (CSL 1987)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Barwise, Admissible Sets and Structures, Springer, Berlin 1975

    Google Scholar 

  2. A. Chandra, D. Harel, Computable Queries of Relational Data Bases, JCSS 21.2 (1980), p. 156–178.

    Google Scholar 

  3. S. Cook, A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64 (1985), pp. 2–22.

    Google Scholar 

  4. E. Dahlhaus, J. Makowsky, Computable Directory Queries, CAAP 86, LNCS 214, pp. 254–265.

    Google Scholar 

  5. E. Dahlhaus, J. Makowsky, The Choice of Programming Primitives in SETL-Like Languages, ESOP 86, LNCS 213, pp. 160–172.

    Google Scholar 

  6. E. Dahlhaus, J. Makowsky, Gandy's Principles of Mechanism as a Model of Parallel Computation, to appear in "The Universal Turing Machine, a Half Century Survey", R. Herken ed., Kammerer und Unverzagt, Hamburg.

    Google Scholar 

  7. R. Gandy,Church's Thesis and Principles of Mechanism, in "The Kleene-Symposium", J. Barwise et al. ed, North Holland, Amsterdam 1980, pp. 123–148.

    Google Scholar 

  8. L. Goldschlager, The Monctone and Planar Circuit Value Problems are Logspace Complete for P, SIGACT News 9,2 (1977), pp. 25–29.

    Google Scholar 

  9. E. Horowitz, Fundamentals of Programming Languages, Computer Science Press, Rockville 1983.

    Google Scholar 

  10. Y. Moschovakis, Abstract Recursion as a Foundation for the Theory of Algorithms, "Computation and Proof Theory", M. Richter et al. ed., LNM 1104, Springer, Berlin 1984, pp. 289–362.

    Google Scholar 

  11. D. Norman, Set Recursion, in "Generalized Recursion Theory", J. Fensted et al. ed., North Holland, Amsterdam 1978, 303–320.

    Google Scholar 

  12. D. Rödding, Theorie der Rekusivität über dem Bereich der endlichen Mengen von endlichem Rang, Habilitationsschrift, Universität Münster 1964.

    Google Scholar 

  13. J. Schwartz, On Programming: An Interim Report on the SETL-Project, 2nd Edition, Courant Institute of Mathematics, New York 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bonn, Germany

    Elias Dahlhaus

Authors
  1. Elias Dahlhaus
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Hans Kleine Büning Michael M. Richter

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag

About this paper

Cite this paper

Dahlhaus, E. (1988). Is setl a suitable language for parallel programming — a theoretical approach. In: Börger, E., Büning, H.K., Richter, M.M. (eds) CSL '87. CSL 1987. Lecture Notes in Computer Science, vol 329. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50241-6_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-50241-6_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50241-8

  • Online ISBN: 978-3-540-45960-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation