Geodesic
Applicative computing: attempts for knowing the nature of computations
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 2 (2009), pp. 118-131 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

This paper reflects the results obtained in working out the projects 93-01-00943-а (LAMBDA), 96-01-01923-а (KOOAM), 05-01-00736-а, 06-07-99005-с, 05-07-90236-в, 07-07-00298-а, 07-07-00355-а, 07-07-12098-ofi, granted by the RFBR. If an the early stages programming was a kind of art when a programmer wrote the program for solving the definite task and supplied it more or less detailed documentation, then nowadays a powerful software industry is created with supplementary software engineering. The present days in the research in programming or in an area of computer science, as a rule, those projects have being supported which bring in a few improvement in solution of already well known problem. As a result, the actually important and fundamental research, which leads to investigation of the novel concepts of computations, is left out of a scope and insufficient attention is paid to the knowledge accumulation in an area of programming. In this paper the main attention is paid to the computations with objects, the parity and role of which in this domain is growing more and more, resulting in a dominant trend.
Keywords: combinatory logic, computing, applicative environment, embedded computational systems. 
@article{VUU_2009_2_a12,
     author = {V. E. Wolfengagen and L. Yu. Ismailova and S. V. Kosikov and A. D. Laptev and V. N. Nazarov and V. V. Roslovtsev and I. S. Safarov and A. L. Stepanov},
     title = {Applicative computing: attempts for knowing the nature of computations},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {118--131},
     year = {2009},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2009_2_a12/}
}
TY  - JOUR
AU  - V. E. Wolfengagen
AU  - L. Yu. Ismailova
AU  - S. V. Kosikov
AU  - A. D. Laptev
AU  - V. N. Nazarov
AU  - V. V. Roslovtsev
AU  - I. S. Safarov
AU  - A. L. Stepanov
TI  - Applicative computing: attempts for knowing the nature of computations
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2009
SP  - 118
EP  - 131
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/VUU_2009_2_a12/
LA  - ru
ID  - VUU_2009_2_a12
ER  - 
%0 Journal Article
%A V. E. Wolfengagen
%A L. Yu. Ismailova
%A S. V. Kosikov
%A A. D. Laptev
%A V. N. Nazarov
%A V. V. Roslovtsev
%A I. S. Safarov
%A A. L. Stepanov
%T Applicative computing: attempts for knowing the nature of computations
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2009
%P 118-131
%N 2
%U http://geodesic.mathdoc.fr/item/VUU_2009_2_a12/
%G ru
%F VUU_2009_2_a12
V. E. Wolfengagen; L. Yu. Ismailova; S. V. Kosikov; A. D. Laptev; V. N. Nazarov; V. V. Roslovtsev; I. S. Safarov; A. L. Stepanov. Applicative computing: attempts for knowing the nature of computations. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 2 (2009), pp. 118-131. http://geodesic.mathdoc.fr/item/VUU_2009_2_a12/

[1] Backus J., “Can Programming be Liberated from the von Neumann Style?: a Functional Style and Its Algebra of Programs”, Commun. ACM, 21:8 (1978), 613–641 ; Bekus Dzh., “Mozhno li osvobodit programmirovanie ot stilya fon Neimana? Funktsionalnyi stil i sootvetstvuyuschaya algebra programm”, Lektsii laureatov premii Tyuringa za pervye dvadtsat let 1966–1985, ed. R. Eshenkherst, Mir, M., 1993, 84–158 | DOI | MR | Zbl

[2] Church A., The Calculi of Lambda Conversion, Prinston University Press, Prinston, 1941 | MR

[3] Curry H. B., “Functionality in Combinatory Logic”, Proc. National Academy of Sciences of the USA, 20 (1934), 584–590 | DOI

[4] Date C. J., Darwen H., Foundation for Future Database Systems. The Third Manifesto. A Detailed Study of the Impact of Type Theory on the Relational Model of Data, Including a Comprehensive Model of Type Inheritance, 2-nd edition, Addison-Wesley Publishing Co, 2000 ; Deit K., Darven Kh., Osnovy buduschikh sistem baz dannykh. Tretii manifest. Detalnoe issledovanie vliyaniya teorii tipov na relyatsionnuyu model dannykh, vklyuchaya polnuyu model nasledovaniya tipov, 2-e izdanie, ed. Kuznetsov S. D., Yanus-K, M., 2004, 656 pp. (Per. s angl. Kuznetsova S. D. i Kuznetsovoi T. A.) http://www.thethirdmanifesto.com/

[5] McCarthy J., “Recursive Functions of Symbolic Expressions and Their Computation by Machine”, Part I, Commun. ACM, 3:4 (1960), 184–195 | DOI | MR | Zbl

[6] Selinger P. and Valiron B., “A Lambda Calculus for Quantum Computation with Classical Control”, Mathematical Structures in Computer Science, 16:3 (2006), 527–552 | DOI | MR | Zbl

[7] Scott D. S., “The Lattice of Flow Diagrams”, Symposium on Semantics of Algorithmic Languages, Lecture Notes in Mathematics, 188, Springer-Verlag, Berlin, Heidelberg, New York, 1971, 311–372 | DOI | MR

[8] Scott D. S., “Relating Theories of the Lambda Calculus”, To H. B. Curry: Essays on combinatory logic, lambda calculus and formalism, eds. Hindley J., Seldin J., Academic Press, N.Y. L., 1980, 403–450 | MR

[9] Volfengagen V. E., Kombinatornaya logika v programmirovanii. Vychisleniya s ob'ektami v primerakh i zadachakh, MIFI, M., 1994, 204 pp.; 2-е изд., АО “Центр ЮрИнфоР”, М., 2003, 336 с.

[10] Volfengagen V. E., Metody i sredstva vychislenii s ob'ektami. Applikativnye vychislitelnye sistemy, JurInfoR Ltd., AO “Tsentr YurInfoR”, M., 2004, xvi+789 pp.