Version française
Home     About     Download     Resources     Contact us    

This site is updated infrequently. For up-to-date information, please visit the new OCaml website at

Browse thread
[Caml-list] Breaking out of iterative loops
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2002-05-02 (15:40)
From: John Max Skaller <skaller@o...>
Subject: Re: [Caml-list] Breaking out of iterative loops
Markus Mottl wrote:

>On Wed, 01 May 2002, John Prevost wrote:
>>The drawback to allowing:
>>let rec ones = 1 :: ones
>>and such expressions is that when looking at the definition of, for
>>example, 'a list and length, one would expect it to be guaranteed that
>>length terminates.  Since you can't prevent recursive use of
>>constructors, well, you can no longer guarantee that.
>I second this. Does anybody here really benefit from such cyclic
Well .. don't they make a good representation of recursive types?

John Max Skaller,
snail:10/1 Toxteth Rd, Glebe, NSW 2037, Australia.

To unsubscribe, mail Archives:
Bug reports: FAQ:
Beginner's list: