Abstract
We describe a model of high-level functional programming languages with complex data structures. A special apparatus is proposed for the description of structured data. A method is developed for definition of functions on such data by reduction.
Similar content being viewed by others
References
V. V. Byts' and R. M. Zulunov, Recursive Specifications of Problems with Complex Data Structures [in Russian], Kiev (1983). Unpublished manuscript, UkrNIINTI No. 1367 UkD83.
J. Backus, “Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,” Comm. ACM, No. 8, 613–641 (1987).
V. N. Red'ko, “Program compositions and composition programming,” Programmirovanie, No. 5, 3–24 (1978).
Z. Manna, “Theory of program fixed point,” Kiberneticheskii Sbornik, Moscow, No. 15, 38–100 (1978).
B. P. Demidovich and I. A. Maron, Foundations of Computational Mathematics [in Russian], Moscow (1970).
D. K. Faddeev and V. N. Faddeeva, Computational Methods of Linear Algebra [in Russian], Moscow (1963).
Author information
Authors and Affiliations
Additional information
Translated from Vychislitel'naya i Prikladnaya Matematika, No. 73, pp. 116–126, 1992.
Rights and permissions
About this article
Cite this article
Byts', V.V., Zulunov, R.M. Specification of matrix algebra problems by reduction. J Math Sci 71, 2719–2726 (1994). https://doi.org/10.1007/BF02114051
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02114051