I. A. Kudryavtseva
Price: 50 руб.
The specificity of the content of training theoretical programming (typed formal systems
being one of its sections) has identified a way of describing software for learning
theoretical programming. The author presents a description of the programming model
for type inference in λ→ that supports learning simply typed λ-calculus.
Key words: theoretical programming, way of describing software tools for training
theoretical programming, typed λ-calculus, software model of type inference in the
simply typed λ-calculus (λ→).
References
1. Dushkin R. Model’ tipizatsii Khindli-Milnera i primer eyo realizatsii na yazyke Haskell // Praktika funktsional’nogo programmirovaniya. 2010. № 5. S. 133–149.
2. Informatsionnye i kommunikatsionnye tekhnologii v obrazovanii: uchebno-metodicheskoe posobie / I. V. Robert, S. V. Panyukova, A. A. Kuznetsov, A. Yu. Kravtsova. M.: Drofa, 2008. 312 s.
3. Kudryavtseva I. A. Interpretator λ-termov i ego vozmozhnosti v protsesse obucheniya teoreticheskomu programmirovaniyu studentov IT-spetsial’nostey // Pis’ma v Emissiya.Offlayn (TheEmissia.OfflineLetters): elektronnyi nauchnyi zhurnal. Dekabr’ 2014, ART 2304. SPb., 2014 g. URL: http://www.emissia.org/offline/2014/2304.htm, ISSN 1997-8588.
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. Laptev V. V., Shvetskiy M. V. Metodicheskaya sistema fundamental’noy podgotovki v oblasti informatiki: teoriya i praktika mnogourovnevogo pedagogicheskogo universitetskogo obrazovaniya. SPb.: Izd-vo SanktPeterburgskogo universiteta, 2000. 508 s.
6. Moskvin D. Svoystva prosto tipizirovannoy sistemy // Sistemy tipizatsii lyambda-ischisleniya. 2011. Lektsiya 5. URL: http://compsciclub.ru/node/1003 (data obrashcheniya: 22.03.2014).
7. Pirs B. Tipy v yazykakh programmirovaniya. M.: Izd-vo «Lyambda press»: «Dobrosvet», 2012. 656 s.
8. Robert I. V. Sovremennye informatsionnye tekhnologii v obrazovanii: didakticheskie problemy; perspektivy ispol’zovaniya. M.: «Shkola-Press», 1994. 205 s.
9. Fauler M. Predmetno-orientirovannye yazyki programmirovaniya. M.: OOO «I. D. Vil’yams», 2011. 576 s.
10. Algorithm W Step by Step // Home Comics Posts Publications Talks Misc About RSS. URL: http:// catamorph.de/publications/2007-09-01-algorithm-w-step-by-step.html (data obrashcheniya: 13.07.2015).
11. Geuvers H. Introduction to Type Theory / Alfa Lernet summer school, Uruguay, 2008.
12. Harrison J. Introduction to Functional Programming. Cambridge University, 1996/1997.
13. Kfoury A.J., Tiurin J., Urzyczyn P. ML typability is DEXPTIME-complete // Proc. 15th Colloq. on Trees in Algebra and Programming, Springer LNCS 431. 1990. Р. 206–220.
14. Kfoury A.J., Tiurin J., Urzyczyn P. An analysis of ML typability // Journal of the ACM. 1994. 41(2). Р. 368–398.
15. Mairson H.G. Deciding ML typability is complete for deterministic exponential time // ACM Symposium on Principles of Programming Languages (POPL), San Francisco, California. ACM Press, New York, 1990. Р. 382–401.
