Skip to main content
SpringerLink
Log in

Set-theoretic concepts in programming languages and their implementation

  • Conference paper
  • First Online:
Graphtheoretic Concepts in Computer Science (WG 1980)

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

Included in the following conference series:

Abstract

After an introduction, we review two fundamentally different set-theoretic concepts in programming languages. These concepts differ in the capabilities of the language constructs as well as in the efficiency of implementation. Then, we combine these concepts to new language constructs and propose an efficient implementation using associative array processors.

The implementation mentioned in Sect. 5, is supported by the German Federal Government (DV 4.906 - 081 2070)

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. Backus: "The history of FORTRAN I, II, and III", Proc. Conf. History of Programming Languages (Los Angeles, June 1978) = ACM SIGPLAN 13, 8 (1978), p. 165–180

    Google Scholar 

  2. A. Bode: "Probleme der Emulation unkonventioneller Rechnerarchitekturen: Pseudoassoziative Verarbeitung im Projekt EGPA", Proc. GI-NTG-Fachtagung Struktur und Betrieb von Rechensystemen (Kiel, March 1980) = Informatik-Fachberichte Bd. 27, p. 138–148, Berlin: Springer, 1980

    Google Scholar 

  3. R.B.K. Dewar et al.: "Programming by refinement, as exemplified by the SETL representation sublanguage", ACM Transactions Programming Languages Systems 1, 1 (1979), p. 27–49

    Google Scholar 

  4. K. Jensen/N. Wirth: "PASCAL user manual and report", New York: Springer 1978 (2nd ed.)

    Google Scholar 

  5. L. Lamport: "On programming parallel computers", Proc. Conf. Programming Languages and Compilers for Parallel and Vector Machines (New York, March 1975) = ACM SIGPLAN Not. 10, 3 (1975), p. 25–33

    Google Scholar 

  6. H.K. Resnick/A.G. Larson: "DMAP-A COBOL extension for associative array processors", Proc. Conf. Programming Languages and Compilers for Parallel and Vector Machines (New York, March 1975) = ACM SIGPLAN Not. 10, 3 (1975), p. 54–61

    Google Scholar 

  7. E. Schonberg et al.: "Automatic data structure selection in SETL", Proc. 6th Annual ACM Symposium Principles of Programming Languages (San Antonio, Jan. 1979), p. 197–210, New York: Assoc. for Comput. Mach., 1979

    Google Scholar 

  8. J. Schwartz: "Optimization of very high level languages", J. Computer Languages 1, 2 (1975), p. 161–194 and 1, 3 (1975), p. 197–218

    Google Scholar 

  9. A. van Wijngaarden et al.: "Report on the algorithmic language ALGOL 68", Numer. Math. 14 (1969), p. 79–218

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lehrstuhl für Programmiersprachen, Martensstraße 3, D-8520, Erlangen

    Hans Jürgen Schneider

Authors
  1. Hans Jürgen Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hartmut Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, H.J. (1981). Set-theoretic concepts in programming languages and their implementation. In: Noltemeier, H. (eds) Graphtheoretic Concepts in Computer Science. WG 1980. Lecture Notes in Computer Science, vol 100. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10291-4_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-10291-4_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10291-5

  • Online ISBN: 978-3-540-38435-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation