Version française
Home     About     Download     Resources     Contact us    
Browse thread
Type abstraction and (polymorphic) equality
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Alain Frisch <Alain.Frisch@i...>
Subject: Re: [Caml-list] Type abstraction and (polymorphic) equality
John Skaller wrote:
> I do not see that. The current algorithm is recursive descent
> is it not? That can also be used with a trivial modification
> to test graph equivalence, by simply keeping a list of visited
> nodes and not revisiting them. 

If you want the equivalence to be invariant by unfolding, you need to
keep a set of pairs of nodes, not just a set of nodes.

-- Alain