From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,a4ac379de0af89d6 X-Google-Attributes: gid103376,public From: Laurent Pautet Subject: Re: ACT announces first 100% validations of Ada 95 compilers Date: 1997/03/07 Message-ID: #1/1 X-Deja-AN: 223838016 Sender: pautet@scapin.enst.fr References: Organization: Ecole Nationale Superieure des Telecommunications, Paris France Newsgroups: comp.lang.ada Date: 1997-03-07T00:00:00+00:00 List-Id: Ole-Hjalmar Kristensen FOU TD/DELAB writes: Ole-Hjalmar> How attractive a language is for implementing Ole-Hjalmar> client-server systems also depend on other factors than Ole-Hjalmar> just having distribution built in. In the next release of GLADE, there will a nice example of client / server example: a Swiss Bank. It uses plain RPCs and distributed objects too. Ole-Hjalmar> 1. Can a client call a server compiled with another Ole-Hjalmar> compiler? Is there another compiler implementing distributed annex than GNAT ? Ole-Hjalmar> 2. Can it be used in a network of Ole-Hjalmar> heterogeneous computers? Yes. Ole-Hjalmar> 3. Does the mechanism require Ole-Hjalmar> that both clients and servers must be programmed in Ole-Hjalmar> Ada95? Yes. But you can write wrappers to interface with other stubs (CORBA). Ole-Hjalmar> And I'm not talking of what would be theoretically Ole-Hjalmar> possible here, but about what is actually practical to do Ole-Hjalmar> within a project. It would be difficult to have a very general mechanism (usable with any IDL), because some features only exist in Ada95. For instance, you can safely abort RPCs (remote ATC) or propagate hidden exceptions or distributed termination. Ada 95 distributed objects model is also in some way more powerful than other models. So, it is quite difficult to fit with simpler mechanisms. -- -- Laurent