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.3 required=5.0 tests=BAYES_00, REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4 Path: eternal-september.org!reader01.eternal-september.org!reader02.eternal-september.org!news.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: "G.B." Newsgroups: comp.lang.ada Subject: Re: Ada 2012 Constraints (WRT an Ada IR) Date: Sun, 11 Dec 2016 21:51:43 +0100 Organization: A noiseless patient Spider Message-ID: References: <3ef819e8-55f7-4ef7-9f37-77e6abc33f98@googlegroups.com> <47366b42-c0a3-41bf-a44a-5241c109d60f@googlegroups.com> Reply-To: nonlegitur@notmyhomepage.de Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sun, 11 Dec 2016 20:50:21 -0000 (UTC) Injection-Info: mx02.eternal-september.org; posting-host="985f538a19ae66c848ab6227f8a3b828"; logging-data="16796"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/qd2fl8AZwVndKDB1Cm+TQi3y6tl8pwJU=" User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.12; rv:45.0) Gecko/20100101 Thunderbird/45.5.1 In-Reply-To: Cancel-Lock: sha1:BOYbwl/B0xX8OObgdtihFH1JSUI= Xref: news.eternal-september.org comp.lang.ada:32729 Date: 2016-12-11T21:51:43+01:00 List-Id: On 11/12/2016 16:40, Dmitry A. Kazakov wrote: > On 2016-12-11 14:31, G.B. wrote: >> Seeing >> >> function X (A, B: T) return T >> with Pre => A > B; >> >> I must first establish A > B before calling X, >> because "Pre" tells me so. > > I still do not understand you question about caller "doing things" with parameters. Caller passes parameters that's all. If Algorithm_Establishing_A_Gt_B then Y (X (A, B)); else -- proverbial "This shouldn't happen!" raise Program_Error; end if; I.e., the programmer writing Y (X (A, B)) has ensured that the assumption expressed as X'Pre is actually true before calling X. >> How much should a function declaration tell a programmer about >> the relation between parameters A and B in the following? > > Remainder is not a relation. Relation is a Boolean-valued function. Given parameters A, B : T and Pre => A > B the ">" is the relation, ((A, B) ∈ ">") ≣ (A > B).