comp.lang.ada
 help / color / mirror / Atom feed
From: Florian Weimer <fw@deneb.enyo.de>
Subject: Re: Common ADA apps
Date: Thu, 19 Jul 2001 22:20:06 +0200
Date: 2001-07-19T22:20:06+02:00	[thread overview]
Message-ID: <87hew87jt5.fsf@deneb.enyo.de> (raw)
In-Reply-To: 9i58gq$abt$1@nh.pace.co.uk

"Marin David Condic" <marin.condic.auntie.spam@pacemicro.com> writes:

> GNAT is at least one reasonably famous app written in Ada.

From Jargon File (4.2.3, 23 NOV 2000) [jargon]:

  MFTL /M-F-T-L/ [abbreviation: `My Favorite Toy Language'] 1.
  adj.  Describes a talk on a programming language design that is heavy on
  the syntax (with lots of BNF), sometimes even talks about semantics (e.g.,
  type systems), but rarely, if ever, has any content (see {content-free}).
  More broadly applied to talks -- even when the topic is not a programming
  language -- in which the subject matter is gone into in unnecessary and
  meticulous detail at the sacrifice of any conceptual content.  "Well,
  it was a typical MFTL talk".  2. n. Describes a language about which the
  developers are passionate (often to the point of proselytic zeal) but
  no one else cares about.  Applied to the language by those outside the
  originating group.  "He cornered me about type resolution in his MFTL."
  
     The first great goal in the mind of the designer of an MFTL is
  usually to write a compiler for it, then bootstrap the design away from
  contamination by lesser languages by writing a compiler for it in itself.
  Thus, the standard put-down question at an MFTL talk is "Has it been
  used for anything besides its own compiler?"  On the other hand, a
  (compiled) language that cannot even be used to write its own compiler
  is beneath contempt.  (The qualification has become necessary because
  of the increasing popularity of interpreted languages like {Perl} and
  {Python}.) See {break-even point}.
  
     (On a related note, Doug McIlroy once proposed a test of the
  generality and utility of a language and the operating system under
  which it is compiled: "Is the output of a FORTRAN program acceptable as
  input to the FORTRAN compiler?"  In other words, can you write programs
  that write programs? (See {toolsmith}.)  Alarming numbers of (language,
  OS) pairs fail this test, particularly when the language is FORTRAN;
  aficionados are quick to point out that {Unix} (even using FORTRAN)
  passes it handily.  That the test could ever be failed is only surprising
  to those who have had the good fortune to have worked only under modern
  systems which lack OS-supported and -imposed "file types".)



  reply	other threads:[~2001-07-19 20:20 UTC|newest]

Thread overview: 8+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2001-07-06 20:39 Common ADA apps John Poltorak
2001-07-06 20:53 ` Marin David Condic
2001-07-19 20:20   ` Florian Weimer [this message]
2001-07-06 21:01 ` Ted Dennison
2001-07-07  0:48 ` Jeffrey Carter
2001-07-07  8:58 ` Pascal Obry
2001-07-07 12:36   ` John Poltorak
2001-07-07 12:42     ` Pascal Obry
replies disabled

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