Advertisement

Modular approach to the logical theory of programs

  • L. Banachowski
Theory Of Programs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 28)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    RASIOWA, H; SIKORSKI, R. Mathematics of metamathematics. Polish Scientific Publishers. Warsaw, 1968.Google Scholar
  2. [2]
    SALWICKI, A. Formalized algorithmic languages. Bull.Acad.Polon.Sci.,Ser.Sci.Math.Astronom.Phys. 18(1970), 227–232.Google Scholar
  3. [3]
    KRECZMAR,A. Effectivity problems of algorithmic logic. 2-nd Colloquium on Automata, Languages and Programming. Lecture notes on Computer Science,No.14,Springer Verlag, 1974.Google Scholar
  4. [4]
    FLOYD,R.W. Assigning meanings of programs. Proc.Sym.in Applied Math. 19 (1967). in Mathematical aspects of Computer Science, American Mathematical Society.Google Scholar
  5. [5]
    HOARE, C.A.R. An axiomatic basis of computer programming. Comm.ACM 12 (1969), 576–583.Google Scholar
  6. [6]
    MANNA, Z. The correctness of programs. J.Comp.Syst.Sci. 3 (1969), 119–127.Google Scholar
  7. [7]
    BANACHOWSKI, L. Extended algorithmic logic and its properties. to appear in Bull.Acad.Polon.Sci.,Ser.Sci.Math.Astronom.Phys.Google Scholar
  8. [8]
    MIRKOWSKA,M. Algorithmic logic and its applications in the theory of programs. Doct.Diss. Warsaw 1972 /in Polish/.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • L. Banachowski
    • 1
  1. 1.Institute of Mathematical Machines Warsaw UniversityPoland

Personalised recommendations