Re: The future of Ada is at risk

[Georg Bauhaus <rm.tsho+bauhaus@maps.futureapps.de>]

Dmitry A. Kazakov wrote:

>>>  Usually such problems have algorithmic nature.
>> Database performance problems are just like functional
>> language performance problems: The simple and elegant
>> expressions tend to be too resource consuming and must be
>> rewritten until they become efficient.
>> How would a purely relational type system remove this issue?
> 
> What has it to do with bindings? If you think that my goal is to search for
> the Holly Grail of RA, then you get me wrong. I don't care about relational
> purity.

OK, I see. Then SQL should be fine.
For me, a good compromise is this: problem domain abstractions
in Ada and then the most direct link between my Ada types and
the linguistic mechanism controlling the RDB: plain old SQL.
My programs are then written in two languages, and the connection
between the two source parts is easy, regular, and manageable.

Every ambitious binding I have seen so far isn't near the ease of a
working solution: basically, write SQL.  The most powerful thing I have
seen is CLSQL. Since Lisp tends to be most useful as a metaprogramming
language, you can do all kinds of complex magic in very clever
convolutions. Besides that, if you think of your RA type system,
will it look like SQL using Ada?