R From:	CRDGW2::CRDGW2::MRGATE::"SMTP::AI.MIT.EDU::GNULISTS" 14-DEC-1990 11:54:40.81 To:	MRGATE::"ARISIA::EVERHART" CC:	, Subj:	Sather, a new object oriented language  * Received:  by crdgw1.ge.com (5.57/GE 1.80)) 	 id AA11339; Thu, 13 Dec 90 22:56:18 EST z Received: from wheat-chex (wheat-chex.ai.mit.edu) by life.ai.mit.edu (4.1/AI-4.10) id AA13645; Thu, 13 Dec 90 19:30:47 ESTM Received: by wheat-chex (4.1/AI-4.10) id AA08900; Thu, 13 Dec 90 19:30:43 EST # Resent-Date: 12 Dec 90 22:55:27 GMT   Resent-From: gnulists@ai.mit.edu2 Resent-Message-Id: <9012140030.AA08900@wheat-chex>k Received: from ucbvax.Berkeley.EDU by life.ai.mit.edu (4.1/AI-4.10) id AA01961; Wed, 12 Dec 90 17:55:44 EST F Received: from pasteur.Berkeley.EDU by ucbvax.Berkeley.EDU (5.63/1.42)* 	id AA07100; Wed, 12 Dec 90 14:55:02 -0800  Received: by pasteur (5.61/1.41)* 	id AA12684; Wed, 12 Dec 90 14:55:30 -0800- Original-To: gnu-announce@ucbvax.berkeley.edu  Path: pasteur!icsib19!omE From: om%icsi.Berkeley.EDU@ucbvax.berkeley.edu (Stephen M. Omohundro)  Sender: gnulists@ai.mit.edu C Newsgroups: gnu.announce,comp.lang.eiffel,comp.lang.c++,comp.object / Subject: Sather, a new object oriented language ' Message-Id: <9701@pasteur.Berkeley.EDU>  Date: 12 Dec 90 22:55:27 GMTI Reply-To: om%icsi.Berkeley.EDU@ucbvax.berkeley.edu (Stephen M. Omohundro) E Organization: International Computer Science Institute, Berkeley, Ca.  Originator: om@icsib19 To: info-gnu@prep.ai.mit.edu+ Errors-To: info-gnu-request@prep.ai.mit.edu   @ This note is a preliminary announcement of a new object-orientedF language called Sather under development at the International ComputerB Science Institute. We will probably have an initial release of theD compiler and library classes sometime in the next several months. WeC would therefore like to get feedback on the manual both for content B and readability.  PostScript copies of the manual are available by* electronic mail from om@icsi.berkeley.edu.  C Sather is based on Eiffel but is more concerned with efficiency and @ less with some of the formal and theoretical issues addressed by= Eiffel. The language is much smaller than the current Eiffel, < it eliminates over 40 keywords and simplifies the syntax andE inheritance rules. Several features were added to increase efficiency @ and to simplify programming. Efficient arrays are built into the? language itself (objects may have a dynamically allocated array B portion after their static features). The typing scheme allows the? programmer to distinguish between dispatched and non-dispatched D declarations. As in C++ local variables may be declared at the pointE of use. Sather classes may have shared variables which are accessible > from every instance of that class. For efficiency reasons, theD exception handling mechanism based on setjump and long-jump has beenA eliminated and the garbage collector is not based on the Dijkstra D algorithm. Many cosmetic issues have been changed (eg. more than one  class may be defined in a file).  D Like Eiffel, Sather code is compiled into portable C and efficientlyD links with existing C code. The Sather compiler is written in SatherE and has been operational for several months, though it is still being D improved. Preliminary benchmarks show a performance improvement over? Eiffel of between a factor of 4 and 50 on basic dispatching and D function calls. On the Stanford Self benchmarks (including 8 queens,F towers of hanoi, bubblesort, etc), Sather is slightly faster than C++,B though this is probably due to the C compiler's better ability to 2 optimize for a Sparcstation than the C++ compiler.  @ Our plans are to make the Sather compiler and libraries publiclyF available under a license whose only restriction is acknowledgement ofF the use of Sather and of the authors of any classes used in a program.E We would like to establish a repository for efficient, reusable, well > written, publicly available, classes for most of the importantE algorithms in computer science. There are currently about 120 classes A in the library. Some examples of classes being worked on include:   7 base: integers, strings, random number generation, etc. & compiler: classes used in the compilerE connectionist: back propagation, radial basis functions, competitive  @    learning, Kohonen nets, perceptrons and other neural network 
    algorithms F datastr: various hash tables, priority queues, union find, lists basedG    on amortized doubling of extendible arrays, gap lists, binary trees, +    bit_vectors, stacks, queues, sorts, etc. . debugger: classes used in interpreter/debugger@ geometry: vectors, boxes, balls, Delaunay triangulation, Voronoi+    diagrams, kd-trees, point location, etc. B grammar: deterministic finite automata, dfa minimization, parsers,    string search algorithms ; graph: minimal spanning tree, depth first search, connected ,    components, max flow, shortest path, etc.F graphics: plotting routines, ray tracing, modelling, graphics pipeline3 imageproc: bitmaps, dithering, filtering, FFT, etc. : interface: XView classes, PostScript and Framemaker output@ numerical: matrix classes (SVD etc.), special functions, complexE    numbers, linear programming, conjugate gradient optimization, etc. = statistics: least squares fits, density estimators, nonlinear C    regression, hidden markov models, nearest neighbor classifiers,       decision tree induction, etc.  C The libraries are growing quickly and will collect together classes C from many authors under the same unrestrictive license. A GNU emacs ? editing mode for Sather exists. We are working on a combination F interpreter, debugger, and browser. A parallel extension of Sather for1 shared memory machines is also under development.    --Stephen Omohundro   