1 Matching Annotations
  1. Dec 2023
    1. With specific keyword messages you can compute the Least Common Multiple and Greatest Common Divisor. A keyword message is composed of one or more colons “:” to insert one or more arguments:

      A source of confusion for beginners is why binary messages exist in the first place when they could be implemented instead as keyword messages taking one argument as #lcm: and #gcd:; you could in fact, imagine an alternative syntax with only unary and keyword messages, but it would be cumbersome to read and write. Binary messages improve legibility without introducing too much complexity for the implementors.