New commit to allow definitions of morphisms on relations whose carrier is

a Prod. Example: m : feq ==> feq where m has type (A -> B) -> (C -> D)
and few is a relation over (fun X Y: Type. X -> Y).
The problem is to avoid the interpretation (A -> B) -> C -> D that tries
to use feq over D and feq over C considering (A -> B) as a quantification.

This closes a wish of Bas Spitters.


git-svn-id: svn+ssh://scm.gforge.inria.fr/svn/coq/trunk@7068 85f007b7-540e-0410-9357-904b9bb8a0f7

0 files changed, 0 insertions, 0 deletions