We've discussed optimisations of ('a option) in the past. Certainly
some things could be done, but it's unclear to me how much value there is in
optimizing ('a option) specifically: what if, for example, we later
understand that ('a, exn) result is the more general abstraction that
we should have used instead, and rely on it heavily in libraries, will
we de-optimize options and work on optimizing results?

Note that your idea of "either a failure of a value" can be achieved,
in some monomorphic cases (specifically when you know 'a and it has a
product structure) by using a specific type declaration:

  type my_struct =
    | None
    | Some of int * int array * string

This will be represented as efficiently as the tuple (int * int array
* string), yet it has a default case (or two, or another case with
exceptions, whatever -- this is more flexible than just options). With
inline records in 4.03 -- not yet released -- you will even be able to
have some of the product structure mutable:

  type my_struct =
    | None
    | Some of { mutable count : int; values : int array; name : string }

On Tue, Aug 18, 2015 at 9:01 PM, Kenneth Adam Miller
<kennethadammiller@gmail.com> wrote:
> Well, it's not restricted to pointers - In general I would think that the
> type annotation for Some | None would be left alone. I just used pointer as
> an example because pointers exclude a value, 0x0, from the valid set. In
> which case None is encoded as 0x0.
>
> Thanks for the bit about polymorphism in the context of what a compiler
> would see - clients that do not see the hypothetical additional annotation
> for that specific type to allow a format wouldn't have the augmented
> operational needs to work on such an instance correctly. Got it!
>
> On Tue, Aug 18, 2015 at 2:57 PM, Hendrik Boom <hendrik@topoi.pooq.com>
> wrote:
>>
>> On Tue, Aug 18, 2015 at 01:06:55PM -0400, Kenneth Adam Miller wrote:
>> > I was wondering if cases where format control is possible in typing
>> > constructs can allow things like restricting the implementation size
>> > after
>> > compilation of a specific variant type. Say, for instance that I wanted
>> > to
>> > have a malloc implementation instead of returning a Some 'a | None type
>> > that compiles down to a boxed case of first a word and then the
>> > subsequent
>> > 'a instance, down to the 'a instance, where in the values of the word
>> > enum
>> > (or tag) are not present in the possibilities of the 'a instance.
>> >
>> > Maybe it sounds silly, but in really tight loops you want to squeeze for
>> > efficiency. So I was wondering if maybe the same actual code be used
>> > with
>> > the same sanity of type checking, but some annotation provided at the
>> > type
>> > declaration to allow such optimization to take place.
>>
>> Let's see.  OCaml steals a bit to indicate whether a valus is a pointer
>> or not, right?  Could that bit see duual usage for the option type?  So
>> that if it's an optional pointer type, the bit is left off, and if it's
>> an optional nonpointer type, it's turned on (and set to point to
>> location zero, which the GC couls check for)?
>>
>> THe proble I see with this is if the 'a is passed to a generic function
>> where iti isn't statically known where it's a pinter or not.  The
>> conpiler will not know whether to test for absence or presence of the
>> bit.
>>
>> -- hendrik
>
>