Geodesic
Combinators: objects for knowing the structure of computing. Atomic and molecular granularity of computing environment
Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 2 (2009), pp. 132-146 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

In everyday computing the entities are involved into operations whose inner structure is not paid much of attention. Nevertheless many of usual operations consist of more primitive constructs combined by a mode of combining. An interaction of constructs take place within environment of “applicative interaction” and studying the properties of this environment allows to get familiar with the nature of computations. This paper pays main attention to knowing the technological features of computations with objects. Their interaction is assumed in applicative environment allowing to know the intrinsic structure of usual operations and this knowledge allows to know their properties in turn. The choice of primary constant entities is discussed and these entities are assumed as initial and are referred to as combinators. These primary entities are used as main “building blocks” participating in interaction each with other in the applicative environment. This interaction results in the constructs giving rise to the representative sets of usual operators and embedded computational systems.
Keywords: combinatory logic, computing, applicative environment, embedded computational systems. 
@article{VUU_2009_2_a13,
     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 = {Combinators: objects for knowing the structure of computing. {Atomic} and molecular granularity of computing environment},
     journal = {Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹ\^uternye nauki},
     pages = {132--146},
     year = {2009},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VUU_2009_2_a13/}
}
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  - Combinators: objects for knowing the structure of computing. Atomic and molecular granularity of computing environment
JO  - Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
PY  - 2009
SP  - 132
EP  - 146
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/VUU_2009_2_a13/
LA  - ru
ID  - VUU_2009_2_a13
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 Combinators: objects for knowing the structure of computing. Atomic and molecular granularity of computing environment
%J Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki
%D 2009
%P 132-146
%N 2
%U http://geodesic.mathdoc.fr/item/VUU_2009_2_a13/
%G ru
%F VUU_2009_2_a13
V. E. Wolfengagen; L. Yu. Ismailova; S. V. Kosikov; A. D. Laptev; V. N. Nazarov; V. V. Roslovtsev; I. S. Safarov; A. L. Stepanov. Combinators: objects for knowing the structure of computing. Atomic and molecular granularity of computing environment. Vestnik Udmurtskogo universiteta. Matematika, mehanika, kompʹûternye nauki, no. 2 (2009), pp. 132-146. http://geodesic.mathdoc.fr/item/VUU_2009_2_a13/

[1] Kennedy A., “Functional Pearls: Pickler Combinators”, Journal of Functional Programming, special issue on Functional Pearls. Cambridge University Press, 14:6 (2004), 727–739 | Zbl

[2] Barendregt H., Wiedijk F., “The Challenge of Computer Mathematics”, Transactions of the Royal Society, 363:1835 (2005), 2351–2375 ftp://ftp.cs.ru.nl/pub/CompMath.Found/Barendregt-Wiedijk.pdf | DOI | MR | Zbl

[3] Hindley J. R., Lercher B., Seldin J. P., Introduction to Combinatory Logic, Cambridge University Press, London, 1972 | MR | Zbl

[4] 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

[5] Seldin J. P., “The Logic of Curry and Church”, Handbook of the History of Logic, 5, eds. Dov Gabbay and John Woods, Elsevier, 2006 http://people.uleth.ca/~jonathan.seldin/CCL.pdf

[6] Shaumyan S. K., Applikativnaya grammatika kak semanticheskaya teoriya estestvennykh yazykov, Nauka, M., 1974, 204 pp.

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

[8] Bell G., Dourish P., “Yesterday's tomorrows: notes on ubiquitous comp ting's dominant vision”, Personal Ubiquitous Comput., 11:2 (2007), 133–143 | DOI

[9] MacLennan B. J., Molecular Combinator Reference Manual. UPIM Report 2, Technical Report UT-CS-02-489, , Department of Computer Science, University of Tennessee, Knoxville, 2002, 16 pp. http://www.cs.utk.edu/~mclennan/UPIM/CombRef.pdf

[10] MacLennan B. J., Combinatory Logic for Autonomous Molecular Computation. Preprint of the paper invited for Information Sciences, , 2003 http://www.cs.utk.edu/~mclennan/UPIM/CLAMC-IS.pdf

[11] Berners-Lee T., Hall W., Hendler J., O'Hara K., Shadbolt N., Weitzner D., “A Framework for Web Science”, Foundations and Trends in Web Science, 1:1 (2006), 1–130 | DOI

[12] Carpenter B., The Internet Engineering Task Force: Overview, Activities, Priorities. ISOC BoT, 2006-02-10, , 2006 http://www.isoc.org/isoc/ general/trustees/docs/Feb2006/IETF-BoT-20060210.pdf

[13] Cardelli L., Davies R., Service Combinators for Web Computing. HP Labs Technical Reports SRC-RR-148. June 1, , 1997, 15 pp. http://www.hpl.hp.com/ techreports/Compaq-DEC/SRC-RR-148.html

[14] Denning P. J., “Computing is a Natural Science”, Commun. ACM, 50:7 (2007), 13–18 | DOI

[15] Volfengagen V. E., Konstruktsii yazykov programmirovaniya. Priemy opisaniya, AO “Tsentr YurInfoR”, M., 2001, 276 pp., Izdanie podderzhano grantom RFFI, proekt 01-01-14068-d

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

[17] Volfengagen V. E., Metody i sredstva vychislenii s ob'ektami. Applikativnye vychislitelnye sistemy, JurInfoR Ltd., AO “Tsentr YurInfoR”, M., 2004, xvi+789 pp., Izdanie podderzhano grantom RFFI, proekt 03-01-14055-d

[18] Ismailova L. Yu., “Logika ob'ektov”, Metody i sredstva vychislenii s ob'ektami. Applikativnye vychislitelnye sistemy, JurInfoR Ltd., AO “Tsentr YurInfoR”, M., 2004, 613–630

[19] Kosikov S. V., “Logika funktsionalnosti”, Metody i sredstva vychislenii s ob'ektami. Applikativnye vychislitelnye sistemy, JurInfoR Ltd., AO “Tsentr YurInfoR”, M., 2004, 595–612

[20] MacLennan B. J., Molecular Combinatory Computing for Nanostructure Synthesis and Control, IEEE Nano 2003, San Francisco, August 12–14 , 2003 http://www.cs.utk.edu/~mclennan/UPIM/MacLennan-MCCNSC.pdf