Re: [Haskell-cafe] Strange subtract operator behavior - and lazy naturals

On Wed, Oct 17, 2007 at 12:41:54PM +0200, Yitzchak Gale wrote: John Meacham wrote: if anyone is interested, Although I bet this has been implemented a hundred times over, I have attached my lazy naturals module below just for larks. Nice, lots of fun! Wouldn't it be more convenient

Re: [Haskell-cafe] Strange subtract operator behavior - and lazy naturals

that I read about them at the moment hmm... John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Strange subtract operator behavior - and lazy naturals

-strict in the left argument, but tail-lazy in both. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell] Module system question

interactions between proposals that might not be obvious when considered separately. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] Strange subtract operator behavior

a perfectly reasonable subtract, but no negate. I think losing x-1 would be worth it. but I know there were some other ideas out there that might be preferable but could still be handled at the lexing stage rather than the parsing one... John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] Strange subtract operator behavior - and lazy naturals

days. John -- John Meacham - ⑆repetae.net⑆john⑈ -- Copyright (c) 2007 John Meacham (john at repetae dot net) -- -- Permission is hereby granted, free of charge, to any person obtaining a -- copy of this software and associated documentation files (the -- Software), to deal

Re: If newtype = data !, then why use does Haskell' need newtype

is a nop. That said, ghc is quite clever and figured out it can unbox that data type for you in this particular case, but such a transformation is not necessarily valid in general. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-prime mailing

Re: [Haskell-cafe] getting crazy with character encoding

that others would find useful. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Is take behaving correctly?

!) John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Small question

. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: Prefix form of unboxed tuple

of kind polymorphism would be needed to type the prefix form properly. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Re: RTS/Garbage Collector idea

or the ascii characters. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Re: [Haskell-cafe] let vs do?

transformed enough that I wouldn't consider it core haskell. (in particular, the use of monads in grin have no coorespondence to the use of monads in the original haskell source) (I am being sloppy with my use of 'core' here... we need some more words) John -- John Meacham

Re: [Haskell-cafe] More on the random idea

'. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

OT: shell prompt

of unix command lines to use a semicolon ';' as the prompt, as it has no effect in bourne derived shells so you can always cut-n-paste the whole line into your shell and be good to go. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell

Re: [Haskell-cafe] Just for a laugh...

unrelated and having to declare bogus instances is annoying. It is probably just a holdover from C that we think of them as related. 'Bool' would be a simple example of something that is a good instance of bits, but not Num. John -- John Meacham - ⑆repetae.net⑆john

Re: [GHC] #1384: Exporting a module that isn't imported doesn't fail

' in the export list is defined to export all names in scope which are of both in scope under the names 'Foo.bar' and 'bar' and both names refer to the same entity. There is no particular reason this set can't be empty. though, it certainly could be warning-worthy. John -- John Meacham - ⑆repetae.net

Re: [GHC] #1384: Exporting a module that isn't imported doesn't fail

On Sun, May 27, 2007 at 10:49:41PM +0100, Ian Lynagh wrote: On Sun, May 27, 2007 at 02:16:15PM -0700, John Meacham wrote: On Sun, May 27, 2007 at 08:28:25PM -, GHC wrote: Exporting a module that isn't imported doesn't fail. An example is, from rnfail028

Re: Wanted: warning option for usages of unary minus

4 defaults to, probably Integer, but could be a compile error if defaulting is off or changed. Though, the current floating point support in haskell is pretty funky as is... John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users

Re: Wanted: warning option for usages of unary minus

4 defaults to, probably Integer, but could be a compile error if defaulting is off or changed. Though, the current floating point support in haskell is pretty funky as is... John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-prime mailing

Re: [Haskell-cafe] Editor OT: streamofconciousness

] http://en.wikipedia.org/wiki/Cscope [3] http://en.wikipedia.org/wiki/Sam_(text_editor) [4] http://en.wikipedia.org/wiki/Acme_%28Plan_9%29 [5] http://tlau.org/research/smartedit/ -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell

Re: ghc stackfaults

On Sun, May 20, 2007 at 04:23:58PM +0200, Arie Peterson wrote: John Meacham wrote: | ghc 6.6 and 6.6.1 both go into infinite loops and eventually die with a | stackfault when trying to compile the attached file with optimizations | turned on. | | [...] | | -- A term, can have values

Re: optimization that doesn't make recompilation be needed more often?

a huge complicated module like module Grin.EvalAnalysis(grinEvalAnalysis) where ... and if I put a {-# NOINLINE grinEvalAnalysis #-} in there then changes to the module don't cause other stuff to be recompiled. John -- John Meacham - ⑆repetae.net⑆john

Re: Wanted: warning option for usages of unary minus

if there is a non-identifier character preceeding it. A little ugly. but still better than the current situation IMHO. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http

Re: Wanted: warning option for usages of unary minus

-- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

ghc stackfaults

ghc 6.6 and 6.6.1 both go into infinite loops and eventually die with a stackfault when trying to compile the attached file with optimizations turned on. -- John Meacham - ⑆repetae.net⑆john⑈ module C.Op where {- Basic operations. These are chosen to be roughly equivalent to c-- operations

Re: [Haskell-cafe] global variables

that are safe. like newMVar etc.. where safe means more or less commutative and omittable. this doesn't require any special support, just a newtype ACIO a = ACIO (IO a) deriving(Monad,Functor) and then have a module only export the trusted things in the ACIO monad. John -- John

Re: [Haskell-cafe] global variables

native haskellp programs with the full power of C code. (plus, lots of optimizatuons are available to the compiler when it sees the definitions like this and it is really easy to implement) John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell

Re: [Haskell-cafe] Picking an architecture for a Haskell web app

. It works for all the code in the wild I tried it on. Only 50 lines long or so to boot. One can come up with pathological cases it doesn't get right, but one can do the same for ghc as well :) http://repetae.net/repos/getlaid/ John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] Converting CTime - Int

provides such accuracy via CTime. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Imagining a G-machine

On Wed, May 16, 2007 at 03:47:07PM -0700, Stefan O'Rear wrote: On Wed, May 16, 2007 at 03:41:30PM -0700, John Meacham wrote: I look forward to the day when the OS will notice that a binary was compiled from haskell, and therefore is provably not buggy due to haskells strong type system. So

Re: main main main main main

which is very nice for optimizing compilers. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs

Re: [Haskell-cafe] Mathematica

up the screenshots on the ghc page. :) John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: binary distribution problem

-a and passed -m32 or -m64 as appropriate, so you can trivially compile both 32 bit and 64 binaries on the same system. by running 'setarch' beforehand. also, ghc seems to produce noticibly faster 32 bit code than 64 bit code. John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] Re: Cost of Overloading vs. HOFs

that import). I know the standard trick using a 'Fail' superclass, but having the compiler recognize that special case feels very unclean. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: Wanted: warning option for usages of unary minus

to such a minor change in the big scheme of things, but the current treatment of negation has annoyed me more than any other misfeature I think. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org

Re: {-# INLINE me_harder #-}

anyway. I originally added it so some early flow-insensitive optimizations wouldn't end up doing silly things like unifying all uses of 'id' program-wide. The compiler is smarter now, so it is less needed, but it still exists. John -- John Meacham - ⑆repetae.net⑆john

Re: Cost of Overloading vs. HOFs

takes care of later scrutinizations (method lookups) on the same type. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell

Re: Cost of Overloading vs. HOFs

lookup is done explicitly via the case statement, it can be optimized via standard transformations in nice ways. John - Conal On 5/4/07, John Meacham [EMAIL PROTECTED] wrote: On Fri, May 04, 2007 at 03:07:41PM -0700, Conal Elliott wrote: Does anyone know what became

Re: [Haskell-cafe] Poor first impression

ghc is in fedora extras, all you needed to do to install it is ; yum -y install ghc just like you would install most everything on a fedora system. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

Re: Why do we have stack overflows?

, but it does not play nice with garbage collection so may hurt your performance and memory usage in unforeseen ways. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http

Re: [GHC] #1246: = operators get compiled worse than ==

On Mon, Mar 26, 2007 at 09:51:02PM -0700, Stefan O'Rear wrote: On Mon, Mar 26, 2007 at 09:31:41PM -0700, John Meacham wrote: On Mon, Mar 26, 2007 at 09:23:13PM -0700, Stefan O'Rear wrote: On Mon, Mar 26, 2007 at 09:15:35PM -0700, John Meacham wrote: actually, this is not true

Re: [Haskell-cafe] Grabbing list of functions from current module

). sed -ne 's/^ast_\([a-z0-9_A-Z]\+\).*$/(\1,ast_\1)/p' File.hs note the two occurances of 'ast_'. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo

Re: [Haskell] -compiler-options vs {#-LANGUAGE Flags-#}

actually that needs to be cleaned up at some point. (Distribution2.* ?) hrm.. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] -compiler-options vs {#-LANGUAGE Flags-#}

On Thu, Apr 05, 2007 at 10:53:31AM -0700, Stefan O'Rear wrote: On Thu, Apr 05, 2007 at 10:42:09AM -0700, John Meacham wrote: On Sat, Mar 24, 2007 at 01:18:30PM +0100, Lennart Kolmodin wrote: I think the LANGUAGE pragma is much better than OPTIONS_GHC, for several reasons. * It's

Re: [Haskell-cafe] Automatic derivation (TemplateHaskell?)

of the same name. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] A wish for relaxed layout syntax

, I tend to do when (condition met) $ do first thing second thing though, the semicolon thing above would allow the layout you want too. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http

Re: [GHC] #1246: = operators get compiled worse than ==

to load zero into a register and cmp against it. though, there could be other things going on with ghc of course. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-bugs mailing list Glasgow-haskell-bugs@haskell.org http

Re: [GHC] #1246: = operators get compiled worse than ==

On Mon, Mar 26, 2007 at 09:23:13PM -0700, Stefan O'Rear wrote: On Mon, Mar 26, 2007 at 09:15:35PM -0700, John Meacham wrote: actually, this is not true for the specific case of testing against zero on x86 at least. there is a 'zero flag' that is set whenever the result of an operation

Re: [Haskell-cafe] Application of iterate

[ n | (n,True) - iterate (\n - let n' = n/2 + t/(2 * n) in (n',n' == n)) t ] John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: strict bits of datatypes

matching on strict data types? Just a theory. I am not sure how to debug this in ghc without digging into it's code. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-prime mailing list Haskell-prime@haskell.org http://www.haskell.org/mailman

Re: Feature proposal: ghc --full-flag-help ?

in docs/man in a GHC tree). man pages? dear golly how many times have I wanted that. (many) any reason they don't seem to be included in the fedora ghc rpms? John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list

Re: [Haskell-cafe] Re: idea for avoiding temporaries

runtime: eval/apply vs push-enter paper garbage collector: non-stop collection for haskell paper fundep implementation: ? concurrency: STM papers + original concurrency paper (are these accurate BTW?) John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] idea for avoiding temporaries

with it) can provide some fertile ideas for exploration here.. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Implementation of Dynamic datatype

desirable, anyone could take a lead. I think data Dynamic where Dynamic :: a - TypeRep - Dynamic would be better, as it would cache the TypeRep for fast equality, while the 'Typeable' version would perhaps have to go through a dictionary lookup to get at it. John -- John

Re: [Haskell] ANN: binary arithmetic type library over natural kinds

. This all seems very interesting, I would like it if there were a standardish type level arithmetic library in base. though, I find it a little aethetically jarring without user defined kinds like in omega. John -- John Meacham - ⑆repetae.net⑆john

[Haskell-cafe] Re: EnumSet and EnumMap

/Util/SetLike.hs actually, my 'SetLike' and 'MapLike' typeclasses also defined in that file are quite useful too. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman

Re: [Haskell-cafe] idea for avoiding temporaries

care about the particular constant value it is) I imagine infering the uniqueness of values shouldn't be that hard as a form of it is already done for avoiding thunk-updates. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list

[Haskell] method annotations

. Anecdotal examination of core leads me to believe they could be signifigantly beneficial. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] ANNOUNCE: Data.CompactString 0.1 - my attempt at a Unicode ByteString

or ucs-4 or migrating to it. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell] ANNOUNCE: Data.CompactString 0.1 - my attempt at a Unicode ByteString

it. a _very_ large win for the 'Ord' instance for CompactString. and it is not just files, foreign functions in utf8 locales often take or return strings as arguments, being able to just call those directly with the bytestring contents is also a big win. John -- John Meacham

Re: [Haskell-cafe] Portable implementation of unsafeCoerce

' a value that has been coerced to another type. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: help from the community?

elegant general change to the type inferencer rather than a special case. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-prime mailing list Haskell-prime@haskell.org http://www.haskell.org/mailman/listinfo/haskell-prime

Re: [Haskell-cafe] It matters how Type Synonyms are defined?

-topic, but this is a perfect example of where newtype deriving is great. newtype ScopeState a = ScopeState (State (Scope VVar) a) deriving(Monad,Functor,State (Scope VVar)) I just really like this idiom is all. Using it pervasively pays off greatly. John -- John Meacham

Re: Global variables

was to create a new type 'ACIO' which contained only 'good' top level operations. There will be an 'unsafeIOToACIO' of course, I mean, ACIO functions have to be implemented somehow. :) John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-prime

hrm...

what it compiles to is something involving Integers, lots of coercions and other nasty stuff when it should consist of a couple of primitive operations. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow

Re: hrm...

On Sat, Jan 27, 2007 at 01:48:29AM +0100, Lemmih wrote: On 1/27/07, John Meacham [EMAIL PROTECTED] wrote: so I have this simple bit of code, which should be fast but seems to be being compiled to something very slow. import Data.Word import Data.Bits fhb :: Word - Word fhb w = b1

Re: [Haskell-cafe] Re: [Haskell] ANNOUNCE: binary: high performance, pure binary serialisation

', so far, I think it may be better in time _and_ space! cache effects no doubt. A nice thing about it is that for the common case, short ascii strings, the serialized form takes up exactly as much as they would in C, very nice. :) John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] ANNOUNCE: binary: high performance, pure binary serialisation

in order to bring the stream to the next alignment boundry specified, and setAlignment would force the current alignment to be some value, without outputing any bytes. Would these be doable? They would open up a lot of possibilities. John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] Re: ANNOUNCE: binary: high performance, pure binary serialisation

as this: import Data.Binary data Foo = Foo Int Char | Bar Foo {-!derive: Binary -} and then compiling with the following extra options to ghc ghc -pgmF drift-ghc -F ... now everything will be taken care of automatically. John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell] [Fwd: Re: Computer Language Shootout]

should go without benchmarks or some good reasoning to manipulate strictness further. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] jhc - call for volunteers

stuff is in place. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

[Haskell] ANNOUNCE: DrIFT 2.2.1 - support for Data.Binary

-- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] Trouble understanding records and existential typesy

be something in addition to labeled fields, not replacing it. (Not that the current labeled field mechanism couldn't be improved some.) personally, something based on Daan's scoped labels proposal is the clear leader of the bunch. John -- John Meacham - ⑆repetae.net⑆john

[Haskell-cafe] Re: [Haskell] ANNOUNCE: binary: high performance, pure binary serialisation

-- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Re: [Haskell] ANNOUNCE: binary: high performance, pure binary serialisation

On Thu, Jan 25, 2007 at 07:11:55PM -0800, John Meacham wrote: Is the binary format portable? I need the produced files to work on both 32 and 64 bit architectures and with big and little endian machines. And of course, between different versions of a compiler or different compilers. Sorry

[Haskell-cafe] ANNOUNCE: DrIFT 2.2.1 - support for Data.Binary

-- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell] Views in Haskell

, having its normal meaning when used as a pattern match, but becoming 'undefined' when used as a constructor. perhaps this is unrelated to views, but this sort of thing is what I found attractive about the old proposal. John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] Strings in Haskell

at once. of course, Data.ByteStream can let you do this too, but you start to diverge from idiomatic haskell. Not that that is inherently the case forever. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe

Re: [Haskell-cafe] Announce: Package rdtsc for reading IA-32 time stamp counters

I would think this would be how the haskell 98 standard library CPUTime is implemented, is it not? http://haskell.org/onlinereport/cputime.html John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org

Re: [Haskell-cafe] Announce: Package rdtsc for reading IA-32 time stamp counters

On Tue, Jan 23, 2007 at 04:10:10PM -0800, Bryan O'Sullivan wrote: John Meacham wrote: I would think this would be how the haskell 98 standard library CPUTime is implemented, is it not? No. System.CPUTime gives you an approximate idea of the amount of CPU time your process, and all its

Re: [Haskell-cafe] small step evaluation as an unfold?

neat. http://www.cs.uu.nl/helium/documentation.html John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] GADTs are expressive

a) | Nil I think this could be used to help the situation, as absence analysis can discard unused portions since there is no need to deepSeq everything. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe

Re: [Haskell-cafe] State monad strictness - how?

John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: LLVM back end

to expose more tail-calls so make this two pass lambda lifting worth it. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Re: [Haskell-cafe] Showing the 1 element tuple

you are going for: http://homepages.cwi.nl/~ralf/HList/ John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

Re: [Haskell-cafe] Cabal licence files

in concept of any licenses at all? the data type should just be newtype License = License String This is actually a pervasive issue with the cabal codebase, a lot of things are hard-coded as datatypes which should just be uninterpreted thunks of data. John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] Showing the 1 element tuple

have it be ( ) 1 with a space between the parens to denote that it is a single tuple rather than a nullary one. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman

Re: [Haskell-cafe] Aim Of Haskell

for a confused beginning one on occasion. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] New Layout Rule take 2

so. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

New Layout Rule

to add to the alex grammar) John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-prime mailing list Haskell-prime@haskell.org http://www.haskell.org/mailman/listinfo/haskell-prime

Re: New Layout Rule

On Fri, Dec 08, 2006 at 03:26:30PM +, Ian Lynagh wrote: On Fri, Dec 08, 2006 at 02:33:47AM -0800, John Meacham wrote: Motivated by some recent discussion, I thought I would explore the possibilty of formalizing the haskell layout rule without the dreaded parse-error clause, as in, one

Re: Type wildcards, was: Re: [Haskell] GHC Error question

, the shorthand form is more of a natural consequence of it. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Re: [Haskell] Higher kind type inference paper

. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell mailing list Haskell@haskell.org http://www.haskell.org/mailman/listinfo/haskell

Re: [Haskell-cafe] WANTED: grey line layout boxes in vim and emacs

'. if we could come up with a formulation that didn't have those. it would make things a whole lot nicer. something like an unexpected 'in', 'of', ')' '}' ']' might do it. the lexer would have to keep track of matching brackets.. hmmm.. John -- John Meacham - ⑆repetae.net⑆john

Re: [Haskell-cafe] WANTED: grey line layout boxes in vim and emacs

On Wed, Dec 06, 2006 at 05:37:01PM -0800, Carl Witty wrote: On Wed, 2006-12-06 at 16:56 -0800, John Meacham wrote: Having played with haskell parsers for various reasons, the layout rule is quite tricky due to the rules involving 'parse-error'. if we could come up with a formulation

Re: raw foregin imports - new backend for jhc: ghc

solution will be, probably to auto-generate some ghc code to simulate all the appropriate primitives the jhc front end expects to exist. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users

Re: [Haskell] Expecting more inlining for bit shifting

. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Re: bang patterns give fundamentally new capabilities?

HasNoCafRefs Strictness: A -} John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users

Re: [Haskell-cafe] why are implicit types different? (cleanup)

for many reasons IMHO. I think they should be purposefully and forcefully retired so they don't trip up new users to haskell who think they are the right way to do things. John -- John Meacham - ⑆repetae.net⑆john⑈ ___ Haskell-Cafe mailing list

<    1   2   3   4   5   6   7   8   9   10   >