Untyped Ada?
in [ADA]
|
From: Phaedrus on 31 Mar 2008 18:44 It's a slow Monday, so it's time to ask non-pertinent, and possibly impertinent, question: If a non-typed or weakly typed version of Ada were available, would you use it? A) Never! My code is perfect, and I never, ever have to convert types! B) Maybe for prototypes. C) Late at night when I thought nobody could see me. With the curtains drawn. And under an assumed name. D) Proudly, and often, and in public! Who cares what the neighbors think? Cheers! Brian
From: Randy Brukardt on 31 Mar 2008 20:16 "Phaedrus" <phaedrusalt(a)hotmail.com> wrote in message news:q5CdnepU0ZzTxmzanZ2dnUVZ_t-nnZ2d(a)earthlink.com... > If a non-typed or weakly typed version of Ada were available, would you use > it? This seems like a poorly framed question. I wonder if you really mean a "dynamically typed" version of Ada (like Python), which would be an interesting question. But your actual question is essentially an anything goes language (still static, but no checking). It would be worse than C with Ada syntax, and I can't imagine the point. Ada's compile-time checking is (one of) its advantages over the great mass of languages - it is is not a problem in practice. Still, I'd never say "never" (that's silly - how do I know what I'll be doing in 20 years?). Randy.
From: tmoran on 1 Apr 2008 03:19 > If a non-typed or weakly typed version of Ada were available, would you use > it? > > A) Never! My code is perfect, and I never, ever have to convert types! Never! My code is imperfect, and Ada often points out my errors so that I can correct them.
From: Dmitry A. Kazakov on 1 Apr 2008 03:44 On Mon, 31 Mar 2008 14:44:43 -0800, Phaedrus wrote: > It's a slow Monday, so it's time to ask non-pertinent, and possibly > impertinent, question: > > If a non-typed or weakly typed version of Ada were available, would you use > it? > > A) Never! My code is perfect, and I never, ever have to convert types! > B) Maybe for prototypes. > C) Late at night when I thought nobody could see me. With the curtains > drawn. And under an assumed name. > D) Proudly, and often, and in public! Who cares what the neighbors think? Any dynamically typed system is a statically typed system where all objects are instances of the same type which has all possible methods. So there is no choice anyway. -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de
From: Jean-Pierre Rosen on 1 Apr 2008 04:28 Phaedrus a �crit : > It's a slow Monday, so it's time to ask non-pertinent, and possibly > impertinent, question: > > If a non-typed or weakly typed version of Ada were available, would you use > it? > There is a contradiction in the above sentence. If it is weakly typed, it's not Ada ;-) -- --------------------------------------------------------- J-P. Rosen (rosen(a)adalog.fr) Visit Adalog's web site at http://www.adalog.fr
|
Next
|
Last
Pages: 1 2 3 4 5 Prev: Ada.Real_Time behavior with GNAT Next: GnatBench (from GPL edition) |