Advertisement

Set-theoretic concepts in programming languages and their implementation

  • Hans Jürgen Schneider
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 100)

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.

Keywords

Associative Memory Language Construct Existential Quantifier Machine Program Hardware Feature 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [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–180Google Scholar
  2. [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, 1980Google Scholar
  3. [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–49Google Scholar
  4. [4]
    K. Jensen/N. Wirth: "PASCAL user manual and report", New York: Springer 1978 (2nd ed.)Google Scholar
  5. [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–33Google Scholar
  6. [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–61Google Scholar
  7. [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., 1979Google Scholar
  8. [8]
    J. Schwartz: "Optimization of very high level languages", J. Computer Languages 1, 2 (1975), p. 161–194 and 1, 3 (1975), p. 197–218Google Scholar
  9. [9]
    A. van Wijngaarden et al.: "Report on the algorithmic language ALGOL 68", Numer. Math. 14 (1969), p. 79–218Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Hans Jürgen Schneider
    • 1
  1. 1.Lehrstuhl für ProgrammiersprachenErlangen

Personalised recommendations