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.8 required=5.0 tests=BAYES_00,INVALID_DATE
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4c86cf2332cbe682
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 1995-01-18 09:48:52 PST
Path: 
 nntp.gmd.de!Germany.EU.net!EU.net!howland.reston.ans.net!gatech!udel!news.mathworks.com!panix!cmcl2!thecourier.cims.nyu.edu!thecourier.cims.nyu.edu!nobody
From: dewar@cs.nyu.edu (Robert Dewar)
Newsgroups: comp.lang.ada
Subject: Re: Ada.strings.bounded problems?
Date: 18 Jan 1995 12:48:52 -0500
Organization: Courant Institute of Mathematical Sciences
Message-ID: <3fjka4$2ls@gnat.cs.nyu.edu>
References: <TARJEIJ.95Jan11183331@ulrik.uio.no> <D29L78.J9@nntpa.cb.att.com>
 <3f3rl7$kts@watnews1.watson.ibm.com>
 <Mats.Weber-1301952029290001@mlma11.matrix.ch>
 <3fduto$ta7@watnews1.watson.ibm.com>
 <Mats.Weber-1701951908250001@mlma11.matrix.ch>
NNTP-Posting-Host: gnat.cs.nyu.edu
Date: 1995-01-18T12:48:52-05:00
List-Id: <comp.lang.ada>

I think probably the best thing if you want to follow this idea for
bounded strings is to make them a limited type and live with the
inconvenience of no initialization.