Skip to Content.
Sympa Menu

coq-club - Re: [Coq-Club] An encoding of parametricity in Agda

coq-club AT inria.fr

Subject: The Coq mailing list

List archive

Re: [Coq-Club] An encoding of parametricity in Agda


chronological Thread 
  • From: Taral <taralx AT gmail.com>
  • To: Eugene Kirpichov <ekirpichov AT gmail.com>
  • Cc: Haskell Cafe <haskell-cafe AT haskell.org>, coq-club <coq-club AT pauillac.inria.fr>
  • Subject: Re: [Coq-Club] An encoding of parametricity in Agda
  • Date: Wed, 23 Sep 2009 09:21:00 -0700
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=mime-version:in-reply-to:references:from:date:message-id:subject:to :cc:content-type; b=c8keIlKD+cuSoViSFn+XFW5OX49fO0GCGQ119MQdJNjarP2LK5FuOEd7rDRJMx6flh SgYVB5x1UgiTiXiYiL3souYyndnqjDsEb7jUzsBuY7OQeYFChg0SwbPdQ5A6uxG2YUcY bLPid7uNUSCaR4g8pelhB/qs+oeXiscqclWBc=
  • List-archive: <http://pauillac.inria.fr/pipermail/coq-club/>

On Wed, Sep 23, 2009 at 6:46 AM, Eugene Kirpichov 
<ekirpichov AT gmail.com>
 wrote:
> It contains an ingenious (to my mind) encoding of parametricity in
> Agda that makes the Free Theorems a trivial consequence.

Perhaps I don't understand Agda very well, but I don't see
parametricity here. For one, there's no attempt to prove that:

forall (P Q : forall a, a -> a), P = Q.

which is what parametricity means to me.

-- 
Taral 
<taralx AT gmail.com>
"Please let me know if there's any further trouble I can give you."
    -- Unknown





Archive powered by MhonArc 2.6.16.

Top of Page