Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Type signature
Summary
In computer science, a type signature or type annotation defines the inputs and outputs for a function, subroutine or method. A type signature includes the number, types, and order of the arguments contained by a function. A type signature is typically used during overload resolution for choosing the correct definition of a function to be called among many overloaded forms.
Examples
C/C++
In C and C++, the type signature is declared by what is commonly known as a function prototype. In C/C++, a function declaration reflects its use; for example, a function pointer with the signature would be called as:
char c;
double d;
int retVal = (*fPtr)(c, d);
Erlang
In Erlang, type signatures may be optionally declared, as:
-spec function_name(type1(), type2(), ...) -> out_type().
For example:
-spec is_even(number()) -> boolean().
Haskell
A type signature in Haskell generally takes the following form:
functionName :: arg1Type -> arg2Type -> ...
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related publications
Loading
Related people
Loading
Related units
Loading
Related concepts
Loading
Related courses
Loading
Related lectures
Loading