CSC/ECE 517 Fall 2009/wiki1b 2 sk

Contents

1.Introduction

 1.1 Dynamically Typed Languages
 1.2 Statically Typed Languages

2. Advantages of Statically Typed v/s Dynamically typed 3. When Statically Typed is preferred over Dynamically typed 4. Examples 5. Conclusion 6. Glossary 7. References

Introduction

Dynamically Typed Languages
Dynamically typed languages are those in which type checking is done at run-time. In other words, the same entity does not always have the same form during the execution of the program and the type of the object assigned to a variable can be changed at runtime. Variable need not be defined before they are used. Some examples of dynamically typed languages are Ruby, Python, PHP, Smalltalk, Prolog, JavaScript, Objective-C.
/* Ruby code sample */
a = [1, 2, 3, 4, "Hi"]

The above code declares array that holds mix of integer and string types. Note that there was no need to specify array type and this would be evaluated automatically during runtime. However such a declaration is not possible in statically typed language like C, C++, Java, etc. doing so would give compile time errors.

Statically Typed Languages
Statically typed languages are those in which type checking is performed during compile-time as opposed to run-time. In static typing, all expressions have their types determined prior to the program being run (typically at compile-time). For example, 1 and (2+2) are integer expressions; they cannot be passed to a function that expects a string, or stored in a variable that is defined to hold dates. In other words, types are associated with variables and not values. This Static typing is a limited form of program verification. Accordingly, it allows many type errors to be caught early in the development cycle. Some examples of Statically typed languages are Ada, C, C++, C#, JADE, Java, Pascal, Scala.