Problem Statement

Demonstrate how to compare two strings from within the language and how to achieve a lexical comparison.

The task should demonstrate:

For example, you might demonstrate the difference between generic/polymorphic comparison and coercive/allomorphic comparison if your language supports such a distinction.

Here "generic/polymorphic" comparison means that the function or operator you're using doesn't always do string comparison, but bends the actual semantics of the comparison depending on the types one or both arguments; with such an operator, you achieve string comparison only if the arguments are sufficiently string-like in type or appearance.
In contrast, a "coercive/allomorphic" comparison function or operator has fixed string-comparison semantics regardless of the argument type;   instead of the operator bending, it's the arguments that are forced to bend instead and behave like strings if they can,   and the operator simply fails if the arguments cannot be viewed somehow as strings.   A language may have one or both of these kinds of operators;   see the Raku entry for an example of a language with both kinds of operators.

Let's start with the solution:

# Comparing two strings for exact equality:
"this" == "this"     # true
"this" == "This"     # false

# != is the inverse of ==

# Comparing two strings to see if one is lexically ordered before the other:
"alpha" < "beta"     # true
"beta" < "alpha"     # false

# > is the inverse of <

("AtoZ" | ascii_upcase) == ("atoz" | ascii_upcase)   # true