In the examples here, a simple type is a finite expression built from the base types int and bool using function types:
For example, describes a function accepting an integer and producing a Boolean value. During type inference, the grammar is extended with type variables such as for types not yet determined. A type scheme additionally binds such type variables; it is distinct from the individual simple type used at one call.

Articles by others on the same topic (NaN)

There are currently no matching articles.