some 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 Meacha
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`, an
inary 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
; building jhc later.
>
>
> Best regards,
> Krzysztof
>
>
> On Tue, May 13, 2014 at 5:09 AM, John Meacham 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
> Thank you for the new release. :)
>
> On 13 May 2014 04:40, John Meacham 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,p
libraries are known to
> work for jhc?
>
> Best regards,
> Krzysztof Skrzętnicki
>
>
> On Sun, May 11, 2014 at 10:20 PM, John Meacham wrote:
>>
>> After a hiatus, jhc 0.8.1 is released.
>>
>> http://repetae.net/computer/jhc
>>
>> - New license,
Yes, this has always bothered me too.
John
On Sat, Apr 21, 2012 at 2:51 AM, Andreas Abel 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 "return
On Thu, Feb 16, 2012 at 1:20 PM, Ian Lynagh 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 to
On Thu, Feb 9, 2012 at 11:23 AM, Ian Lynagh 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 gene
using the drift_procesed one. hmm..
John
On Thu, Feb 9, 2012 at 10:49 AM, Sergei Trofimovich wrote:
> On Tue, 7 Feb 2012 20:03:20 -0800
> John Meacham wrote:
>
>> I am happy to announce jhc 0.8.0
>>
>> There have been A lot of major changes in jhc with this release.
>
On Wed, Feb 8, 2012 at 10:56 AM, Ian Lynagh 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 replicate them
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 stand
On Tue, Feb 7, 2012 at 4:24 AM, Simon Marlow 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 still experimenta
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)
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 una
ters can be fully integreated
into the word, so the entire space usage of
"Hello" is 10 words as lists benefit from the same packing benefits as
Maybe.
compare this to 30 or so words used in a traditional "everything is on
the heap and tagged" model.
The manual has a
selftest.
* bug fixes
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On Mon, Jul 12, 2010 at 11:57:18AM +0100, Simon Marlow wrote:
> On 09/07/2010 18:46, John Meacham wrote:
>> On Fri, Jul 09, 2010 at 12:39:38PM +0100, Simon Marlow wrote:
>>> On 08/07/2010 22:46, John Meacham wrote:
>>>> Ack, I just noticed that IntPtr,IntMax, and Word
address of a stack allocated object will inhibit certain gcc
optimizations.
The underlying allocator is based on Bonwick's slab allocator[2] which
works quite well for a haskell runtime, I have a slab for each type, so
a slab of 'cons' cells, a slab of size 3 tupl
version is stored in the cache files, so multiple
versions of jhc don't clobber each others cache entries
- Ord instance for lists fixed
- recursive type synonyms detected properly
- make sure errno.h is included when errno is referenced
- don't give a parse error when seein
On Fri, Jul 09, 2010 at 12:39:38PM +0100, Simon Marlow wrote:
> On 08/07/2010 22:46, John Meacham wrote:
>> Ack, I just noticed that IntPtr,IntMax, and WordPtr and WordMax were
>> left out of the report. These are fairly vital for writing portable FFI
>> code.
>
> Make
Ack, I just noticed that IntPtr,IntMax, and WordPtr and WordMax were
left out of the report. These are fairly vital for writing portable FFI
code.
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Haskell mailing list
pports garbage collection and a speedier runtime and
better support for external build systems will be out soon. My goal is
one more point release before 0.8.0 which will have full haskell 2010
and 98 support.
John
--
John Meacham - ⑆repetae.ne
On Wed, May 26, 2010 at 01:17:00PM -0700, Evan Laforge wrote:
> Unfortunately then you get another cockamamie restriction in the whole
> JVM vs. tail calls thing... but if you can get around that then lots
> of people will like you a lot.
Working on it... :)
John
--
Joh
=> Set a = ...
like Jan-Willem suggests, then it seems that 'Set' should not be able to
unify with 'item' since it has the extra 'Ord' consraint on the
contravariant argument to item and item is universally quantified. Item
would need a psuedo-type l
'e',Down 'f']
Set.toAscList sxs2
[Down 'f',Down 'e',Down 'd',Down 'c',Down 'b',Down 'a']
We have been able to break the invarients of 'Set' using newtype
deriving of a completely unrelated class
ions to INLINE
- qualified method names fix
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
ed by the build in a
non-precise way. This is necessary so a theoretical 'jhc-pkg' tool need
only worry about adding required libraries, not cleaning up or worrying
about finding consistent sets of libraries. A simple recursive download
on dependencies suffices as a rudimentary
n the list at:
http://www.haskell.org/mailman/listinfo/jhc
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
to GHC extensions and it is missing
some notable ones such as MPTCs, but has some other interesting ones
such as first class existential types.
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net/
___
Haskell mailing list
H
also now available in the repetae yum repository which you can
get at via
; rpm -i http://repetae.net/yum/repetae-repo-1.0-3.noarch.rpm
; yum install jhc
Enjoy!
John
--
John Meacham - ⑆repetae.net⑆john⑈ - http://notanumber.net
not difficult to achieve with some attention to
strictness annotations.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
ic analysis (such as full region inference
will do) helps all back ends so I will likely spend some time focusing
on that.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
stances come with (since they are based on fedora core 8). Man. those
high CPU ec2 instances are great for plowing through regression tests.
:)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
uint32_t v14532078 = (v184744394 - 1);
v184744394 = v14532078;
goto fW_a__fMain__fl_aMain__countdown_d43_u8;
}
}
}
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
oin the list
and let us know.
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
never
referenced again. hence something like 'free' is okay which wouldn't be
if other references to the object exist. do you think that is 'formal'
enough of a description? seems clear enough if ACIO is well defined which I
think it is.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
f not code)) just ignore the windows and treat the architecture
as having a flat 32 register file.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
want is getting frustrating.
see http://pdos.csail.mit.edu/~baford/packrat/thesis/ for more
information on packrat parsing and PEGs. I have continued development of
pappy from Bryan Ford's original version and my repo is at [2].
[1] http://repetae.net/computer/frisby/
[2] http://repetae.net/r
t;Id's" are cute, but I do a
double take every time I try to parse one with my brain :).
John
>
> John Meacham wrote:
>> On Tue, Feb 05, 2008 at 08:01:07AM -0500, Cale Gibbard wrote:
>>> I also like this idea. Retaining the ability to treat selection as a
>&
.
a *' b = almostMultiply a b
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
common with tuples than the current labeld field
mechanism so parens are a much more natural choice. you can think of
tuples as 'anonymous positional data types' and records as 'anonymous
labeled data types'. when thought about that way, parenthesis make a lot
more sense
about and illuminate any 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
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, fo
o the code.
This is a major problem with Distribution.* in general 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
gt; be useful for the sorts of programs I tend to write--which have run-time
> sizes.
I think this sort of thing will 'just work' unless I am misunderstanding
what you want.
This all seems very interesting, I would like it if there were a
standardish type level arithmetic librar
mization are availabe in jhc, but only via pragmas
and some built in heuristics/special knowledge in the compiler.
Implementing the above syntax has been on my todo list. Anecdotal
examination of core leads me to believe they could be signifigantly
beneficial.
John
--
John Meacham - ⑆repet
as decoding
it, then sorting 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.
hould be ascii, utf8 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
Foo for unary constructors
update for label 'foo' provides 'foo_u' to update it and foo_s
to set it
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
e and
system F) to .NET as all the front/middle end stuff is in place.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
le, make
everything else as lazy as possible.". at least, that is as far as one
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
_' would be allowed,
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 M
y from my previous algorithm which
envolved from the original hatchet code, which is derived from the THIH
paper.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
ment monadic recursion.
the home page and more information is here:
http://repetae.net/computer/frisby/
I would greatly welcome feedback on the API.
I have included routines that take standard regular expression syntax
and translate them into an equivalent frisby parser.
John
--
John M
egular expression
backends to be used via a common and useful interface.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
t; least may slip under the wire (and I don't make any use of arrays, so it
> shouldn't be too slow).
; jhc -v Main.hs
; strip hs.out
; ls -al hs.out
-rwxr-xr-x 1 john john 6008 Jun 30 14:37 hs.out
6k or so.
John
--
Jo
l constrained polymorphism to get good strictness results.
Most of this is just idle speculation though based on some perceived
parallels...
of course, this is probably not very interesting and obvious...
but I found it pretty neat. I'm odd like that.
Hmm.. what
mplemented for
building very fast free variable sets in jhc. I considered making a
stand-alone version that included the judy source, but decided it would
be much nicer to just link against the libjudy installed on the system
as it is a generally very usefu
t so it can finish up its long computation.
with MVars, you never know whether an MVar is being used for simple
locking or as an inter-thread communication mechanism.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing
too.
perhaps this library should be renamed 'FastByteArray' instead? which is
a very useful datatype too.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
DrIFT 2.2.0 has been released.
you can learn about and download it here
http://repetae.net/john/computer/haskell/DrIFT/
a summary of changes since the last resease follows
DrIFT-2.2.0:
Mon Apr 10 00:39:24 PDT 2006 John Meacham <[EMAIL PROTECTED]>
* add note about reconf script
* ma
brary, New I/O library, and even CharIO module from jhc
> sources
programs compiled by jhc will use the proper locale as set by the system
so support any encoding your c libraries support.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haske
d too.
Also, it looks like some of your monads overlap with what is provided by
the Applicative (Idiom) and friends classes to be included in the next
version of ghc, perhaps you can make a version of monadLib that builds
on those?
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
ply, stacking a WriterT or a StateT or
whatever is simple after the fact.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
o
everything C can do but better" without mubling something about with a
few caveats under my breath :)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
nd
of a name in jhc are equivalent in intent to # at the end in ghc, it
just means "this might be special in some way" but if we were to have a
common name, it should be something more descriptive. perhaps `dependingOn` ?
> dependingOn :: a -> b -> a
> dependingOn = flip
e c-- style
continuations to grin which should obviate the need for setjmp and
longjmp which currently cannot be optimized through all that well.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On Tue, Feb 21, 2006 at 10:15:59AM +, Malcolm Wallace wrote:
> John Meacham <[EMAIL PROTECTED]> wrote:
>
> > I generalized this primitive to
> >
> > drop__ :: a -> b -> b
>
> Also known in the Prelude as "const"...
well, 'flip co
gmas have been proposed for in the past.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On Mon, Feb 20, 2006 at 05:10:02PM -0800, Iavor Diatchki wrote:
> On 2/20/06, John Meacham <[EMAIL PROTECTED]> wrote:
> > I think the problem is that 'mzero' exists, the correct solution seems
> > to be to get rid of the 'mzero' method of MonadPlus. Sinc
dditive operator, there is no need for another concept
of zero and it seems to me that is the real issue. mzero can simply be
defined as 'fail "mzero"'.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
ls more appropriate to me,
there isn't really an 'mplus' you are going to use so making it the
mzero just doesn't feel right.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
> newAT__ :: Int -> AT a -> Array__ a
> newAT__ n (AT a1) = a1 (prim_newAT__ (prim_newWorld__ a1) n)
so the initial call to newAT__ now depends on the array transformer and
can't be floated out as a CAF.
I have reduced several magic primitives to just one, the world cre
we could experiment with more advanced
representations without breaking anyones code.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
27;s, so is
> entirely portable between Unix/Windows - important if you want to be
> able to create a binary that runs anywhere.
also if you want to manipulate windows paths from unix and vice versa.
any standard library should support that sort of thing.
John
--
John
:
> data World__
>
> data IOResult a = FailIO World__ IOError | JustIO World__ a
> newtype IO a = IO (World__ -> IOResult a)
I belive other implementations have used continuations for IO as well.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
lso get around any issues with 'public domain' not being a well defined
term in some places and more clearly expresses the intent.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
independent of anything else, giving up error messages on pattern match
failures in do notation is not acceptable. so, if the split were to
happen, having two methods in MonadZero, one which takes a string
argument, would be needed.
John
--
John Meacham - ⑆repetae.net⑆john
lymorphic
functions that are {-# INLINE #-}'d for which all polymorphic functions
called by it are also inlined to be applied to unboxed arguments.
a $ b = a b
id x = x
f . g = \x -> f (g x)
being particularly useful instances of this
John
--
at type does f have?
f :: Foo -> Foo
or
f :: Bar -> Bar
?
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
what type would
f x = x { foo = "hello" }
have if there were multiple types with 'foo' as a field name?
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
It seems to me that trac is mainly about the various 'fptools' projects
and hawiki is about haskell topics in general.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.o
Type a) -> (forall b . Type b) -> Bool
which means something quite different.
if we use 'exists' for existential types, this might be another useful
use of said name.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell
ways to improve the current record system more
conservativly. (like, why is update partial? it should not be partial.
grr.)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
category. you can cause the compiler itself
to bottom out using them.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
or an
instance than + and *. however, I don't know if this ever actually
occurs in practice.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
from) Perhaps I just dislike dogshed discussions
(even when taking place internally)
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
le a
data type with no appropriate field.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
askell 06)
I'd also like to see 'join' and 'ap' added to Monad while we are at it.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
read_getspecific' returns the value currently associated with
> KEY in the calling thread.
>
> If there is no such key KEY, it returns `NULL'.
in gcc you can create (faster) thread local storage with the __thread
keyword. as in
__thread int foo;
m
On Wed, Oct 19, 2005 at 12:01:07AM +0200, Daan Leijen wrote:
> John Meacham wrote:
> >On Tue, Oct 18, 2005 at 08:31:19AM +0100, Simon Peyton-Jones wrote:
> >>GHC tries not to create space leaks, but does not guarantee not to. In
> >>particular, the full laziness tran
ld onto more than needed.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
bar"),(1,"ooo"),(2,"ar")],array (0,2)
[(0,"foobaaar"),(1,"oo"),(2,"aaar")]]
here is its homepage:
http://repetae.net/john/computer/haskell/JRegex/
I released a different version of this library in the past, but this
version has been cleaned up, moved to a proper spot in the libraries,
and is cabalized.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
other issues mentioned in my other reply.
>
> One final thing which would be nice is the ability to define
> instances of superclass methods in a subclass declaration. But this
> takes things in a different direction entirely.
7;alias' so it is clearer what is going on. but if it were actually
implemented we could decide whether we want it or not.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
On Thu, Oct 13, 2005 at 01:41:14PM -0400, Paul Govereau wrote:
> On Oct 12, John Meacham wrote:
> >
> > [...]
> >
> > > class Num a where
> > > (+), (*):: a -> a -> a
> > > (-) :: a -> a -> a
> > > negate
than just rewriting
the prelude. the Lattice example I gave is right out of my toolbox and
my anoyances with it are part of what motivated me to write this.
> Anyway, my main point it: would a smaller change not suffice?
I do not think it suffices.
We cou
eah, that has confused several people already. I wish I used the new
syntax in my original post, it really makes more sense.
John
--
John Meacham - ⑆repetae.net⑆john⑈
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
1 - 100 of 253 matches
Mail list logo
