Skip to main content
SpringerLink
Log in

Relational definition of computer languages

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975 (MFCS 1975)

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

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. D.M. Berry: Block Structure: Retention or Deletion? Proc.Third Annual ACM Symp.on Theory of Computing, Shaker Heights, Ohio, May 3–5, 1971

    Google Scholar 

  2. H.Ehrig, M. Pfender, H.J. Schneider: Graph Grammars: An Algebraic Approach, Proc. 1973 IEEE Conf. on Switching and Automata Theory, Iowa City, Iowa, pp.167–180

    Google Scholar 

  3. R.W. Floyd: Assigning Meanings to Programs, Proc. of a Symp. on Appl.Math., Amer.Math.Soc.19, 1967, pp.19–32

    Google Scholar 

  4. C.A.R.Hoare: Proof of a Structured Program: The Sieve of Eratosthenes, The Computer J.15, pp.321–325

    Google Scholar 

  5. C.A.R. Hoare: Proof of a Program: FIND, Comm. of ACM 14, pp.39–45

    Google Scholar 

  6. C.A.R. Hoare, P.E. Lauer: Consistent and Complementary Formal Theories of the Semantics of Programming languages, Acta Inf.3, pp.135–153

    Google Scholar 

  7. J.B. Johnston: The Contour Model of Block Structured Processes, Proc. of ACM Symp. on Data Structures in Progr. Lang., SIGPLAN notices, Feb.1971

    Google Scholar 

  8. D.E. Knuth: Semantics of Context-Free Languages, Math.Syst.Theor. 2, pp. 127–145

    Google Scholar 

  9. A.A. Markov: Teorija algoritmov, Trudy matematičeskogo instituta imeni V.A.Steklova, 36, pp.176–189 (in Russian)

    Google Scholar 

  10. P. Naur, ed.: Revised Report on the Algorithmic Language ALGOL 60, Comm. of ACM 6, pp.1–17

    Google Scholar 

  11. P. Naur: Proof of algorithms by general snapshots, BIT 6, pp.310–316

    Google Scholar 

  12. V. Rajlich: Relational Structures and Dynamics of Certain Discrete Systems, Proc. Symp. Math. Foundations of Computer Sci., High Tatras, Czechoslovakia, Sept. 3–8, 1973, pp.285–292

    Google Scholar 

  13. V. Rajlich: Dynamics of Certain Discrete Systems and Self-Reproduction of Patterns, Proc. Conf. on Biologically Motivated Automata Th., McLean, Virginia, June 19–21, 1974, pp.192–198.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Institute for Mathematical Machines, Lužná 2, 160 00, Praha 6, Czechoslovakia

    Václav Rajlich

Authors
  1. Václav Rajlich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jíří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rajlich, V. (1975). Relational definition of computer languages. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1975 4th Symposium, Mariánské Lázně, September 1–5, 1975. MFCS 1975. Lecture Notes in Computer Science, vol 32. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07389-2_222

Download citation

  • DOI: https://doi.org/10.1007/3-540-07389-2_222

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation