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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,f51e93dacd9c7fca X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2002-06-19 09:25:43 PST Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!nntp.flash.net!iad-peer.news.verio.net!news.verio.net!iad-read.news.verio.net.POSTED!bpr.best.vwh.net!bpr Newsgroups: comp.lang.ada From: Brian Rogoff Subject: Re: status of Ada STL? In-Reply-To: Message-ID: References: <3d0ce154_5@news.bluewin.ch> <3D0D4274.6C5E02F9@acm.org> <4519e058.0206170753.599fd771@posting.google.com> MIME-Version: 1.0 Content-Type: TEXT/PLAIN; charset=US-ASCII Date: Wed, 19 Jun 2002 16:25:38 +0000 NNTP-Posting-Host: 192.220.65.223 X-Complaints-To: abuse@verio.net X-Trace: iad-read.news.verio.net 1024503703 192.220.65.223 (Wed, 19 Jun 2002 16:21:43 GMT) NNTP-Posting-Date: Wed, 19 Jun 2002 16:21:43 GMT Organization: Verio Xref: archiver1.google.com comp.lang.ada:26394 Date: 2002-06-19T16:25:38+00:00 List-Id: On Wed, 19 Jun 2002, Robert A Duff wrote: > Brian Rogoff writes: > > > I don't know why anyone would hate garbage collection. That seems like a > > rather odd sentiment. It also seems that if this is true he'll never be > > satisfied, since GC is just the extreme on the automatic end for memory > > management; all non-GC mem managers are "by hand" at some level. > > By "by hand", I mean the malloc/free or new/Unchecked_Deallocate style > of C, Ada, Pascal, etc. Cyclone's regions are not "by hand", and can > replace GC safely and efficiently -- if your program matches the > necessary restrictions. Well, I think that there will always (as long as I live, say ;) be places where doing everything "by hand" will be cost effective, so there will always be a place for a language which facilitates this. And I agree that Cyclone currently does not provide all of the forms of memort management one could reasonably need. It's a research project. > > Well, it ain't derived from Ada! > > I meant regions, specifically. Got it, my misinterpretation. For anyone reading who is unaware, regions are roughly what some people call arenas, with some extensions. > >... Anyways, pattern matching, like all > > modern functional languages have, would be a worthy addition to an > > Ada like language. > > Feel free to sketch out your ideas. I'd be interested. I believe the Cyclone work could be extended directly to an Ada like language. Conceptually, we want to add let (like destructuring-bind for you Lispers) and enhance Ada's case statement with pattern matching forms. In Cyclone, they add a "$" to the C syntax to handle this, and uses C's && for pattern guards. We'd use "and". Probably it would be more interesting if such a syntax could be entirely upward compatible with Ada 95, but I'm not sure how important that is. I'll put together some examples, and post them under a more relevant subject line. Just so everyone knows where I'm coming from, rather than being some disgruntled C programmer who wants to make Ada look like C, I'm a disgruntled ML programmer who'd like to see an Ada like language (meaning low level) with some MLish features. As far as high level languages go, I think some ML variant (strict FPL with imperative features, modules) extended with support for overloading is about right for me. Even the current MLs are better than the amazingly bad gunk (like Java) that gets foisted on the programming community. > > > As you say, it's worthy of study; Tucker has mentioned some ideas for > > > making it more powerful. > > > > I must have missed this. Did the discussion happen here, or elsewhere? > > No, sorry, I didn't mean here. These discussions happened in my > office and Tucker's office. ;-) Are you preparing a paper on it? -- Brian