Re: Recursively defined data types

Thread View: comp.lang.modula2

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Bruce Bettis Thu, 18 Feb 1988 22:35

#4080

Author: Bruce Bettis
Date: Thu, 18 Feb 1988 22:35

16 lines
1491 bytes

The concept of recursively defined data types is, I think, intuitively clean
and elegant, but only from a theoretical perspective. The cold hard realities
are: (1) the size of a static or dynamic allocation is impossible to determine
with the same elegance, (2) each recursive structure would be contiguous in
memory, with all the constraints that implies, (3) assignments require more
(sometimes *lots* more) resources, namely cpu cycles and memory. These are
the three biggies, to me, I imagine there are lots of other practical reasons
to prefer referential structures. Still, it's a nice concept :)

                                  Bruce
death before disclaimer
<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>
<>Handle:   Bruce Bettis         USnail:   University of New Orleans  <>
<>BITnet:   <BEB@UNO.BITNET>               Computer Research Center   <>
<>Voices:   (504) 286-7067                 New Orleans, La. 70148     <>
<><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><><>

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads