Advertisement

On a relationship between programs of address machines and Mazurkiewicz algorithms

  • Zbigniew Raś
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)

Keywords

Formal Language Digital Computer Partial Function Full Subcategory Connective Relation 
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.
    Amoroso S., Bloom St., A model of a digital computer, Symposium on Computers and Automata, Brooklyn, 1971Google Scholar
  2. 2.
    de Backer J.W., Recursive procedures, Mathematical Center Tracts 24 Mathematisch Centrum Amsterdam, 1971Google Scholar
  3. 3.
    de Backer J.W., Scott D., A theory of programs in outline of join work by J.W. de Bakker and Dana Scott, Vienna 1979Google Scholar
  4. 4.
    Bartol W., Raś Z., Skowron A., Theory of computing systems, to appearGoogle Scholar
  5. 5.
    Blikle A., An extended approach to mathematical analysis of programs, CC PAS REPORTS, 1974Google Scholar
  6. 6.
    Cadiou J.M., Recursive definitions of partial functions and their computations, Stanford University, Report STAN-266-72Google Scholar
  7. 7.
    Eilenberg S., Automata, languages and machines, Volume A, Academic Press. 1974Google Scholar
  8. 8.
    Elgot C.C., Robinson A., Random-access stored-program machines, an approach, to programming languages, Journ. ASM, 11, 1964Google Scholar
  9. 9.
    Kalmar L., Les calculatrices automatiques comme structures algebriques, Previsions, calculs et realites, Paris 1965Google Scholar
  10. 10.
    Mazurkiewicz A., Proving algorithms by tail functions, Inf. Cont. 18, 220–226, 1971CrossRefGoogle Scholar
  11. 11.
    Mazurkiewicz A., Iteratively computable relations, Bull. Acad. Polon Sci., Ser. Sci. Math. Astronom. Phys. 20, 793–798, 1972Google Scholar
  12. 12.
    Mitchell B., Theory of categories, Academic Press, 1965Google Scholar
  13. 13.
    Pawlak Z., On the notion of a computer, Logic. Meth. and Phil. of Science, 255–267, 1968Google Scholar
  14. 14.
    Pawlak Z., A mathematical model of a digital computer, Proc. Conf. Theory of Autom. and Formal Lang., Boon 1973Google Scholar
  15. 15.
    Rasiowa H., On ω+-valued algorithmic logic and related problems, Supplement to Proc. of Symp. and Summer School on Mathematical Foundations of Computer Science, High Tatras, September 3–8, 1973Google Scholar
  16. 16.
    Raś Z., Classification of programs of SPC, Lectures Notes in Computer Science, 3rd Symposium at Jadwisin, June 17–22, 1974Google Scholar
  17. 17.
    Salwicki A., Formalized algorithmic languages, Bull. Acad. Polon. Sci., Ser. Math. Astronom. Phys. 18, 1972Google Scholar
  18. 18.
    Wagner E.G., Bounded action machines: toward an abstract theory of computer structure, Journ. of CSS, 2, 13–75, 1968.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Zbigniew Raś
    • 1
  1. 1.Institute of MathematicsUniversity of WarsawWarsawPoland

Personalised recommendations