Type inference

From Liberty Eiffel Wiki
Revision as of 22:27, 14 June 2016 by Dkearns (talk | contribs) (s/LibertyEiffel/Liberty Eiffel/)
Jump to navigation Jump to search

Type inference is an algorithm allowing Liberty Eiffel to statically compute the true type of the objects at run time.

Usually this algorithm allows to simplify the generated code by deleting dynamic binding sites when the static type is computed to be reduced to a unique dynamic type. This simplification is summed up and displayed by the compiler when using the -verbose flag. It's called type inference score; it is the fraction of simplified binding sites over the total number of sites.

One should note that a 100% score is usually not possible, nor desirable; else your project is not really written in an OO spirit...