Paired-names
Utilities for paired names.
A paired name is a symbol consisting of three parts, in this order:
-
A non-empty sequence of characters that is the first name of the pair.
-
A non-empty sequence of characters
that separates the two names of the pair.
This character sequence is global but customizable.
-
A non-empty sequence of characters that is the second name of the pair.
Examples of paired names are:
-
F-~>-G, where
F is the first name,
-~> is the separator, and
G is the second name.
-
LOGIC-SORT-IS-EXEC-SORT, where
LOGIC-SORT is the first name,
-IS- is the separator, and
EXEC-SORT is the second name.
Note that if the separator occurs in the first or second name,
the paired name cannot be uniquely decomposed
into its three constituents.
For instance, if the separator is <->,
there are two different ways to decompose
ABC<->DEF<->GHI.
Paired names are useful, for instance,
to denote theorems that state certain kinds of relations
between functions (denoted by the first and second names of the pairs),
where the separator describes the relation,
e.g. F-~>-G could denote a theorem stating that
the function F is transformed into an equivalent function G.
Subtopics
- Make-paired-name
- Construct a paired name.
- Paired-name-separator
- Separator of the names in a paired name.
