Abstract
Questions of the control of dynamical memory in the Lispoid package are considered, which is used for processing list and tree-like structures. Separate attention is given to control of the stack memory. Descriptions of a basic collection of precedures over a stack, procedures over a stack of stacks, and a list stack are given.
Similar content being viewed by others
References
A. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Pub. Co., Reading, Mass., Don Mills, Ont. (1974).
V. A. Evstigneev, “An application of binary trees to an organization of large blocks of information,” Prikl. Informatika, No. 1, 170–211 (1981).
U. Maurer, An Introduction to Programming in the LISP Language [Russian translation], Mir, Moscow (1976).
O. V. Moseichuk and I. A. Perekhod, “Construction of geometric objects with the help of lists,” All-Union Seminar of Young Scientists and Specialists: Abstracts of Lectures, Nauka, Moscow (1986), pp. 141–142.
I. A. Perekhod, “On a package of programs for a dynamical structuring of information,” Memoirs of a Republican Seminar on Discrete Optimization, Institute of Cybernetics of the Acad, of Sciences of the Ukrainian SSR, Kiev (1985), pp. 20–25
I. A. Perekhod and S. F. Tolkachev, KODIAL/ES: Instructions for Users [in Russian], Institute of Cybernetics of the Acad, of Sciences of the Ukrainian SSR, Kiev (1978).
V. N. Pil'shchikov, Language PLÉNER [in Russian], Nauka, Moscow (1983).
Author information
Authors and Affiliations
Additional information
Translated from Dinamicheskie Sistemy, No. 7, pp. 146–151, 1988.
Rights and permissions
About this article
Cite this article
Perekhod, I.A., Moseichuk, O.V. Control of dynamic memory in the PAP Lispoid. J Math Sci 65, 1602–1605 (1993). https://doi.org/10.1007/BF01097672
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01097672