Dear Simon, dear Mark,
I had a very cursory look at your Practical type inference for
arbitrary-rank types paper. One thing that catched my attention
was the remark about predicativity in Sec. 3.4. Recently, I posted
a `bug report' to the glasgow-haskell-bugs mailing list complaining
about GHC's
Interesting. I hadn't realised that predicativity could affect size of
types.
Nor do I know how Hugs and nhc manage to succeed! I don't think either
of them do fancy hash-consing of types. Maybe Malcolm W knows?
Simon
| -Original Message-
| From: Ralf Hinze [mailto:[EMAIL PROTECTED]
Bugs item #769768, was opened at 2003-07-11 10:25
Message generated for change (Tracker Item Submitted) made by Item Submitter
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=769768group_id=8032
Category: Compiler
Group: 6.0
Status: Open
Resolution: None
On Thu, 10 Jul 2003, Volker Stolz wrote:
In local.glasgow-haskell-users, you wrote:
I use the Posix library since I have to communicate via a pipe with
another UNIX process.
Therefore I have to use
fdRead :: Fd - ByteCount - IO (String,ByteCount)
Why do you have to use an Fd?
A
On Fri, 11 Jul 2003, Volker Stolz wrote:
createPipe :: IO (Fd,Fd) (Unkown alternatives)
I suppose you have to pass this descriptor to another process
through fork()?
Rigth.
(piper,pipew) - createPipe
mpid - forkProcess
case mpid of
Nothing - do --child
nobytes - fdWrite
On Fri, Jul 11, 2003 at 08:39:54AM +0200, Rafael Martinez Torres wrote:
(piper,pipew) - createPipe
piperHandle - fdToHandle(piper)
threadWaitRead ( fdToInt(handleToFd(piperHandle)) )
message - hGetLine piperHandle --or whatever.
There's no need to call threadWaitRead, Haskell's RTS will take
what exactly happens when ghc applies `-fdicts-strict' ?
and what could then be the reason for
Fail: Oops! Entered absent arg w_s1Bjs {GHCziBase.Ord {- tc 2c -} c {- tv a1AVd -}}
when executing the compiled program?
best regards,
--
-- Johannes Waldmann
The original message was received at Sat, 12 Jul 2003 01:09:41 -0400 (EDT)
from grimy.research.bell-labs.com [204.178.16.57]
- The following addresses had permanent fatal errors -
[EMAIL PROTECTED]
(reason: 550 5.1.1 [EMAIL PROTECTED]... User unknown)
- Transcript of
This is the Postfix program at host mailgate2.isx.com.
I'm sorry to have to inform you that the message returned
below could not be delivered to one or more destinations.
For further assistance, please send mail to postmaster
If you do so, please include this problem report. You can
delete your
In article [EMAIL PROTECTED],
Glynn Clements [EMAIL PROTECTED] wrote:
instance Num Vector where
Except that class instances have to be algebraic datatypes (data) or
renamed datatypes (newtype), but not type synonyms (type).
That's not true, is it? I mean as long as there isn't already
In article [EMAIL PROTECTED],
Andrew J Bromage [EMAIL PROTECTED] wrote:
This suggests that wrapping each standard mathemtaical
function/operator in its own typeclass would have literally
no run-time performance penalty:
class Plus a b c | a b - c where
(+) :: a - b - c
fre 2003-07-11 klockan 08.07 skrev Ashley Yakeley:
In article [EMAIL PROTECTED],
Glynn Clements [EMAIL PROTECTED] wrote:
instance Num Vector where
Except that class instances have to be algebraic datatypes (data) or
renamed datatypes (newtype), but not type synonyms (type).
G'day all.
On Thu, Jul 10, 2003 at 11:16:56PM -0700, Ashley Yakeley wrote:
As written, this is _not_ a good idea. Trust me, you end up having to
put type annotations everywhere. Even (3 + 4 :: Integer) is ambiguous,
you have to write (3 :: Integer) + (4 :: Integer).
But that's what
Why must every Monad instance be a datatype or newtype, even if there
will be just a single constructor?
Peter
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
How may I hide constructors in O'Haskell 'cause export lists don't work
in this language?
Peter
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Hi all,
Can any one tell me what is the use of
.hi (interface) files. I want to know the steps involved
in the compilation of a .hs file. I went thru the what nhc98
roughly does and saw that it generates interface file for
each module. Please enlighten as to what is the precise
function of
Ashley Yakeley [EMAIL PROTECTED] writes:
There should be a separate syntax for that. As it stands, the string
3.1415926536 unambiguously specifies a rational number. Perhaps
something like 3.1415926536... should be interpreted as the 'simplest'
rational that agrees with the given digits,
Why must every Monad instance be a datatype or newtype, even if there
will be just a single constructor?
Peter
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
How may I hide constructors in O'Haskell 'cause export lists don't work
in this language?
Peter
___
Haskell-Cafe mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell-cafe
Ketil Z. Malde [EMAIL PROTECTED] writes:
I.e. for 3.14, allow any rational number in [3.14,3.15), or
perhaps (3.135,3.145]? Or restrict it to just the rational number in
range with the least total digits?
We can get this effect using a version of (%) adapted specifically for
converting
Ç×°®µÄÅóÓÑ£º
ÄúºÃ£¡
ÕâÊÇÀ´×ÔÏÃÃÅÊб¦Áé¿Æ¼¼ÍøÂçÓÐÏÞ¹«Ë¾µÄÎʺ¸ÐлÄúÊÕ¿´Õâ·âÓʼþ¡£ÎÒÃÇÕæ³ÏµÄÏ£Íû
ÄúÄܳÉΪÎÒÃÇÔÚ¹óµØÇøµÄÖØÒª»ï°é¡£ÎÒÃÇÊÇÒ»¼Ò²ÉÓÃÊÀ½ç¸ßм¼Êõ½á¾§£¬Ñо¿¡¢ÍƹãºÍ·¢Õ¹
м¼Êõ£¬ÖÂÁ¦ÓÚ»¥ÁªÍøÐÅÏ¢·þÎñ¡¢ÓòÃû×¢²á·þÎñºÍÐéÄâÖ÷»ú·þÎñµÄ¸ßм¼ÊõÆóÒµ¡£ÏêÇéÇëä¯
ÀÀ:http://www.host-china.com
21 matches
Mail list logo
