This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
BLIKLE, A.; MAZURKIEWICZ, A. An algebraic approach to the theory of programs, algorithms, languages and recursiveness. Math. Found. Comp. Sci. I (Proc. Symp. Warsaw-Jabłonna 1972), Warsaw 1972
LESZCZYŁOWSKI, J. Mathematical theory of programs with dynamic allocation of variables. Ph.D. Thesis, in preparation
LESZCZYŁOWSKI, J. On equivalence of programs. Math. Found. Comp. Sci. III (Proc. Symp. Warsaw-Jadwisin 1974), Lecture Notes in Computer Science, Springer-Verlag, Heidelberg, (this volume)
MAZURKIEWICZ, A. Polyadic program schemes. ibid
MAZURKIEWICZ, A. Recursive algorithms and formal languages. Bull. Acad. Polon. Sci., Ser. Sci. Math. Phys. 20 (1972), 799–803
SCOTT, D.; STRACHEY, Ch. Toward a Mathematical Semantics for Computer Languages. Technical Monograph PRG-6, August 1971, Oxford University Computing Laboratory.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leszczyłowski, J. (1975). Mathematical model of programs with dynamic allocation of variables. In: Blikle, A. (eds) Mathematical Foundations of Computer Science. MFCS 1974. Lecture Notes in Computer Science, vol 28. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07162-8_699
Download citation
DOI: https://doi.org/10.1007/3-540-07162-8_699
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07162-4
Online ISBN: 978-3-540-37492-3
eBook Packages: Springer Book Archive