Concept

Manifest typing

In computer science, manifest typing is explicit identification by the software programmer of the type of each variable being declared. For example: if variable X is going to store integers then its type must be declared as integer. The term "manifest typing" is often used with the term latent typing to describe the difference between the static, compile-time type membership of the object and its run-time type identity. In contrast, some programming languages use implicit typing (a.k.a. type inference) where the type is deduced from context at compile-time or allow for dynamic typing in which the variable is just declared and may be assigned a value of any type at runtime. Consider the following example written in the C programming language: #include int main(void) { char s[] = "Test String"; float x = 0.0f; int y = 0; printf("Hello, World!\n"); return 0; } The variables s, x, and y were declared as a character array, floating point number, and an integer, respectively. The type system rejects, at compile-time, such fallacies as trying to add s and x. Since C23, type inference can be used in C with the keyword auto. Using that feature, the preceding example could become: #include int main(void) { char s[] = "Test String"; // auto s = "Test String"; is instead equivalent to char* s = "Test String"; auto x = 0.0f; auto y = 0; printf("Hello, World!\n"); return 0; } Similarly to the second example, in Standard ML, the types do not need to be explicitly declared. Instead, the type is determined by the type of the assigned expression. let val s = "Test String" val x = 0.0 val y = 0 in print "Hello, World!\n" end There are no manifest types in this program, but the compiler still infers the types string, real and int for them, and would reject the expression s+x as a compile-time error.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.