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
This is also available as html at
http://repetae.net/computer/jhc/record_inference.html
Record Type Inference
=
An extension to the named field mechanism that will greatly enhance the
utility of them when combined with the existing `DisambiguateRecordFields`,
`RecordPuns`,
respects, this sounds like syntax sugar around
https://ghc.haskell.org/trac/ghc/wiki/Records/OverloadedRecordFields
have you had a look at that? (its not quite merged into HEAD yet, but that
due soon i'm told)
On Wed, Jun 4, 2014 at 2:26 AM, John Meacham j...@repetae.net wrote:
This is also
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
representation using LEB128
- Data.String added with mild magic.
--
John Meacham - http://notanumber.net/
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
___
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
:09 AM, John Meacham j...@repetae.net wrote:
Yeah, there was a bug in the way it detected editline/readline which
has been fixed in the repo.
You can run configure with --disable-line to work around it. or change
the word USE_NOLINE to USE_READLINE in src/Util/Interact.hs
always some silly
regards,
Krzysztof Skrzętnicki
On Sun, May 11, 2014 at 10:20 PM, John Meacham j...@repetae.net wrote:
After a hiatus, jhc 0.8.1 is released.
http://repetae.net/computer/jhc
- New license, jhc is now released under a permissive BSD style licence
rather
than the GPL. The license
...@community.haskell.org wrote:
Thank you for the new release. :)
On 13 May 2014 04:40, John Meacham j...@repetae.net wrote:
as for the packages i've been testing with
fgl,regex-compat,bytestring,binary,mtl,containers,unix,utf8-string,zlib,HsSyck,filepath,process,syb,old-time,pretty.
and editline ?
For me
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
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
I have merged your changes back into the main jhc tree. Thanks!
John
On Sat, Mar 16, 2013 at 5:28 AM, Kiwamu Okabe kiw...@debian.or.jp wrote:
We are happy to announce Ajhc 0.8.0.2.
It's first release announce for Ajhc.
Major change on this release is ability to compile Haskell code for
/watch?v=3R9sogReVHg
And I created many patches for jhc.
But...I think that the upstream author of jhc, John Meacham,
can't pull the contribution speedy, because he is too busy.
It's difficult that maintain many patches without any repositories,
for me.
Then, I have decided to fork jhc, named
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
Is it any more ridiculous than
f x@Nothing {} = fromJust x
main = print (f Nothing)
crashing at run time? That is what you are expressing with your first
one. This issue is completely unrelated to the named field syntax,
they behave exactly like data types with non-named fields.
However, you
Yes, this has always bothered me too.
John
On Sat, Apr 21, 2012 at 2:51 AM, Andreas Abel andreas.a...@ifi.lmu.de wrote:
In Control.Monad, when has type
when :: Monad m = Bool - m () - m ()
I think this type should be generalized to
when :: Monad m = Bool - m a - m ()
to avoid silly
On Fri, Mar 30, 2012 at 1:05 PM, Mats Rauhala mats.rauh...@gmail.com wrote:
Oh wow, I thought jhc was discontinued, but just checked the
repositories and mailing lists and it's alive and well. No idea where I
got the idea that it was discontinued. Going a little bit on tangent
here, but if I
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 #-}
Why not
data Super
= SuperA {
commonFields :: ()
aFields :: ()
}
| SuperB {
commonFields :: ()
bFields :: ()
}
| SuperC {
commonFields :: ()
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
On Fri, Mar 9, 2012 at 12:48 PM, Clark Gaebel
cgae...@csclub.uwaterloo.ca wrote:
static const double globalArray[] = { huge list of doubles };
double* getGlobalArray() { return globalArray; }
int getGlobalArraySize() { return
sizeof(globalArray)/sizeof(globalArray[0]); }
And importing
On Fri, Mar 9, 2012 at 5:49 PM, Clark Gaebel
cgae...@csclub.uwaterloo.ca wrote:
What's the advantage of using D.A.Storable over D.Vector? And yes,
good call with creating an array of HSDouble directly. I didn't think
of that!
Oh, looks like D.Vector has an unsafeFromForeignPtr too, I didn't
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 Mon, Dec 19, 2011 at 7:10 PM, Alexander Solla alex.so...@gmail.com wrote:
* Documentation that discourages thinking about bottom as a 'value'. It's
not a value, and that is what defines it.
The fact that bottom is a value in Haskell is the fundamental thing that
differentiates Haskell from
On Sat, Dec 24, 2011 at 12:37 PM, Ian Lynagh ig...@earth.li wrote:
On Fri, Dec 23, 2011 at 05:41:23PM +, Simon Peyton-Jones wrote:
I'm confused too. I'd welcome clarification from the Haskell Prime folk.
We use the library process to agree changes to the libraries, and
Haskell' should
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
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
On Thu, Feb 16, 2012 at 1:20 PM, Ian Lynagh ig...@earth.li wrote:
I've now implemented this in GHC. For now, the syntax is:
type {-# CTYPE some C type #-} Foo = ...
newtype {-# CTYPE some C type #-} Foo = ...
data {-# CTYPE some C type #-} Foo = ...
The magic for (Ptr a) is built in
On Thu, Feb 16, 2012 at 1:20 PM, Ian Lynagh ig...@earth.li wrote:
I've now implemented this in GHC. For now, the syntax is:
type {-# CTYPE some C type #-} Foo = ...
newtype {-# CTYPE some C type #-} Foo = ...
data {-# CTYPE some C type #-} Foo = ...
The magic for (Ptr a) is built in
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 Sun, Feb 12, 2012 at 11:26 PM, Roman Cheplyaka r...@ro-che.info wrote:
* John Meacham j...@repetae.net [2012-02-12 19:26:24-0800]
In haskell 98 [...]
Not sure what you mean here. You aren't going to modify an existing
standard, are you? :)
[...] a name such as 'Foo' in an export list
No, you can do nothing with the pointer on the C side other than pass
it back into haskell. It may not even be a pointer, it may be an index
into an array deep within the RTS for instance. The reason they can be
cast to void *'s is so you can store them in C data structures that
don't know about
:
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
On Wed, Feb 8, 2012 at 10:56 AM, Ian Lynagh ig...@earth.li wrote:
That sounds right. It basically means you don't have to write the C
stubs yourself, which is nice because (a) doing so is a pain, and (b)
when the foreign import is inside 2 or 3 CPP conditionals it's even more
of a pain to
the drift_procesed one. hmm..
John
On Thu, Feb 9, 2012 at 10:49 AM, Sergei Trofimovich sly...@gmail.com wrote:
On Tue, 7 Feb 2012 20:03:20 -0800
John Meacham j...@repetae.net wrote:
I am happy to announce jhc 0.8.0
There have been A lot of major changes in jhc with this release.
- http
On Thu, Feb 9, 2012 at 11:23 AM, Ian Lynagh ig...@earth.li wrote:
On Thu, Feb 09, 2012 at 04:52:16AM -0800, John Meacham wrote:
Since CSigSet has sigset_t associated with it, 'Ptr CSigSet' ends up
turning
into 'sigset_t *' in the generated code. (Ptr (Ptr CChar)) turns into char**
and so
I mean, it is not worth worrying about the syntax until the extension has been
implemented, used, and proven useful to begin with. Monads were in use
well before the 'do' notation. Shaking out what the base primitives that make
up a monad took a while to figure out.
Even discussing syntax feels
On Wed, Feb 8, 2012 at 10:56 AM, Ian Lynagh ig...@earth.li wrote:
That sounds right. It basically means you don't have to write the C
stubs yourself, which is nice because (a) doing so is a pain, and (b)
when the foreign import is inside 2 or 3 CPP conditionals it's even more
of a pain to
A good first step would be understanding how the other entry works:
cartProd :: [a] - [b] - [(a,b)]
cartProd xs ys = do
x - xs
y - ys
return (x,y)
It is about halfway between the two choices.
John
On Thu, Feb 9, 2012 at 9:37 AM, readams richard.ad...@lvvwd.com
On Thu, Feb 9, 2012 at 11:23 AM, Ian Lynagh ig...@earth.li wrote:
On Thu, Feb 09, 2012 at 04:52:16AM -0800, John Meacham wrote:
Since CSigSet has sigset_t associated with it, 'Ptr CSigSet' ends up
turning
into 'sigset_t *' in the generated code. (Ptr (Ptr CChar)) turns into char**
and so
On Tue, Feb 7, 2012 at 4:24 AM, Simon Marlow marlo...@gmail.com wrote:
Separately the unix package added support for undecoded FilePaths
(RawFilePath), but unfortunately at the same time we started using a new
extension in GHC 7.4.1 (CApiFFI), which we decided not to document because
it was
I am happy to announce jhc 0.8.0
There have been A lot of major changes in jhc with this release.
- http://repetae.net/computer/jhc
- A brand new and sanified library description file format. Now it is a true
YAML file. The previous quasi-cabal files are supported but deprecated.
- new
On Tue, Feb 7, 2012 at 4:24 AM, Simon Marlow marlo...@gmail.com wrote:
Separately the unix package added support for undecoded FilePaths
(RawFilePath), but unfortunately at the same time we started using a new
extension in GHC 7.4.1 (CApiFFI), which we decided not to document because
it was
Can't you do something like have the kind be unlifted? for instance
data Proxy (a :: #)
data Type1 :: #
data Type2 :: #
John
On Tue, Feb 7, 2012 at 12:19 PM, Douglas McClean
douglas.mccl...@gmail.com wrote:
There are all sorts of useful functions that would otherwise require
explicit
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 -
That is one of the wonderful things about haskell, most languages have
a negative correlation between codesize and productivity, however with
haskell there is a strong positive correlation. You can re-use so much
that as your code base grows it becomes easier to add new features
rather than
As expected, no warnings. But if I change this unfailable code above
to the following failable version:
data MyType = Foo | Bar
test myType = do
Foo - myType
return ()
I *still* get no warnings! We didn't make sure the compiler spits out
warnings. Instead, we
Announcing jhc 0.7.8! This is mainly a bug fix release.
http://repetae.net/computer/jhc/
Changes include:
* Now compiles under ghc 7.0.x as well as 6.12
* new standard libraries
* filepath
* deepseq
* new platforms supported
Nintendo DSi, GBA, and GP32 (thanks to Brian McKenna)
Not to mention ebay, craigslist, etc..
http://www.techdirt.com/articles/20111005/10082416208/monster-cable-claims-ebay-craigslist-costco-sears-are-rogue-sites.shtml
when there is no burden of proof for someone to take down a site then
things get very complicated.
for instance this package could
And such a thing can take months or years for the courts to figure
out, and unless your free site has a lawyer to fight for your side,
under SOPA/PIPA you can be down the entire time with little recourse.
For anyone hosting content lke hackage, github, etc. when you have
thousands of packages,
themselves shut off or delisted and sites linking to them
shut down.
John
On Wed, Jan 18, 2012 at 3:42 PM, Hans Aberg haber...@telia.com wrote:
Actually, it is a battle between the Hollywood and Silicon Valley industries.
Hans
On 19 Jan 2012, at 00:11, John Meacham wrote:
And such a thing can
Yes, they are major pains for frisby, which is a parser but needs to
be cleverer about recursion, the many and some that come with
applicative actually cause infinite loops.
John
On Sun, Dec 11, 2011 at 9:18 PM, Gregory Crosswhite
gcrosswh...@gmail.com wrote:
Hey everyone,
I am sure that
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
People tend to concentrate on the lambda which cooresponds to the
functional aspect of haskell when designing logos. Not nearly enough
attention is paid to the other striking feature, the laziness. The
'bottom' symbol _|_ should feature prominently. The two most defining
features of haskell are
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
Um, the patch theory is what makes darcs just work. There is no need
to understand it any more than you have to know VLSI design to
understand how your computer works. The end result is that darcs
repositories don't get corrupted and the order you integrate patches
doesn't affect things meaning
Error is not catchable in haskell 98. Only things thrown by raiseIO are.
On Apr 1, 2011 12:02 AM, o...@okmij.org wrote:
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Fri, Apr 1, 2011 at 2:23 AM, o...@okmij.org wrote:
John Meacham wrote:
Error is not catchable in haskell 98. Only things thrown by raiseIO are.
I see; so GHC, absent any LANGUAGE pragma, should have arranged for
`error' to generate a non-catchable exception.
Actually, it was because you
Except for the fact that compilers don't actually implement call by
need. An example would be the speculative evaluation of ghc.
http://research.microsoft.com/en-us/um/people/simonpj/papers/optimistic/adaptive_speculation.ps
And local optimizations that affect asymptotic behavior are used all
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
In general, errors are always interchangeable with another. An
exception in haskell is a value, rather than an event. Haskell
prescribes no evaluation order other than if the result is defined it
must be equivalant to the one generated by a normal-order reduction
strategy. Since error is not a
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 Sun, Jan 30, 2011 at 4:44 AM, Roman Cheplyaka r...@ro-che.info wrote:
A few questions about the inclusion of parsec:
1. It is parsec-2, not parsec-3, right?
Yes, it is parsec-2. 2.1.0.1 to be exact.
2. Does this change consist of merely inclusion parsec as a standard
library, or are
Announcing jhc 0.7.7! This release fixes a large number of bugs that cropped up
when compiling haskell out in the wild as well as adds some more features. A
major one being the garbage collector is enabled by default.
http://repetae.net/computer/jhc/
Changes: (including some changes from the
On Wed, Nov 10, 2010 at 11:33 AM, Lauri Alanko l...@iki.fi wrote:
So a naive implementation of split would be:
split g = (mkGen seed, g')
where (seed, g') = random g
(Where mkGen creates a new state from some sufficiently big seed
data.)
So what is the problem here? What kinds of
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)
On Thu, Jan 13, 2011 at 3:07 AM, Stefan Kersten s...@k-hornz.de wrote:
On 28.12.10 21:25, John Meacham wrote:
jhc generated C works on the android/ARM just fine. Android specific
libraries arn't available, so you would have to bind to what you want
with the FFI.
is there a recommended
jhc generated C works on the android/ARM just fine. Android specific
libraries arn't available, so you would have to bind to what you want
with the FFI.
John
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
On Tue, Dec 14, 2010 at 10:31 AM, Pierre-Etienne Meunier
pierreetienne.meun...@gmail.com wrote:
Is there something like an identity type, transparent to the type-checker, in
haskell ?
For instance, I'm defining an interval arithmetic, with polynomials,
matrices, and all that... defined with
On Sat, Dec 4, 2010 at 2:08 PM, Serguey Zefirov sergu...@gmail.com wrote:
Why TypeRep does have equality and doesn't have ordering?
It would be good to have that.
Yes, I have wanted that too. It would make maps from types to values
possible/efficient. There is a very critical path in jhc that
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.
1 - 100 of 1117 matches
Mail list logo
