Why Ada isn't as successful as it should be

Why Ada isn't as successful as it should be

[Adam Beneschan]

Maybe it isn't about the syntax, the verbosity, or the lack of text-handling support:

http://www.wired.com/wiredenterprise/2012/06/beard-gallery/

                      -- Adam

Re: Why Ada isn't as successful as it should be

[Dmitry A. Kazakov]

On Mon, 18 Jun 2012 11:12:20 -0700 (PDT), Adam Beneschan wrote:

> Maybe it isn't about the syntax, the verbosity, or the lack of text-handling support:
> 
> http://www.wired.com/wiredenterprise/2012/06/beard-gallery/

A bearded anecdote (:-))

I think it was influenced by very rusty Bald-Hairy Theory of Russian
Leaders:

http://www.stophairlossnow.co.uk/News/Bald-or-hairy-rule-of-thumb-for-Russian-leaders-10047.htm
http://seansrussiablog.org/2008/05/08/the-bald-hairy-theory-of-russian-leaders

which could be a borrowing itself.

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de

Re: Why Ada isn't as successful as it should be

[ggsub]

On Monday, June 18, 2012 11:12:20 AM UTC-7, Adam Beneschan wrote:
> Maybe it isn't about the syntax, the verbosity, or the lack of text-handling support:

I guess someone needs to grow a beard and invent a "new" language (that will just happen to be identical to Ada in all but name).

Re: Why Ada isn't as successful as it should be

[quiet_lad]

On Jun 18, 11:37 am, "Dmitry A. Kazakov" <mail...@dmitry-kazakov.de>
wrote:
> On Mon, 18 Jun 2012 11:12:20 -0700 (PDT), Adam Beneschan wrote:
> > Maybe it isn't about the syntax, the verbosity, or the lack of text-handling support:
>
> >http://www.wired.com/wiredenterprise/2012/06/beard-gallery/
>
> A bearded anecdote (:-))
>
> I think it was influenced by very rusty Bald-Hairy Theory of Russian
> Leaders:
>
> http://www.stophairlossnow.co.uk/News/Bald-or-hairy-rule-of-thumb-for...http://seansrussiablog.org/2008/05/08/the-bald-hairy-theory-of-russia...
>
> which could be a borrowing itself.
>
> --
> Regards,
> Dmitry A. Kazakovhttp://www.dmitry-kazakov.de

on the regex thing: do you mean the rebol inspired way is better? or
that something else is better? making regex not needed?

Re: Why Ada isn't as successful as it should be

[quiet_lad]

On Jun 18, 11:12 am, Adam Beneschan <a...@irvine.com> wrote:
> Maybe it isn't about the syntax, the verbosity, or the lack of text-handling support:
>
> http://www.wired.com/wiredenterprise/2012/06/beard-gallery/
>
>                       -- Adam

why should ada be more successful?

I heard it handles SMP well, and maybe has something better than
regex.

Where is the all ada os?

where is the all ada database?

Re: Why Ada isn't as successful as it should be

[J-P. Rosen]

Le 20/06/2012 01:04, ggsub@pragmada.co.cc a �crit :
> On Monday, June 18, 2012 11:12:20 AM UTC-7, Adam Beneschan wrote:
>> Maybe it isn't about the syntax, the verbosity, or the lack of text-handling support:
> 
> I guess someone needs to grow a beard and invent a "new" language (that will just happen to be identical to Ada in all but name).
> 
Actually, there migh be some truth here. Successful languages are made
by hackers for hackers. Ada and some others was made by engineers for
professional software developers. And the beard may well be more
frequent in the first category than in the second one.

-- 
J-P. Rosen
Adalog
2 rue du Docteur Lombard, 92441 Issy-les-Moulineaux CEDEX
Tel: +33 1 45 29 21 52, Fax: +33 1 45 29 25 00
http://www.adalog.fr

Re: Why Ada isn't as successful as it should be

[Dmitry A. Kazakov]

On Tue, 19 Jun 2012 22:20:33 -0700 (PDT), quiet_lad wrote:

> on the regex thing: do you mean the rebol inspired way is better? or
> that something else is better? making regex not needed?

And in which connection are regular expressions to beards?

As for REBOL, I don't know it, it looks similar to BNF, but the key issue
are recursion and repetition (to be able to match things like balanced
brackets). Iterative patterns have the problem of infinite looping when the
iterated sub-pattern may match an empty substring. E.g. a pattern like

   $[DIGIT]

here $ is an "eager" repeater, will never end. The correct one is:

   DIGIT $DIGIT

I played these games in late 80's, before I get convinced that patterns is
not an answer. The remnants are here:

   http://www.dmitry-kazakov.de/match/match.htm

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de

Re: Why Ada isn't as successful as it should be

[leonid.dulman]

On Monday, June 18, 2012 8:12:20 PM UTC+2, Adam Beneschan wrote:
> Maybe it isn't about the syntax, the verbosity, or the lack of text-handling support:
> 
> http://www.wired.com/wiredenterprise/2012/06/beard-gallery/
> 
>                       -- Adam

There is no any problem to write good game on ADA-2012 or build own WEB Browser. 
All you can do on Java, C++, C#, you can do on ADA

Re: Why Ada isn't as successful as it should be

[Yannick Duchêne (Hibou57)]

Le Wed, 20 Jun 2012 16:15:49 +0200, <leonid.dulman@gmail.com> a écrit:

> On Monday, June 18, 2012 8:12:20 PM UTC+2, Adam Beneschan wrote:
>> Maybe it isn't about the syntax, the verbosity, or the lack of  
>> text-handling support:
>>
>> http://www.wired.com/wiredenterprise/2012/06/beard-gallery/
>>
>>                       -- Adam
>
> There is no any problem to write good game on ADA-2012 or build own WEB  
> Browser.
> All you can do on Java, C++, C#, you can do on ADA

Yes, what can be done with Turing Complete X can also be done with  
whatever Turing Complete Y, and luckily, Ada is as much Turing Complete as  
the aboves (teasing :D ).

-- 
“Syntactic sugar causes cancer of the semi-colons.” [1]
“Structured Programming supports the law of the excluded muddle.” [1]
[1]: Epigrams on Programming — Alan J. — P. Yale University

Re: Why Ada isn't as successful as it should be

[Dmitry A. Kazakov]

On Wed, 20 Jun 2012 19:48:00 +0200, Yannick Duch�ne (Hibou57) wrote:

> Le Wed, 20 Jun 2012 16:15:49 +0200, <leonid.dulman@gmail.com> a �crit:
> 
>> On Monday, June 18, 2012 8:12:20 PM UTC+2, Adam Beneschan wrote:
>>> Maybe it isn't about the syntax, the verbosity, or the lack of  
>>> text-handling support:
>>>
>>> http://www.wired.com/wiredenterprise/2012/06/beard-gallery/
>>>
>> There is no any problem to write good game on ADA-2012 or build own WEB  
>> Browser.
>> All you can do on Java, C++, C#, you can do on ADA
> 
> Yes, what can be done with Turing Complete X can also be done with  
> whatever Turing Complete Y, and luckily, Ada is as much Turing Complete as  
> the aboves (teasing :D ).

Wrong.

The correct statement is: any problem which can be solved by a Turing
complete system can be done in either X or Y if both are Turing-complete.

That does not imply that any problem solvable in X is solvable in Y. Only
Turing-complete one are. X can be more than Turing-complete. E.g. real-time
clock, user input, etc available to X but not to Y.

P.S. Turing had no beard. Get lost! (:-))

-- 
Regards,
Dmitry A. Kazakov
http://www.dmitry-kazakov.de

Re: Why Ada isn't as successful as it should be

[Yannick Duchêne (Hibou57)]

Le Wed, 20 Jun 2012 20:41:41 +0200, Dmitry A. Kazakov  
<mailbox@dmitry-kazakov.de> a écrit:
> P.S. Turing had no beard. Get lost! (:-))

But he had a nice teddy bear, named Porgy:
http://i.telegraph.co.uk/multimedia/archive/02158/Untitled-1_2158770b.jpg


-- 
“Syntactic sugar causes cancer of the semi-colons.” [1]
“Structured Programming supports the law of the excluded muddle.” [1]
[1]: Epigrams on Programming — Alan J. — P. Yale University