From: aglew@ccvaxa.UUCP
Subject: Re: Procedure Parameters in Ada
Date: Sun, 8-Jun-86 15:11:00 EDT [thread overview]
Date: Sun Jun 8 15:11:00 1986
Message-ID: <11800001@ccvaxa> (raw)
In-Reply-To: 8606042209.AA23350@vrdxhq.uucp
>With the declaration mechanism available in Algol 68, it is possible
>to declare "a procedure that has two parameters: an integer and a
>procedure that has two parameters: an integer and a procedure that
>has two parameters ..." ad infinitum, which is required for strong
>type-checking of procedure parameters. Understand that
>type equivalence in Algol 68 means structural equivalence,
>while type equivalence in Ada means name equivalence -- thus
>type-checking is much simpler in Ada.
>
>Donn Milton
Thank you for the reference; I will have to chase it up. Please excuse
me, then, if I ask if type equivalennce by name is not possible in a
recursive type-mode system?
Ie. for the recursion above, couldn't something like
type procIrec = procedure ( integer i; procIrec p ) ;
be permissible, and also stop the expansion of the type indefinitely?
And, more importantly, be distinct from
type otherprocIrec = procedure ( integer i; procIrec p ) ;
which is structurally, but not name, equivalent.
?
Andy "Krazy" Glew. Gould CSD-Urbana. USEnet: ihnp4!uiucdcs!ccvaxa!aglew
1101 E. University, Urbana, IL 61801 ARPAnet: aglew@gswd-vms
next prev parent reply other threads:[~1986-06-08 19:11 UTC|newest]
Thread overview: 8+ messages / expand[flat|nested] mbox.gz Atom feed top
1986-06-04 22:09 Procedure Parameters in Ada Donn Milton
1986-06-08 19:11 ` aglew [this message]
1986-06-09 17:55 ` Chris Henrich
1986-06-10 20:22 ` Jerry Sweet
1986-06-13 20:31 ` wf
1986-06-13 20:58 ` Theodore S
-- strict thread matches above, loose matches on Subject: below --
1986-06-09 16:39 Donn Milton
1986-06-11 16:01 Donn Milton
replies disabled
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox