SCRATCH LANGUAGE OF PROGRAMMING VS ENGLISH LANGUAGE: COMPARING MATHEMATICAL AND LINGUISTIC FEATURES

Nataliia Lazebna, Yuliya Fedorova, Mariia Kuznetsova

Abstract


This paper focuses on Scratch language of programming and traces its math and linguistic features. From a complex consideration about Scratch language programming in linguistic paradigm, focusing on structural, semantic and syntactic features and logic of its narration, this research attempts to clarify specifics of the language and correlate it with the English language features. Global integration of ideas and sciences underline the crucial importance of programming and language conglomerate. Human-computer interfaces, software systems, and development of various programming languages depend on well-balanced structure, shape, logic, and appearance of the actual code. Dynamic characteristics of the Scratch programming environment sustain the creation of interactive and media-rich projects. Ad expansion of Scratch for mediation of animated stories, music videos, science projects, tutorials, and other contents necessitates multifaceted analysis of this programming environment and evokes the interest of researching Scratch from the math and linguistic perspective as one possible projection on various aspects of the considered programming language.


Keywords


scratch; programming language; mathematics; semantics; syntax; motion blocks; errors; slots; data typing

Full Text:

PDF

References


Gabbrielli, M., Martini, S. (2010). Programming Languages: Principles and Paradigms. Undergraduate Topics in Computer Science. Springer. doi: https://doi.org/10.1007/978-1-84882-914-5

Kashefi, O., Lucas, A. T., Hwa, R. (2018). Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 2 (Short Papers). doi: https://doi.org/10.18653/v1/n18-2036

Lenarcic, J. (2004). Behavioural Issues in Software Development: The Evolution of a New Course Dealing with the Psychology of Computer Programming. Issues in Informing Science and Information Technology, 1, 0247–0252. doi: https://doi.org/10.28945/735

Malan, D. J., Leitner, H. H. (2007). Scratch for budding computer scientists. ACM SIGCSE Bulletin, 39 (1), 223–227. doi: https://doi.org/10.1145/1227504.1227388

Maloney, J., Resnick, M., Rusk, N., Silverman, B., Eastmond, E. (2010). The Scratch Programming Language and Environment. ACM Transactions on Computing Education, 10 (4), 1–15. doi: https://doi.org/10.1145/1868358.1868363

May, J., Dhillon, G. (2009). Interpreting beyond Syntactics: A Semiotic Learning Model for Computer Programming Languages. Journal of Information Systems Education, 20 (4), 431–438.

Meijer, E., Drayton, P. (2004). Static Typing Where Possible, Dynamic Typing When Needed: The End of the Cold War between Programming Languages. Intended for Submission to the Revival of Dynamic Languages. Available at: https://www.ics.uci.edu/~lopes/teaching/inf212W12/readings/rdl04meijer.pdf

Papert, S. (1980). Mindstorms: Children, Computers, and Powerful Ideas. New York: Basic Books, 242.

Piaget, J., Piercy, M., Berlyne, D. E. (1950). The Psychology of Intelligence. London: Routledge & Kegan Paul Ltd.

Pleonasm. Available at: https://www.merriam-webster.com/dictionary/pleonasm

Scratch Blocks. Available at: http://www.mblock.cc/scratch-blocks/

Scratch Marty. Available at: https://www.generationrobots.com/media/ChallengeOutlinesFR.pdf

Shapes and Fractals. Available at: https://nelson.coderdojo.nz/projects/shapes-and-fractals/

Sierpinski Triangle. Available at: http://jwilson.coe.uga.edu/emat6680/parsons/mvp6690/essay1/sierpinski.html

Scratch Blocks. Available at: http://scratched.gse.harvard.edu/resources/vector-scratch-blocks.html




DOI: http://dx.doi.org/10.21303/2461-4262.2019.00982

Refbacks

  • There are currently no refbacks.




Copyright (c) 2019 Nataliia Lazebna, Yuliya Fedorova, Mariia Kuznetsova

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

ISSN 2461-4262 (Online), ISSN 2461-4254 (Print)