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=0.6 required=5.0 tests=BAYES_05,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watnot!watmath!clyde!cbatt!ucbvax!MITRE.ARPA!falgiano
From: falgiano@MITRE.ARPA.UUCP
Newsgroups: comp.lang.ada
Subject: Re: ADA Sources Wanted
Message-ID: <8703201809.AA23947@mitre.ARPA>
Date: Fri, 20-Mar-87 13:09:03 EST
Article-I.D.: mitre.8703201809.AA23947
Posted: Fri Mar 20 13:09:03 1987
Date-Received: Sun, 22-Mar-87 17:07:43 EST
References: <12286284285.10.RCONN@SIMTEL20.ARPA>
Sender: daemon@ucbvax.BERKELEY.EDU
Distribution: world
Organization: The MITRE Corp., Washington, D.C.
List-Id: <comp.lang.ada>

Request for information:

  The description of records in Ada is pretty straight forward.  There
is a very high correlation between the COBOL FD and associated 01 and
subsequent lower levels of detail, ie description of data elements and
their characteristics.
  The methods in which records are organized should also be describable
in Ada.  Has anyone done any work in standardizing the data dictionary
entries that in fact lay out the structure and inter-relations.  Of
particular note would be those that are relational structures, indexed
sequential, and networked; ie existing older technology descriptions.
  New structual descriptions would also be useful.  Comments would be
appreciated.  

LtCol Frank Falgiano
Advanced Technology Division
WIS JPMO
AV 478-2930
(617) 377-2930
falgiano@mitre