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=ham autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,78b2880bc7e78e39 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 2001-03-16 14:13:54 PST Path: supernews.google.com!sn-xit-02!supernews.com!news.tele.dk!128.39.3.166!uninett.no!news.powertech.no!nntp.newmedia.no!newsfeed1.enitel.no!news.telia.no!not-for-mail Sender: ohk@maestro.clustra.com Newsgroups: comp.lang.ada Subject: Re: RISC References: <98qumf$5sf$1@nh.pace.co.uk> <98r4g1$7r1$1@nh.pace.co.uk> <3AB22CB2.E8A851A5@averstar.com> From: Ole-Hjalmar Kristensen Message-ID: X-Newsreader: Gnus v5.5/Emacs 20.3 Date: Fri, 16 Mar 2001 20:51:30 GMT NNTP-Posting-Host: 195.204.160.194 X-Complaints-To: abuse@enitel.no X-Trace: news.telia.no 984775890 195.204.160.194 (Fri, 16 Mar 2001 21:51:30 CET) NNTP-Posting-Date: Fri, 16 Mar 2001 21:51:30 CET Organization: Enitel Internet Public Access Xref: supernews.google.com comp.lang.ada:5780 Date: 2001-03-16T20:51:30+00:00 List-Id: Robert A Duff writes: > There are also a lot of things that rep clauses just can't express. Eg, > TCP/IP protocols often have data structures defined like "a count byte, > followed by an array of sub-records" where the count gives the number of > sub-records, or the number of bytes including (or not including) the > count byte itself. I would like to have a language that could describe > that sort of thing at a reasonably high level. > > - Bob Perhaps something like the facilities in Haskell would be a good starting point? -- Kabelsalat ist gesund. Ole-Hj. Kristensen