Type inference - Revision history

Hzwakenberg at 22:18, 21 December 2021

2021-12-21T22:18:27Z

← Older revision		Revision as of 00:18, 22 December 2021
Line 1:		Line 1:
−	Type inference is an algorithm allowing Liberty Eiffel to statically compute the true type of ~~the~~ objects at run time.	+	Type inference is an algorithm allowing Liberty Eiffel to statically compute (at compile time) the true type of 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 [[compile\|compiler]] when using the <TT>-verbose</TT> flag. It's called ''type inference score''; it is the fraction of simplified binding sites over the total number of sites.	+	Usually, this algorithm allows simplifying 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 [[compile\|compiler]] when using the <TT>-verbose</TT> 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...		One should note that a 100% score is usually not possible, nor desirable; else your project is not really written in an OO spirit...

Dkearns: s/LibertyEiffel/Liberty Eiffel/

2016-06-14T20:27:42Z

s/LibertyEiffel/Liberty Eiffel/

← Older revision		Revision as of 22:27, 14 June 2016
Line 1:		Line 1:
−	Type inference is an algorithm allowing ~~LibertyEiffel~~ to statically compute the true type of the objects at run time.	+	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 [[compile\|compiler]] when using the <TT>-verbose</TT> flag. It's called ''type inference score''; it is the fraction of simplified binding sites over the total number of sites.		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 [[compile\|compiler]] when using the <TT>-verbose</TT> flag. It's called ''type inference score''; it is the fraction of simplified binding sites over the total number of sites.

Hzwakenberg at 17:46, 4 March 2016

2016-03-04T17:46:36Z

← Older revision		Revision as of 19:46, 4 March 2016
Line 1:		Line 1:
−	Type inference is an algorithm allowing ~~SmartEiffel~~ to statically compute the true type of the objects at run time.	+	Type inference is an algorithm allowing LibertyEiffel 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 ~~unic~~ dynamic type. This simplification is summed up and displayed by the [[compile\|compiler]] when using the <TT>-verbose</TT> flag. It's called ''type inference score''; it is the fraction of simplified binding sites over the total number of sites.	+	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 [[compile\|compiler]] when using the <TT>-verbose</TT> 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...		One should note that a 100% score is usually not possible, nor desirable; else your project is not really written in an OO spirit...

Ramack at 20:57, 4 March 2013

2013-03-04T20:57:55Z

← Older revision		Revision as of 22:57, 4 March 2013
Line 1:		Line 1:
−	[[Category:Book]]
−
	Type inference is an algorithm allowing SmartEiffel to statically compute the true type of the objects at run time.		Type inference is an algorithm allowing SmartEiffel to statically compute the true type of the objects at run time.

Ramack: 8 revisions: initial import from SamrtEiffel Wiki - The Grand SmartEiffel Book

2013-03-03T21:50:45Z

8 revisions: initial import from SamrtEiffel Wiki - The Grand SmartEiffel Book

New page

[[Category:Book]]

Type inference is an algorithm allowing SmartEiffel 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 unic dynamic type. This simplification is summed up and displayed by the [[compile|compiler]] when using the <TT>-verbose</TT> 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...

Cadrian: typo

2005-07-11T11:57:37Z

typo

← Older revision		Revision as of 13:57, 11 July 2005
Line 3:		Line 3:
	Type inference is an algorithm allowing SmartEiffel to statically compute the true type of the objects at run time.		Type inference is an algorithm allowing SmartEiffel to statically compute the true type of the objects at run time.

−	Usually this algorithm allows to simplify the generated code by deleting [[~~dynimic~~ binding]] sites when the static type is computed to be reduced to a unic dynamic type. This simplification is summed up and displayed by the [[compile\|compiler]] when using the <TT>-verbose</TT> flag. It's called ''type inference score''; it is the fraction of simplified binding sites over the total number of sites.	+	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 unic dynamic type. This simplification is summed up and displayed by the [[compile\|compiler]] when using the <TT>-verbose</TT> 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...		One should note that a 100% score is usually not possible, nor desirable; else your project is not really written in an OO spirit...

Cadrian: creation

2005-07-11T11:57:14Z

creation

New page

[[Category:Book]]

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

Usually this algorithm allows to simplify the generated code by deleting [[dynimic binding]] sites when the static type is computed to be reduced to a unic dynamic type. This simplification is summed up and displayed by the [[compile|compiler]] when using the <TT>-verbose</TT> 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...