worked
differently then a larger recursive group, but it is not at all obvious why
B should export 'x'. And for those who like this kind of puzzle: what
should happen if 'A' also had a definition for 'x'?
Iavor
On Sep 29, 2014 11:02 PM, John Meacham j...@repetae.net wrote:
You don't need
, kerberos, infrastructure, xmonad
http://sinenomine.net
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
John Meacham - http://notanumber.net
, infrastructure, xmonadhttp://sinenomine.net
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
that is the result you pass to the compiler.
John
On Sat, Jul 5, 2014 at 1:09 PM, Luite Stegeman stege...@gmail.com wrote:
How would you do reification with that approach?
On Sat, Jul 5, 2014 at 9:59 PM, John Meacham j...@repetae.net wrote:
Actually, I was looking into it a little, and template
on my Nexus 7
and got: Error: package file was not signed correctly.
D
On Thu, Jul 3, 2014 at 4:47 PM, John Meacham j...@repetae.net wrote:
In case anyone wanted to start writing haskell android code now, jhc
fully supports android as a target. here is an app made with it
https
-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org
just abandon things like `a'bc'd`
altogether...
On 06/15/2014 03:58 AM, John Meacham wrote:
I have this feature in jhc, where I have a 'trailing' character class
that can appear at the end of both symbols and ids.
currently it consists of
$trailing = [₀₁₂₃₄₅₆₇₈₉⁰¹²³⁴⁵⁶⁷⁸⁹₍₎⁽⁾₊₋]
John
-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
/listinfo/glasgow-haskell-users
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
extensions.
John
-- John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
in addition to language features, but this may be undesireable
as then it would behave differently when specified in a LANGUAGE
pragma.
John
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
.
John
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
, Herbert Valerio Riedel h...@gnu.org wrote:
On 2014-05-30 at 11:00:38 +0200, John Meacham wrote:
JHC has the feature that
Graphics.UI.GTK.Button can live in any of:
Graphics/UI/GTK/Button.hs
Graphics/UI/GTK.Button.hs
Graphics/UI.GTK.Button.hs
Graphics.UI.GTK.Button.hs
Just wondering
Okay, I believe I have come up with a modified version that accepts many more
programs and doesn't require complicated comma handling, you can make all
decisions based on the top of the context stack. It also allows many useful
layouts that were illegal under the old system.
The main change was
matching on current symbol and current top of stack and can be listed
as a set of tuples.
in other words, a textbook deterministic push down automaton.
John
On Wed, May 14, 2014 at 7:29 AM, Ian Lynagh ig...@earth.li wrote:
On Tue, May 13, 2014 at 11:20:25PM -0700, John Meacham wrote
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
... maybe
I can revert my current lexer parser back to simpler haskell 98 syntax and
require anything that uses extensions to use the new layout rule.
Thanks,
John
--
John Meacham - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow
kiwamu has been targeting an arm cortex-m3 succesfully with jhc. this
is a CPU with 40k of RAM running Haskell code very much on bare metal.
:)
John
On Tue, Mar 19, 2013 at 6:07 PM, Jeremy Shaw jer...@n-heptane.com wrote:
There have been at least a couple projects, such as hOp and HaLVM
On Fri, Jan 25, 2013 at 7:19 AM, Ross Paterson r...@soi.city.ac.uk wrote:
GHC implements data kinds by promoting data declarations of a certain
restricted form, but I wonder if it would be better to have a special
syntax for kind definitions, say
data kind Nat = Zero | Succ Nat
This is
I support a form of this in jhc by allowing specialization of values,
not just types.
It is actually the same mechanism as type specialization since that is
just value specialization where the value being specialized on is the
type parameter.
foo :: Bool - Int
{-# SPECIALIZE foo True :: Int #-}
Can you use 'dup' to copy the file descriptor and return that version?
That will keep a reference to the file even if haskell closes the
original descriptor.
John
On Sat, Mar 10, 2012 at 5:31 PM, Volker Wysk p...@volker-wysk.de wrote:
Hi
This is an addition to my previous post.
This
Out of curiosity, Is the reason you keep track of mutable vs not
mutable heap allocations in order to optimize the generational garbage
collector? as in, if a non-mutable value is placed in an older
generation you don't need to worry about it being updated with a link
to a newer one or is there
L = lazy
S = strict
A = absent
f :: Int - (Char,Char) - Int - Char
LS(S,L)A
means that it is lazy in the first int, strict in the tuple, strict in
the first argument of the tuple but lazy in the second and the third
argument is not used at all. I have a paper that describes it
somewhere. I
On Wed, Mar 7, 2012 at 3:26 PM, John Meacham j...@repetae.net wrote:
L = lazy
S = strict
A = absent
f :: Int - (Char,Char) - Int - Char
LS(S,L)A
means that it is lazy in the first int, strict in the tuple, strict in
the first argument of the tuple but lazy in the second and the third
Ah, looks like it got a bit more complicated since I looked at it
last... time to update jhc :)
Actually. not sure if the Eval/Box split is relevant to my core. hmm
John
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
On Wed, Mar 7, 2012 at 5:01 PM, Johan Tibell johan.tib...@gmail.com wrote:
On Wed, Mar 7, 2012 at 4:38 PM, Brandon Allbery allber...@gmail.com wrote:
I think the original type signature is needed to figure it out. In the
earlier example it indicated ghc drilling down into the type (a tuple)
On Sun, Feb 19, 2012 at 4:21 PM, AntC anthony_clay...@clear.net.nz wrote:
Hi, I'd like to propose an extremely simple extension to ghc's record
disambiguation rules,
I wonder if John is teasing us? Nothing wrt to records is simple (IMHO).
That is rather defeatist. Degree of simplicity is
It isn't local to a file though because it changes the ABI, for instance
void foo(off_t *x);
it will blow up if called from a file with a differently sized off_t.
John
On Fri, Feb 17, 2012 at 4:23 AM, Simon Marlow marlo...@gmail.com wrote:
On 16/02/2012 13:25, Eugene Crosser wrote:
On Fri, Feb 17, 2012 at 2:12 PM, Simon Marlow marlo...@gmail.com wrote:
On 17/02/12 19:36, John Meacham wrote:
It isn't local to a file though because it changes the ABI, for instance
void foo(off_t *x);
it will blow up if called from a file with a differently sized off_t.
But we're
Hi, I'd like to propose an extremely simple extension to ghc's record
disambiguation rules,
my motivation is that I often have record types with multiple constructors
but common fields.
so the handy idiom of
f Rec { .. } = do
blah
return Rec { .. }
won't work, because I don't
I have similar issues to this in jhc due to its pervasive caching of
compilation results. Basically I must keep track of any potentially
ABI-changing flags and ensure they are consistently passed to every
compilation unit and include them in the signature hash along with the
file contents. I make
FWIW
jhc has always unboxed everything smaller or equal to the size of a pointer
unconditionally. It's all about the cache performance.
John
On Thu, Feb 16, 2012 at 4:25 PM, Johan Tibell johan.tib...@gmail.com wrote:
Hi all,
I've been thinking about this some more and I think we should
On Thu, Feb 16, 2012 at 4:42 PM, Johan Tibell johan.tib...@gmail.com wrote:
1. In theory the user could create a cut-n-paste copy of the data
structure and specialize it to a particular type, but I think we all
agree that would be unfortunate (not to say that it cannot be
justified in extreme
Proxy also has the advantage that it almost exactly mirrors what it
ends up looking
like in core. The application to proxy is the user visible type application.
John
On Tue, Feb 14, 2012 at 8:18 AM, Iavor Diatchki
iavor.diatc...@gmail.com wrote:
Hello,
On Mon, Feb 13, 2012 at 5:32 PM,
:
On 10/02/2012, at 23:30, John Meacham wrote:
something I have thought about is perhaps a special syntax for Proxy, like
{:: Int - Int } is short for (Proxy :: Proxy (Int - Int)). not sure whether
that is useful enough in practice though, but could be handy if we are
throwing
around types a lot
On Fri, Feb 10, 2012 at 2:24 PM, Ian Lynagh ig...@earth.li wrote:
But it would be better if they could use the new definition. Is
PolyKinds sufficiently well-defined and simple that it is feasible for
other Haskell implementations to implement it?
There is actually a much simpler extension I
typo, I meant
Proxy :: (exists k . k) - * is isomorphic to Proxy :: forall k . k - *
John
On Sat, Feb 11, 2012 at 6:02 PM, John Meacham j...@repetae.net wrote:
On Fri, Feb 10, 2012 at 2:24 PM, Ian Lynagh ig...@earth.li wrote:
But it would be better if they could use the new definition
Would it be useful to make 'Proxy' an unboxed type itself? so
Proxy :: forall k . k - #
This would statically ensure that no one accidentally passes ⊥ as a parameter
or will get anything other than the unit 'Proxy' when trying to evaluate it.
So the compiler can unconditionally elide the
Hi, I am running into an issue where some code that compiled and
worked under 6.12 is failing under 7.0, the offending code is
class DeNameable a where
deName :: Module - a - a
getDeName :: Tc (DeNameable n = n - n)
getDeName = do
mn - asks (tcInfoModName . tcInfo)
return (\n -
Can you use a weak pointer to do what you want?
If you keep a weak pointer to the head of your expensive list then
itwill be reclaimed at the next major GC I believe. I have used
weakpointers for vaugely similar purposes before.
I guess a downside is that they will always be reclaimed on GC even
What are you trying to acomplish? A case doesn't necessarily force
evaluation in haskell depending on the binding pattern. for instance
case x of _ - undefined will parse, but the function is still lazy in
x. it is exactly equivalant to
quodlibet x = undefined
If you want to actually enforce
Isn't this what data families (as opposed to type families) do?
John
On Mon, Feb 14, 2011 at 1:28 PM, Conal Elliott co...@conal.net wrote:
Is there a way to declare a type family to be injective?
I have
data Z
data S n
type family n :+: m
type instance Z :+: m = m
type instance S
Even though the hardware is x86_64, I thought the vast majority of
macs used a 32 bit build of OSX and 32 bit programs?
John
On Tue, Feb 1, 2011 at 3:38 AM, Max Cantor mxcan...@gmail.com wrote:
The last 32-bit, Intel Mac was the Mac Mini, discontinued in August 2007. The
bulk of them
Any chance a cooling fan inside died and you are overheating it?
Can you reproduce the failure with other heavy load programs, can you
run a widget that monitors the internal temperatures and other sensors
during the build?
It does seem odd...
John
On Mon, Jan 31, 2011 at 12:46 AM, Johan
On Wed, Jan 19, 2011 at 6:32 PM, Kazu Yamamoto k...@iij.ad.jp wrote:
Hello,
I have been using GHC HEAD for some months and am suffering from the
breaks of backward compatibility.
1) MANY packages cannot be complied with GHC HEAD because of lack of
FlexibleInstances and BangPatterns.
2)
FWIW, I am forgoing functional dependencies and going straight to type
families/associated types in jhc. They are easier to implement and
much cleaner IMHO.
John
On Mon, Dec 13, 2010 at 12:29 AM, Simon Peyton-Jones
simo...@microsoft.com wrote:
Yes, I think type families are here to stay.
)
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
.
of course, this bug[1] makes it sort of moot in ghc at least.
[1] http://hackage.haskell.org/trac/ghc/ticket/r2917
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users
alloca w $ \pw - do
peek (castPtr pw)
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
Jhc compiles to ANSI C and has been tested with other ARM targets and
works fine. It may be suitable for your needs.
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell
thing. It was
6.8 that was odd, between the change in exceptions and my old workaround
for 6.8 I got somewhat mixed up.
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell
exit codes).
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
a long time until around 6.8, when we finally got it right.)
Jhc also supports ExistentialQuantification but not full GADTs.
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell
), but if ghc implements
something related, then it would be good to be compatible.
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman
at a windows box, and cygwin builds of tools were
more useful in general.
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
in the
./configure step to just let it pick up the cygwin environment will it
work properly?
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
I went ahead and implemented --print-hsc-options to jhc, which will spit
out something like '-I/usr/share/jhc-0.5/include' suitable for passing
to the hsc2hs command line. It seemed like the most straightforward
route of the choices mentioned.
John
--
John Meacham - ⑆repetae.net⑆john
] http://www.sandroid.org/imcross/
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
wrapped touch#.
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
Well, the actual problem I am trying to solve involves properly
reclaiming elements in a circularly linked list (next and prev pointers
are TVars). I have a linked list and I need to be able to remove values
from the list when all references to the node no longer exist, not
counting the linked
!
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
several tools that can use the meta-info, jhc,
cabal, franchise, hackage (for the web site layout) so it seems like
abstracting it from the build info would be a useful step in the right
direction.
John
--
John Meacham - ⑆repetae.net⑆john
independently, the other depends on the specific build
system/configuration manager used.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
functionality split among a variety of different
programs so the pieces can be used when appropriate, not as an all or
nothing thing. (bring back hmake! :) ).
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
being fixed, meerly
augmented with various work-arounds.
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
On Wed, Aug 27, 2008 at 10:18:59PM +0100, Duncan Coutts wrote:
On Wed, 2008-08-27 at 06:13 -0700, John Meacham wrote:
The problem with the way cabal wants to mix with make/autoconf is that
it is the wrong way round. make is very good at managing pre-processors,
dependency tracking
an instance, and it
wouldn't make explicit the fact that the instances of all modules it
depends on are also exported.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
there is no need to worry about it for the haskell FFI spec.
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
.
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
any extra c headers at all
then, just write out the appropriate c code to call with the conventions
specified in the ffi import specification and you won't need external
headers at all so there isn't anything to conflict with.
John
--
John Meacham - ⑆repetae.net⑆john
to write
portable C interfaces so needs to be installed on target systems anyway.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
, if there were a way to figure that stuff out without a c
compiler in a portable way, that would be cool.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman
and generalized before 'main' was even
processed...
Hmm..
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
is grab a single 'hl' file and
drop it somewhere, but you can optionally re-optimize it specifically
for your platform, (presumably after pulling it down from the web or
hackage or somewhere..)
John
--
John Meacham - ⑆repetae.net⑆john
needed is
inherently in the foreign declaration. If anything, the headers should
just be used as a sanity check, not actually to affect the generated
code. It would be nice if ghc just stopped relying on them and ignored
them altogether.
John
--
John Meacham - ⑆repetae.net⑆john
* get_COLOR_PAIRS (void) {return COLOR_PAIRS;}
hsc2hs is needed anyway for portable C bindings so it isn't too onerous
of a requirement.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
are free to provide extensions. But I'd rather see GHC get
further away from C idiosyncrasies instead of closer.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
accepts it.
Jhc thinks it is illegal according to my reading of the specification.
Any ideas about what is going on here?
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http
support will likely be added back at
some point)
I think this is a-okay as far as haskell 98 goes. Assuming latin1
without doing an 'openBinaryFile' is certainly not okay in my book.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow
?
I invoke it with
changequote({{,}})
at the beginning which seems to work well for haskell.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Glasgow-haskell-users mailing list
Glasgow-haskell-users@haskell.org
http://www.haskell.org/mailman/listinfo
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
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
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
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
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
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
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
--
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 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
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
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
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
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
, 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
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
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
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
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
, 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
1 - 100 of 253 matches
Mail list logo
