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=-1.9 required=5.0 tests=BAYES_00 autolearn=unavailable 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!feeder.eternal-september.org!aioe.org!.POSTED!not-for-mail From: "Dmitry A. Kazakov" Newsgroups: comp.lang.ada Subject: Re: Ada 2012 Constraints (WRT an Ada IR) Date: Mon, 12 Dec 2016 09:27:16 +0100 Organization: Aioe.org NNTP Server Message-ID: References: <3ef819e8-55f7-4ef7-9f37-77e6abc33f98@googlegroups.com> <47366b42-c0a3-41bf-a44a-5241c109d60f@googlegroups.com> NNTP-Posting-Host: vZYCW951TbFitc4GdEwQJg.user.gioia.aioe.org Mime-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit X-Complaints-To: abuse@aioe.org User-Agent: Mozilla/5.0 (Windows NT 6.1; WOW64; rv:45.0) Gecko/20100101 Thunderbird/45.5.1 X-Notice: Filtered by postfilter v. 0.8.2 Xref: news.eternal-september.org comp.lang.ada:32738 Date: 2016-12-12T09:27:16+01:00 List-Id: On 11/12/2016 21:51, G.B. wrote: > 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. So what? Programmers program programs, and how is that related to contracts etc? >>> 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). Right, ">" is a relation, Remainder is not. And the point was? -- Regards, Dmitry A. Kazakov http://www.dmitry-kazakov.de