...¹

This removes a source of grammatical complexity in a language where anyone can add new binary selectors or implementations. It is our policy that conventional mathematical notation and visual convenience belong in user interface libraries.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...thisContext x: 4.²

The current named method as distinct from the context is available as currentMethod, and its name is available as selector. However, these are dependent on the current implementation of Slate, and so may not be available in the future.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...³

We do not consider this expression good style, but it illustrates the nature of the syntax.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...⁴

Lisp macro system users will note that this effectively makes `quote the same as quasi-quotation.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...⁵

Future, bootstrapped releases may provide for partitioning of the global table.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...⁶

The classical illustration of multiple inheritance issues is the ``diamond'' problem where one parent is inherited via two different paths indirectly. Solutions that involve choosing inheritance graph traversal orders for the whole language are insufficiently flexible in dealing with multiple inheritance confusion, since various protocols need to interact independently.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... automatically⁷

However, support for blocks in the second argument position may be incorporated into the non-lazy selectors as different methods in the future, making some of these obsolete.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

... indefinitely⁸

This is currently implemented through a compiler rule.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

...⁹

In the future, automatic querying and loading an appropriate module could be added.

.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.