Re: termination for FDs and ATs

2006-05-01 Thread Ross Paterson
Thanks for clarifying this. On Sat, Apr 29, 2006 at 05:49:16PM -0400, Manuel M T Chakravarty wrote: So, we get the following type for f f :: (Mul a b, [Result a b] = b) = Bool - a - b - [Result a b] Given the instance definitions of that example, you can never satisfy the equality

Re: raw data access

2006-05-01 Thread John Meacham
On Tue, May 02, 2006 at 12:57:17AM +0200, Johan Henriksson wrote: toBinary :: a - [Int] -- pack data as a string of bytes fromBinary :: [Int] - a -- unpack binarySize :: a - Maybe Int -- number of bytes for this type or Nothing if not fixed the packing would be compiler dependent since it

Re: termination for FDs and ATs

2006-05-01 Thread Ross Paterson
On Sat, Apr 29, 2006 at 07:13:28PM -0400, Manuel M T Chakravarty wrote: 1. You are using non-standard instances with contexts containing non-variable predicates. (I am not disputing the potential merit of these, but we don't know whether they apply to Haskell' at

Re: WordPtr,IntPtr,IntMax,WordMax

2006-05-01 Thread Aaron Denney
On 2006-04-29, Manuel M T Chakravarty [EMAIL PROTECTED] wrote: Am Donnerstag, den 06.04.2006, 16:37 -0700 schrieb John Meacham: On Thu, Apr 06, 2006 at 04:28:01PM -0700, John Meacham wrote: I was curious if ghc could support the following basic types, they will likely just be aliases of

Re: termination for FDs and ATs

2006-05-01 Thread Martin Sulzmann
Ross Paterson writes: Thanks for clarifying this. On Sat, Apr 29, 2006 at 05:49:16PM -0400, Manuel M T Chakravarty wrote: So, we get the following type for f f :: (Mul a b, [Result a b] = b) = Bool - a - b - [Result a b] Given the instance definitions of that example, you

Re: termination for FDs and ATs

2006-05-01 Thread Martin Sulzmann
Manuel M T Chakravarty writes: Martin Sulzmann: A problem with ATs at the moment is that some terminating FD programs result into non-terminating AT programs. Somebody asked how to write the MonadReader class with ATs: