Hi, "David A. Wheeler" <dwhee...@dwheeler.com> skribis:
> *However*, the current R7RS draft for "equal?" requires termination > even in the presence of cycles, as well as impose other requirements > on "write" and "display" in the presence of cycles. Will guile > support such changes? I worry that these new requirements on "equal?" > will have such a high overhead that people won't do it. But perhaps > those fear are misplaced. Are you talking about termination in the case of circular lists, or for arbitrary data structures? The former is easy and reasonably cheap, but the latter may require more work, indeed. Thanks, Ludo’.
