DYNAMIC DEFINITION OF TYPES

Authors

  • Muslimbek Kholmirzayev TDIU Andijan faculty 2nd stage
  • Nursaid Sodiqov TDIU Andijan faculty 2nd stage ATT 70/23 group students

Keywords:

Dynamic typing, type theory, programming languages, algorithm design, software engineering, data representation, type inference, flexibility, performance

Abstract

This paper explores the dynamic definition of types in the context of algorithm science, highlighting its implications for programming language design, software engineering, and data representation. By analyzing theoretical and practical perspectives, we aim to predict future trends in type systems and their applications.

Downloads

Download data is not yet available.

References

1. Pirs, Benjamin C. Turlar va dasturlash tillari. MIT Press, 2002.

2. Cardelli, L. (1989). Nazariy informatika bo'yicha qo'llanma, A jild, 25-101. Elsevier.

3. SICP (Structure and Interpretation of Computer Programs): Abelson, H., & Sussman, GJ (1996).

4. Nazirova, E., Abdurakhmonova, N., & Alisher, I. Exploring Linguistic Roots (stem) and Word Categories in Uzbek Language through Advanced Natural Language Processing Techniques for Text Analysis.

5. Ismailov, A. S., Akbarov, A., Qodirova, G. T. X. Q., & Yigitaliyeva, M. (2023). Dasturiy ta’minotni ishlab chiqish bosqichlari. Science and Education, 4(3), 187-191.

Downloads

Published

2024-10-29

Issue

Vol. 1 No. 10 (2024): INTERNATIONAL CONFERENCE ON ADVANCE SCIENCE AND TECHNOLOGY

Section

Articles

License

Creative Commons License

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

How to Cite

DYNAMIC DEFINITION OF TYPES. (2024). INTERNATIONAL CONFERENCE ON ADVANCE SCIENCE AND TECHNOLOGY, 1(10), 28-31. https://universalconference.us/index.php/icast/article/view/2890