On 9/20/10 11:09 AM, Graydon Hoare wrote:
Is it possible to infer the type from the expression, e.g. in 2 + x
the 2 matches the declared type of x?
Plausible. Go takes a similar angle on this; their numeric literals are
untyped and acquire a type via inference from the context. I'm not
sure
FWIW, I'm with Patrick-- this all sounds too complicated to me. At least until
we've written some significant code, it doesn't seem worth trying to solve a
problem we may not actually have. And Patrick's suggestion of scoped literals
at least sounds like a reasonably simple approach (that
On Fri, Sep 17, 2010 at 1:26 AM, Patrick Walton pwal...@mozilla.com wrote:
The motivation for this is the repeated type declarations in benchmarks like
fasta [1]. They can make code somewhat noisy.
I think there's two points here. I must admit I found it a bit hard
work _writing_ fasta - I
