On Wed, Nov 16, 2022 at 7:34 AM Marc Nieper-Wißkirchen < marc.nie...@gmail.com> wrote:
> > > But can you define a reasonable base case E ≡ (make-product-comparator) > such that (make-product-comparator X) ≡ (make-product-comparator E X) ? > > The type predicate would be (lambda () #t), and the equality predicate > the coarsest one. > What about the ordering predicate... Ah, since (=? E a b) is always true for arbitrary objects a and b, (<? E a b) is always false. That makes sense. Then I just wish the base case behavior is described explicitly in the srfi text.
