The author of the paper carries out a logical and semiotic analysis of one of the sections of studying theoretical programming “point-free programming style”. Haskell functional programming language is selected as an object language; it contains a suitable set of operators for writing functions in the point-free form and displaying them in terms of the formal system of lambda calculus (both untyped and typed). Thus, the considered content demonstrates the convergence of mathematics and programming, which is an integral part of theoretical computer science.
specification, combinatorial library.
References
1. Gris D. Nauka programmirovaniya. M.: Mir, 1984. 416 s.
2. Kirpichev E. Elementy funktsional’nykh yazykov // Praktika funktsional’nogo programmirovaniya.
2009. № 3. S. 83–194.
3. Kudryavtseva I. A., Shvetskiy M. V. Elementy teoreticheskogo programmirovaniya: kombinatornaya
logika i teoriya tipov. Chast’ I. SPb.: Izdatel’stvo LEMA, 2013. 488 s.
4. Laptev V. V., Ryzhova N. I., Shvetskiy M. V. Metodicheskaya teoriya obucheniya informatike. Aspekty
fundamental’noy podgotovki. SPb.: Izd-vo S.-Peterb. un-ta, 2003. 352 s.
5. Moskvin D. Secheniya kompozitsii kak instrument bestochechnogo stilya // Praktika funktsional’nogo
programmirovaniya. 2010. № 4. S. 89–105.
6. Frenkel’ A., Bar-Khillel I. Osnovaniya teorii mnozhestv. M.: Mir, 1966. 555 s.
7. Khindli Dzh. R. Kombinatory i lyambda-ischislenie. Kratkiy obzor / Matematicheskaya logika v
programmirovanii: sb. statey 1980–1988 gg. M.: Mir, 1991. S. 119–140.
8. Backus J. Can programming be liberated from the von Neumann style? // Communications of the
ACM, 1978, vol. 21, no. 8. Pp. 613–641.
