syntax for inferred upper bound Peter McGoron (15 Apr 2026 11:37 UTC)
Re: syntax for inferred upper bound Wolfgang Corcoran-Mathe (15 Apr 2026 15:55 UTC)
Re: syntax for inferred upper bound Peter McGoron (15 Apr 2026 16:31 UTC)
Re: syntax for inferred upper bound Artyom Bologov (15 Apr 2026 23:21 UTC)
Re: syntax for inferred upper bound Bradley Lucier (16 Apr 2026 00:21 UTC)
Re: syntax for inferred upper bound John Cowan (16 Apr 2026 01:19 UTC)
Re: syntax for inferred upper bound Bradley Lucier (16 Apr 2026 01:27 UTC)

Re: syntax for inferred upper bound Wolfgang Corcoran-Mathe 15 Apr 2026 15:55 UTC

On 2026-04-15 07:36 -0400, Peter McGoron wrote:
> Here is an alternative proposal that explicitly labels the upper
> bound as inferred.

I'm not sure I see the benefit of this.  Presumably an exception
is raised (or the effect is undefined) if an inferred upper
bound cannot be determined (e.g. if the contents are mishaped
in that dimension.)  Since programmers will have to put a good
deal of care into the writing of their contents datums to avoid
surprises, what's the advantage of leaving out a single bound?
Is there any situation in which you know enough to write a valid
contents datum but not enough to write all of the array's upper
bounds?

(This is not a rhetorical question.  I don't have much experience
with array programming.)

--
Wolfgang Corcoran-Mathe  <xxxxxx@sigwinch.xyz>