LoginRegistration
For instance: The Scientific Opinion
About consortium subscription Contacts
(812) 4095300 Non-commercial partnership
St. Petersburg
university
consortium

Articles

"The Scientific Opinion" №8-9 (Psycho-pedagogical and philosophy of science), 2016

PROGRAMMING IN THE ORIGAMI STYLE IN THE PROCESS OF TEACHING THEORETICAL PROGRAMMING

I. A. Kudryavtseva
Price: 50 руб.
 The article is devoted to teaching programming in the origami style. The author formulated the definitions for “programming in the origami style” and “programming in the
Haskell origami style”, based on the patterns of recursion, in particular, fold patterns.
The issues of teaching programming in the Haskell-origami style are reflected in students’ preliminary knowledge and skills, the graph of the content of teaching folding and
unfolding functions and classification of the types of tasks that students will be able to
solve. The author also provides pragmatic aspects of Haskell origami and identifies the
philosophical grounds of including origami programming into the content of teaching
theoretical programming.
Key words: origami, programming, recursion pattern, fold, unfold, function.
References
1. Borzenkov V. G. Imeyetsya li budushcheye u reduktsii kak osnovaniya nauchnogo znaniya? // Budushcheye fundamental’noy nauki: Kontseptual’nye, filosofskie i sotsial’nye aspekty problemy. M.: KRASAND, 2011. S. 248–258.
2. Bragilevskiy V. Predely vyrazitel’nosti svertok // Praktika funktsional’nogo programmirovaniya. 2010. № 4. S. 55–77.
3. Kirpichev E. R. Elementy funktsional’nykh yazykov // Praktika funktsional’nogo programmirovaniya. 2009. № 3. S. 83–197.
4. Komlev N. G. Slovar’ inostrannykh slov. M.: Eksmo, 2006. 672 s.
5. Mena A. Izuchaem Haskell. SPb.: Piter, 2015. 464 s.
6. Engel’gardt V. A. Integratizm — put’ ot prostogo k slozhnomu v poznanii zhizni // Filosofskie problemy biologii. M.: Nauka, 1973. S. 12.
7. Bird R. Introduction to Functional Programming using Haskell. Prentice Hall Press, 1998. 434 р.
8. Bird R., Wadler P. Introduction to Functional Programming. Prentice Hall, 1988.
9. Dean J., Ghemawat S. MapReduce: simplified data processing on large clusters // In OSDI’04: Proceedings of the 6th conference on Symposium on Operating Systems Design and Implementation. 2004.
10. Freyd P. Algebraically complete categories // Proceedings of the 1990 Como Category Theory Conference, v. 1488 of Lecture Notes in Math. Springer-Verlag, 1990. Р. 95–104.
11. Gibbons J. Functional Pearls. The Third Homomorphism Theorem // J. Functional Programming. 1995. 1 (1), May.
12. Gibbons J. Origami programming // The Fun of Programming. Ed. J. Gibbons, O. de Moor. Palgrave, 2003. Р. 41–60.
13. Gibbons J., Jones G. The Under-Appreciated Unfold // Therd ACM SIGPLAN Int. Conf. on Functional Programming. Baltimore, 1998.
14. Hutton G. A tutorial on the universality and expressiveness of fold // J. Functional Programming. 1999. 9 (4), July. Р. 355–372.
15. Meijer E., Hutton G. Bananas in space: Extending fold and unfold to Exponential types // Proceedings of the 7th SIGPLAN-SIGARCH-WG2.8 International Conference on Functional Programming and Computer Architecture. 1995. Р. 324–333.
16. Pope B. Getting a Fix from the Right Fold // The Monad Reader. 2007. 6. Р. 5–15.
Price: 50 рублей
To order