Andreas Rossberg

Thanks for the explanation, I believe I understand your proposal better now. It seems like you are essentially describing an encoding of exceptions via a binary disjoint union type (sum...

@nomeata, the spec doc on this proposal is inconsistent in a number of ways, due to its circular dependency with the reference types proposal. This should be rectified in the...

Just want to clarify that it naturally is a phase 4 requirement to have the spec document fully completed, which is quite a bit more than just the formal bits....

The following works perfectly fine in the text format: ``` (func $f (result i32 i32) ...) (func $g (param i32 i32) ...) (func $h (call $g (call $f)) ) ```

@KronicDeth, tuples do not exist as first-class values in Wasm. It is a stack machine. OTOH, the folded form of the text format seems perfectly in line with how languages...

@fgmccabe, not sure what you mean, inconsistent arities are simply a type error in any of these languages. Edit: Or are you talking about Wasm? There, the folded form does...

@fgmccabe, no you cannot, n-ary tuples are not pairs in either ML or Haskell. Nor in any other language except Lisp/Scheme, as far as I am aware.

If you cannot pass through the tuple then you need to deconstruct it, typically with a pattern-matching let: ``` fun f() = (1, 2, 3) fun g(x, y) = x...

The type `T * U * V` is *not* the same as `T * (U * V)`. The `*` is not a binary type constructor but a (family of) mixfix...

The analogue in Wasm is a sequence of `drop` and `local.set`. Or literally the `let` block from the typed function refs proposal. ;) For ex bindings, isn't some drop combinator...