Article View: comp.lang.modula2
Article #4076Re: Recursively defined data types.
From: fred sullivan
Date: Wed, 17 Feb 1988 05:53
Date: Wed, 17 Feb 1988 05:53
11 lines
1091 bytes
1091 bytes
I first dealt with tree structures using snobol-4, which uses recursively defined types. I was very disappointed when I learned about how one does these things in Pascal. By the time modula came along, I was over the shock. One reason for wanting recursively defined types is that their semantics is much cleaner than pointer semantics. I approve of the idea. Fred Sullivan Department of Mathematical Sciences State University of New York at Binghamton Binghamton, New York 13903 Email: sullivan@marge.math.binghamton.edu
Technical Details
Message-ID:
<807@bingvaxu.cc.binghamton.edu>Path:
arc1-ca.pugleaf.net!utzoo!mnetor!uunet!lll-winken!lll-lcc!ames!sunybcs!bingvaxu!marge.math.binghamton.edu!sullivanReferences:
<4593@uwmcsd1.UUCP> <11100002@snail> <4641@uwmcsd1.UUCP>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!mnetor!uunet!lll-winken!lll-lcc!ames!sunybcs!bingvaxu!marge.math.binghamton.edu!sullivan From: sullivan@marge.math.binghamton.edu (fred sullivan) Newsgroups: comp.lang.modula2 Subject: Re: Recursively defined data types. Message-ID: <807@bingvaxu.cc.binghamton.edu> Date: 17 Feb 88 05:53:29 GMT References: <4593@uwmcsd1.UUCP> <11100002@snail> <4641@uwmcsd1.UUCP> Sender: news@bingvaxu.cc.binghamton.edu Reply-To: sullivan@marge.math.binghamton.edu.cc.binghamton.edu (fred sullivan) Organization: SUNY Binghamton, NY Lines: 10