From: Georg Bauhaus <rm.dash-bauhaus@futureapps.de>
Subject: Re: sharp ß and ss in Ada keywords like ACCESS
Date: Wed, 12 Oct 2011 15:03:13 +0200
Date: 2011-10-12T15:03:13+02:00 [thread overview]
Message-ID: <4e959011$0$6627$9b4e6d93@newsspool2.arcor-online.net> (raw)
In-Reply-To: <op.v2661evjz25lew@macpro-eth1.krischik.com>
On 11.10.11 19:33, Martin Krischik wrote:
> Am 10.10.2011, 20:23 Uhr, schrieb Georg Bauhaus <rm.dash-bauhaus@futureapps.de>:
>
>> However, there is substantial evidence that no z would ever be
>> combined with an s such that the result is both forming an
>> "ess-zed" shape,
>
> You just have to use the right typeface:
(The crucial part that you did not quote was
``and also meaning s+z, in a word that stems from Latin,
such as "process"''
If "ss" and "ß" were treated the same in computer language,
then Switzerland will serve as evidence that it is an actual
possibility working even in natural language.) Programmers'
reaction to other equivalences such as "ae" ~ "ä" might be
less friendly.
But I imagine a language rule that addresses common sense
more than it does the mechanics of Unicode or the history
of writing; it might even be easy to implement:
Any simple name shall include alphabetic characters from
only one "alphabet".
Presuming some practical definition of "alphabet".
next prev parent reply other threads:[~2011-10-12 13:03 UTC|newest]
Thread overview: 32+ messages / expand[flat|nested] mbox.gz Atom feed top
2011-10-10 16:30 sharp ß and ss in Ada keywords like ACCESS Georg Bauhaus
2011-10-10 16:46 ` Adam Beneschan
2011-10-10 18:23 ` Georg Bauhaus
2011-10-10 22:25 ` sharp � " Randy Brukardt
2011-10-11 7:36 ` Dmitry A. Kazakov
2011-10-11 7:41 ` sharp ß " Yannick Duchêne (Hibou57)
2011-10-11 8:33 ` Dmitry A. Kazakov
2011-10-11 20:32 ` sharp � " Randy Brukardt
2011-10-12 7:43 ` Dmitry A. Kazakov
2011-10-12 9:42 ` J-P. Rosen
2011-10-12 12:09 ` Dmitry A. Kazakov
2011-10-12 20:17 ` sharp " Randy Brukardt
2011-10-12 21:18 ` Dmitry A. Kazakov
2011-10-11 17:33 ` sharp ß " Martin Krischik
2011-10-11 18:54 ` Adam Beneschan
2011-10-12 13:03 ` Georg Bauhaus [this message]
2011-10-12 13:48 ` Dmitry A. Kazakov
2011-10-12 18:24 ` Georg Bauhaus
2011-10-12 20:06 ` sharp � " Randy Brukardt
2011-10-12 20:48 ` sharp ß " Dmitry A. Kazakov
2011-10-12 22:56 ` sharp ß and ss in Ada keywords like AC CESS Georg Bauhaus
2011-10-13 8:10 ` Dmitry A. Kazakov
2011-10-13 12:13 ` Georg Bauhaus
2011-10-13 13:25 ` Dmitry A. Kazakov
2011-10-13 15:18 ` Georg Bauhaus
2011-10-13 19:17 ` Dmitry A. Kazakov
2011-10-11 7:33 ` sharp ß and ss in Ada keywords like ACCESS Yannick Duchêne (Hibou57)
2011-10-11 14:32 ` Adam Beneschan
2011-10-11 17:26 ` sharp ß and ss in Ada keywords like ACCESS (better not) Martin Krischik
2011-10-12 12:34 ` Georg Bauhaus
2011-10-10 17:22 ` sharp ß and ss in Ada keywords like ACCESS Simon Wright
2011-10-10 17:45 ` AdaMagica
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox