SRFI 85: Recursive Equivalence Predicates

by William D Clinger

status: withdrawn (2006-10-21)

keywords: Comparison

• The SRFI Document
• Discussion Archive
• Git repo (on Github)
• srfi-85@nospamsrfi.schemers.org (subscribers only)
• Subscribe to srfi-85 mailing list

  daily digest?

• Unsubscribe from srfi-85 mailing list

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?.