Adam Wick
bd3b9af469
The typed literal formatting mirrors that of Rust. If no type can be inferred for an untagged literal, the type inference engine will warn the user and then assume that they meant an unsigned 64-bit number. (This is slightly inconvenient, because there can be cases in which our Arbitrary instance may generate a unary negation, in which we should assume that it's a signed 64-bit number; we may want to revisit this later.) The type inference engine is a standard two phase one, in which we first generate a series of type constraints, and then we solve those constraints. In this particular implementation, we actually use a third phase to generate a final AST. Finally, to increase the amount of testing performed, I've removed the overflow checking in the evaluator. The only thing we now check for is division by zero. This does make things a trace slower in testing, but hopefully we get more coverage this way.
7 lines
110 B
Plaintext
7 lines
110 B
Plaintext
x8 = 5u8;
|
|
x16 = <u16>x8 + 1u16;
|
|
print x16;
|
|
x32 = <u32>x16 + 1u32;
|
|
print x32;
|
|
x64 = <u64>x32 + 1u64;
|
|
print x64; |