Account Options

  1. Sign in
The old Google Groups will be going away soon.
Switch to the new Google Groups.
Google Groups Home
« Groups Home
GADT proofs of FunDeps?
There are currently too many topics in this group that display first. To make this topic appear first, remove this option from another topic.
There was an error processing your request. Please try again.
flag
  1 message - Collapse all  -  Translate all to Translated (View all originals)
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
 
From:
To:
Cc:
Followup To:
Add Cc | Add Followup-to | Edit Subject
Subject:
Validation:
For verification purposes please type the characters you see in the picture below or the numbers you hear by clicking the accessibility icon. Listen and type the numbers you hear
 
Roberto Zunino  
View profile  
 More options Jan 3 2007, 9:28 pm
Newsgroups: fa.haskell
From: Roberto Zunino <zun...@di.unipi.it>
Date: Thu, 04 Jan 2007 02:28:31 UTC
Local: Wed, Jan 3 2007 9:28 pm
Subject: [Haskell-cafe] GADT proofs of FunDeps?

I am investigating mixing FunDeps with the type equality GADT

    data Teq a b where Teq :: Teq a a

Basically, I would like to write something like

    proof :: (C a b1, C a b2) => Teq b1 b2
    proof = unsafeCoerce# Teq

provided the FunDep

    class C a b | a -> b

Is this safe? Any caveat?

Regards,
Roberto Zunino.
_______________________________________________
Haskell-Cafe mailing list
Haskell-C...@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe


 
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.
End of messages
« Back to Discussions « Newer topic     Older topic »