Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!cbosgd!ihnp4!ptsfa!ames!sri-spam!rutgers!gatech!hao!noao!arizona!debray
From: debray@arizona.UUCP
Newsgroups: comp.lang.ada,comp.lang.misc,comp.ai
Subject: Automatic implementation of abstract specifications
Message-ID: <1798@megaron.arizona.edu>
Date: Tue, 7-Jul-87 11:18:32 EDT
Article-I.D.: megaron.1798
Posted: Tue Jul  7 11:18:32 1987
Date-Received: Fri, 10-Jul-87 02:08:15 EDT
References: <4661@utah-cs.UUCP>  <1337@ogcvax.UUCP>
Organization: U of Arizona CS Dept, Tucson
Lines: 20
Xref: utgpu comp.lang.ada:417 comp.lang.misc:500 comp.ai:603
Summary: [was Re: Software Reuse...]

In article <1337@ogcvax.UUCP>, dinucci@ogcvax.UUCP (David C. DiNucci) writes:
> In his Phd thesis defense here at Oregon Graduate Center, Dennis
> Volpano presented his package that did basically this.  Though certainly
> not of production quality, the system was able to take an abstraction
> of a stack and, as a separate module, a description of a language and
> data types within the language (in this case integer array and file,
> if I remember correctly), and produce code which was an instantiation
> of the abstraction - a stack implemented as an array or as a file.

I believe there was quite a bit of work on this sort of stuff at MIT
earlier in the decade.  E.g. there was a PhD thesis [ca. 1983] by
M. K. Srivas titled "Automatic Implementation of Abstract Data Types"
(or something close to it).  The idea, if I remember correctly, was to
take sets of equations specifying the "source" ADT (e.g. stack) and the
"target" ADT (e.g. array), and map the source into the target.
-- 
Saumya Debray		CS Department, University of Arizona, Tucson

     internet:   debray@arizona.edu
     uucp:       {allegra, cmcl2, ihnp4} !arizona!debray