This page is part of the web mail archives of SRFI 38 from before July 7th, 2015. The new archives for SRFI 38 contain all messages, not just those from before July 7th, 2015.
(define x (cons #f #f)) (define y (cons 1 1)) (set-car! x y) (set-cdr! x y) (write x) should produce ((1 . 1) 1 . 1) when written in an R5RS-conformant system, and *not* (#0=(1 . 1) . #0#)iirc, Al Petrofsky posted an algorithm that detects circularities without also catching sharing. It has higher computational complexity and is harder to implement than detecting all sharing.
CL makes this distinction. See http://www.lispworks.com/reference/HyperSpec/Issues/iss274_w.htm(*) Arguably, R5RS even specifies how circular structures should be written - as infinite outputs.