comp.lang.ada
 help / color / mirror / Atom feed
From: jmartin@oahu.cs.ucla.edu (Jay Martin)
Subject: Re: SOLVED! Decoupled Mutual Recursion Challenger
Date: 29 Oct 1994 00:26:11 -0700
Date: 1994-10-29T00:26:11-07:00	[thread overview]
Message-ID: <38stej$q2d@oahu.cs.ucla.edu> (raw)
In-Reply-To: CyEsGL.KGE@inmet.camb.inmet.com

>> ...Of course, social science programming experiments could
>>be performed to prove that certain language styles are more SE efficient
>>than others but this might step on some toes and besides its obvious
>>and boring. 

>I think the reason such experiments are not done is that they would be
>very expensive.  We can't experiment on rats, after all.

The rats are undergrad computer science majors.  It seems me
reasonable that every CS major to take part in say 2-3 quarters of
software engineering experiments on large scale programs.  I
believe they would learn alot about programming in the large. 
These experiments should get large chunks of computer science budgets
as they are really the heart of computer science (though currently
the computer scientists don't think so).  

>Sure, theoretically, you could compare Ada-with-discriminants to
>Ada-without-discriminants, using two groups of 100 teams of programmers,
>one for each language, all doing the same project.  But that experiment
>would cost hundreds of millions of dollars.  And that's just to
>investigate whether discriminants are a good idea.  What about all the
>other features of various languages?

Surely we wouldn't want to spend time trying to quantify micro
changes in languages, but big differences like dynamic versus/static
typing, etc.  Restrictive versus permissive, etc.   Big and
orthogonal, versus small/simple non-orthogonal.  Isn't getting some data
on these differences important?  These experiments could be run by a
few CS professors and grad students at each university for less than
hundreds of millions of dollars.  

>You could compare Ada with C++ using a similarly costly experiment, but
>what would that tell you?  Having found out which of the two is "better"
>a language designer would still want to know why.  Surely neither one is
>perfect; we should strive to improve on both.

I think this study would be beneficial.  And I believe Ada9x would
come out on top.  We would know why by reading the qualitative
analysis of each of the studies.  Unfortunately, I don't believe you
can improve languages indefinitely by adding features.  To really
improve C++ and Ada9x style languages alot of features would have to
be removed and the languages remade from the ground up.

>And, of course, nobody in "real" science trusts experimental results
>until they've been duplicated by several different researchers.
>That's why I think we're going to be stuck with seat-of-the-pants
>language design and anecdotal-evidence on their merits for at least some
>decades.
>They say that in computer science, one takes a single data point, and
>extrapolates from there.  It makes curve fitting easy.  ;-) ;-)

Heh, everyone knows that fields with "science" in their name are
always non-scientific jokes. :-)

If enough CS departments were doing such studies instead of zero, 
then we would have the data points to get answers to these big 
questions.  At least we would stop people from wasting their time on
endless arguments about these topics.

Jay. 




  reply	other threads:[~1994-10-29  7:26 UTC|newest]

Thread overview: 45+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
1994-10-12 22:49 SOLVED! Decoupled Mutual Recursion Challenger John Volan
1994-10-17 15:48 ` John Volan
1994-10-17 17:55   ` Bob Duff
1994-10-17 20:52     ` John Volan
1994-10-17 22:10       ` Bob Duff
1994-10-18 22:17         ` John Volan
1994-10-19  1:01           ` Bob Duff
1994-10-19  4:45             ` Jay Martin
1994-10-19 14:38               ` Mark A Biggar
     [not found]                 ` <38fi4r$l81@oahu.cs.ucla.edu>
1994-10-24 11:49                   ` Mutual Recursion Challenge Robert I. Eachus
1994-10-24 20:32                     ` John Volan
1994-10-26 11:42                       ` Generic association example (was Re: Mutual Recursion Challenge) Robert I. Eachus
1994-10-26 23:21                         ` John Volan
1994-10-27 10:53                           ` Robert I. Eachus
1994-10-31 17:34                             ` John Volan
1994-10-27 14:37                           ` Mark A Biggar
1994-10-24 17:42                   ` SOLVED! Decoupled Mutual Recursion Challenger John Volan
1994-10-24 22:37                     ` Jay Martin
1994-10-25  5:47                       ` Matt Kennel
1994-10-25 10:04                         ` David Emery
1994-10-25 16:43                         ` John Volan
1994-10-27  4:25                           ` Rob Heyes
1994-10-28  9:03                             ` Mutual Recursion (was Re: SOLVED! Decoupled Mutual Recursion Challenger) Robert I. Eachus
1994-10-28 15:04                             ` SOLVED! Decoupled Mutual Recursion Challenger Robb Nebbe
1994-10-25 15:54                       ` John Volan
1994-10-26  1:24                         ` Bob Duff
1994-10-28  4:28                         ` Jay Martin
1994-10-28 10:52                           ` Robert I. Eachus
1994-10-28 18:46                             ` Jay Martin
1994-11-02 14:56                               ` Robert I. Eachus
1994-10-29  0:38                           ` Bob Duff
1994-10-29  7:26                             ` Jay Martin [this message]
1994-10-29 11:59                             ` Richard Kenner
1994-10-31 13:17                               ` Robert Dewar
1994-10-31 14:13                               ` gcc distribution (was: SOLVED! Decoupled Mutual Recursion Challenger) Norman H. Cohen
1994-11-02 14:14                                 ` Richard Kenner
1994-11-04 23:56                                   ` Michael Feldman
1994-10-31 18:44                           ` SOLVED! Decoupled Mutual Recursion Challenger John Volan
1994-10-20 11:25               ` Robb Nebbe
1994-10-20 19:19                 ` John Volan
1994-10-26  0:07                 ` Mark S. Hathaway
1994-10-26 18:48                 ` gamache
1994-10-27  2:15                   ` John Volan
     [not found]           ` <CxwGJF.FwB@ois.com>
1994-10-19 16:35             ` John Volan
1994-10-17 22:54   ` Cyrille Comar
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox