SRFI 85: Recursive Equivalence Predicates

by William D Clinger

status: withdrawn (2006/10/21)

Abstract

This SRFI defines two related equivalence predicates that are recursive, not just partial recursive: they terminate on all arguments. One of these predicates, equiv?, is consistent with the equal? procedure described in the R5RS: Whenever equal? terminates, equiv? returns the same value as equal?.