Issue by kfhoech
Thursday Jun 14, 2018 at 11:14 GMT
Originally opened as smaccm/smaccm#147
Types of Resolute aggregates (e.g. lists and sets) should be determined statically rather than depending upon having an element. As is, the types of empty lists and sets is incomplete if empty. For consistency with the statically-typed nature of the language make typing complete (including an element type).
In implementation, this should involve attaching an element type to the aggregate such that it can be typed at construction, even if empty.
Thursday Jun 14, 2018 at 11:14 GMT
Originally opened as smaccm/smaccm#147
Types of Resolute aggregates (e.g. lists and sets) should be determined statically rather than depending upon having an element. As is, the types of empty lists and sets is incomplete if empty. For consistency with the statically-typed nature of the language make typing complete (including an element type).
In implementation, this should involve attaching an element type to the aggregate such that it can be typed at construction, even if empty.