lass hierchy construction...
of course, as always, i could just be plain wrong.
John
--
------
John Meacham http://synergy.foo.net/~john/ [EMAIL PROTECTED]
California Institute of Technology, Student.
--
On Sat, Mar 04, 2000 at 08:05:08PM +0300, S.D.Mechveliani wrote:
> John Meacham <[EMAIL PROTECTED]> writes on 4 Mar 2000
>
> > [..]
> > It is VERY useful to allow reuseability of code in ways the original
> > author did not anticipate.
> > for an example
ke the name 'Byte', i was also fooling around with
the type 'Octet'
--
--
John Meacham http://repetae.net/~john/ [EMAIL PROTECTED]
California Institute of Technology, Alum.
--
e been promoting as da' bomb.
--
------
John Meacham http://repetae.net/~john/ [EMAIL PROTECTED]
California Institute of Technology, Alum. [EMAIL PROTECTED]
--
Prelude functions so as to mesh
well with existing codebase and mindshare.
John
--
------
John Meacham http://repetae.net/~john/ [EMAIL PROTECTED]
California Institute of Technology, Alum. [EMAIL PROTECTED]
--
pular extensions.
and I am pretty sure this was too obvious to mention in the lightweight
records paper but the section of (.foo) being equivalent to
(\{_|foo=v} -> v) seems appropriate.
John
--
------
John Meacham http://www.u
make process until compilers have it integrated...
any thoughts? anyone have a link to the original paper I am talking
about?
--
--
John Meacham http://www.ugcs.caltech.edu/~john/
California Institute of Technology, Alum. [EMAIL PROT
compilation, on a
> properly configured site. That would be easy to do
> with hmake.
> There are many details to think about (should the
> parsing be made locally by the driver, or remotely...).
> How does it sound ?
--
y may
seem out of context.
--
--
John Meacham http://www.ugcs.caltech.edu/~john/
California Institute of Technology, Alum. [EMAIL
sentations. (but such access should not be required from
a haskell implementation in order to write portable programs which can
communicate in externally defined formats)
John
--
--
John Meacham http://www.ugcs.caltech
ss readable than the pattern-guard syntax.
hint: read '|' as 'such that' so
f n | n < 0 = ... reads "f of n such that n is less than zero is
..."
note also that the vertical bar interpreted in this way also
has mathematical preciden
re
> the type is usually monomorphic! It's the other way around which can
> cause trouble (e.g. there are no class context synonyms).
--
--
John Meacham http://www.ugcs.caltech.edu/~john/
California Institute of Technology, Alum. [EMAIL PROTECTED]
---
a combinator library that matches Happy in
> terms of speed (disclaimer: I haven't exhaustively tested them all, but
> given the tricks Happy does I'd be surprised). AFAIK none of the
> combinator libraries gives you (b).
--
--
general than the existing partitioning function and
> > applicable in many practical cases.
>
> But here generality comes at the expense of speed I think.
--
--
John Meacham
d whatnot. (with the help of some pragma annotations.)
-John
On Fri, May 18, 2001 at 10:32:54AM +0200, Josef Svenningsson wrote:
> John,
>
> On Thu, 17 May 2001, John Meacham wrote:
>
> [..]
> > namely that you don't necisarilly know all of the types of polym
| of excellence is a lethal habit"
> WWW: <http://www.cs.mu.oz.au/~fjh> | -- the last words of T. S. Garp.
>
> ___
.se/pub/users/hallgren/Alfa/Haskell/hbc-0..5b.bin-i386-netbsdELF.tar.gz
>
> Source snapshot:
>
> http://www.cs.chalmers.se/pub/users/hallgren/Alfa/Haskell/snapshot/1999-09-10/
>
>
>
> _______
> Haskell mailing list
> [EMAIL PROTECTED]
> ht
someone evaluating
whether to learn the language, but more of a two weeks in and not quite
getting everything FAQ.
John
--
-------
John Meacham - C
month? Thank you very much.
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL PROTEC
list
> to clear the confusion about the nature of characters above U+.
--
-------
John Meacham - California Institute of Technology, Al
rementer. which the reals satisfy. this can be demonstrated by things
like [1.0, 1.1 ..] which is obviously equinumerous to the integers. I
think the confusion comes from the fact that Enum is a misnomer, it does
not necisarilly imply the type is countable, just that we can create
meaningful c
This would, imo,
> be something quite generally useful (and it would be really nice
> to be able to derive it).
>
> - Hal
>
> ___
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
standard librarys would be great. perhaps I
will have a go at it. even if the underlying platform does not have
iconv then some basic conversions (utf8, utf16, latin1, [Char]) could
easily be provided with the same API and minimal implementation effort.
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Personally I use symbolic links, either to the file or to the whole
directory. This is not ideal since i cannot easily see which projects
depend on a given file but at least all the dependencies of a project
are visible under one directory without having to reverse-engineer the
makefile.
in cycles
trying to figure out why it isn't redundant, only to conclude that it
is.
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
= x
>
> I admit that's a bit of a change, and might break programs... In
> addition, it doesn't address the occasional need to tie type annotations
> together, something that has often made me add ugly dummy arguments used
> just for their type.
>
> --
> Ashley Yak
_
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
-
it doesnt look like that will happen then
perhaps i will have to branch to a new maintained DrIFT inspired
project.
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED
DrIFTing,
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED
there any chance it could
> > exist, or is it just syntactic salt to too many people? :)
> I whish you better luck than I've had so far whenever making posts about this
> same issue ;)
>
--
---
_
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
-
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL PROTECTED]
http
to just use
haskell as an implementation language for a library which is meant to be
called from C.
but then again, perhaps i am missing something obvious.
John
--
---
John Meacham - California Institute of Technology
s in the IO monad. Hence
> > the accumulator requires these imports.
> >
> > > import IOExts (IORef, newIORef, readIORef, modifyIORef)
> >
> >
> > The accumulator.
> >
> > > mkAccum :: (Num a) => a -> IO (a -> IO a)
> > > mkAccum n = do
> > >
rep is
> > abstract.)
> >
> > Template Haskell will be able to do this. Heart transplant operation
> > is in progress. Blood on floor, but patient still alive.
> >
> > Simon
--
---
John Meacha
science is no more about computers| [EMAIL PROTECTED]
> than astronomy is about telescopes." -Dijkstra | www.isi.edu/~hdaume
>
> _______
> Haskell mailing list
> [
reason is that hdoc will
> use the name in the module statement instead of the file name, and
> rightly so, how is it to know what the module name should be, especially
> if the module is in a directory in a hirarchical module space.
>
> It's not a big thing, but I just wonder if
ell
>
>
> =
> Christopher Milton
> [EMAIL PROTECTED]
>
> __
> Do you Yahoo!?
> Yahoo! Web Hosting - Let the expert host your site
> http://webhos
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL
> is; I'm just helping him out at the moment.
>
> ___
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
't it seem
> that Haskell, as a strongly-typed language, should not have any problem
> distinguishing the field labels of different datatypes?
>
>
> Kim-Ee
>
>
> ___
> Haskell mailing list
> [EMAIL PROTECTED]
> http
ined right here; do a search on
> the archives for "numeric prelude" for an extensive discussion.
>
> Your proposals seem interesting, but seem hard to implement/make
> precise at first glance.
>
> Best,
> Dylan Thurston
--
ts of giants
> ___
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
--
---
welcome
> Immanuel
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell
worst a MonadIOCatchable deriving from MonadIO could be
added...
John
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
, so I'd like to not have to undo it and just get the seconds as they
> are.
>
> Thanks for the help
> -mike
> ___
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
--
---
t large enough.
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
rgument or something?
similarly, how does seq work on polymorphic types? without knowing what
the unboxed representation is for a type, it seems tricky to know how to
place it in WHNF...
John
--
---
John Meacham -
if so, how is this information passed to polymorphic functions which
call seq. it seems that you would have to do something different for
abstractions and boxed values..
John
On Wed, Feb 12, 2003 at 05:32:33PM -0800, Iavor S. Diatchki wrote:
> John Meacham wrote:
> >I have
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL
gt; The question stated "without its constructor". My guess is
> "no".
>
> /K
>
> ___
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
--
--
ll be quite hacky and
unlikely to be very portable.
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROT
l.
perhaps we need a standard trinary data type, True,False,Unknown. I
guess (Maybe Bool) works.
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
execption
depending on how it was originally thrown... but i am uncertain how.
probably some obscure case involving bottoms. But to be on the safe
side, thought I'd ask.
John
--
-------
John Meacham - California
gt; >
> > Wolfgang
> >
> > _______
> > Haskell mailing list
> > [EMAIL PROTECTED]
> > http://www.haskell.org/mailman/listinfo/haskell
> >
> --
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/m
esign.
>
> - Hal
> --
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
>
--
--
GUID pragmas hsguid uses as input.
Let me know what y'all think. library developers, add a GUID to your
code. it's easy and takes no resources, but could save users of your
library a lot of hassle. :)
John
--
--
s available at
>
> http://www.cl.cam.ac.uk/~kw217/research/paper-abstracts.html#Leifer*03:G
> lobal
ooh. looks interesting. will read. I have really wanted something like
this for haskell for a while.
John
--
---
John Meacham - Cali
edges.
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
H
ers should document
their behavior (or specify a specific behavior when appropriate) and
perhaps set some #defines based on them?
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL
s might be written by catching sigCHLD and writing to an
mvar, but I can't seem to get at the siginfo_t structure from the
haskell signal callback to find out the pid of the process which died.
John
--
-------
John Meach
e return value of out the proper register or memory location, but
would obviously be very architecture specific so should be provided by
the compiler. does something like this exist? is there another way to do
this?
John
--
--
e how I would chose the appropriate dynamic
import when they all have different types, in any case I will probably
not want to write this by hand.. is there any big overhead in attaching a
ton of forign import dynamic statements to a program?
John
--
-----
le to think the future of haskell is
full of MySQL errors.
john
--
-------
John Meacham - California Institute of Te
to rules
* small isLiterate fix (TODO use nhcs deliterizer)
* prints debug info in comment in chaseImports
* code cleanups
* integrated some changes from Strafunski-DrIFT 1.7
* autoconf/automake improvements
--
---
John
y to do it
since the final 'render' routine obviously needs to be in the IO monad
so the MVars can be checked again when rerendering..
John
--
-------
John M
nt time...
John
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
Has
PackedString, and whatnot instances. It should
at least make working with alternate string representations easier.
John
--
-------
John Meacham -
A standard UTF8
packed string type might be handy though.
John
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
-
tp://www.cse.ogi.edu/~sheard/papers/generic.ps
--
-------
John Meacham - California Institute of Technolo
isible trickery at least)
John
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
this without _casm_?
probably the easiest way is to use the preproccess hsc2hs which comes
with ghc. it lets you include C code fragments and takes care of
splitting out the c code as appropriate.
John
--
--
reImpMatchOnce :: [a] -> Maybe ([a],[a],[a],Array Int [a]),
reImpMatchTest :: [a] -> Bool,
reImpMatchAll :: [a] -> [Either [a] ([a],Array Int [a])],
reImpMatc
Excuse me, I meant Andre Pang. not Andrew Pang. It's not enough I steal
his good idea, but then I get his name wrong. :)
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROT
d. something i
have found to be useful, is to use the minimal return type necessary for
the task at hand, since any unmatched values will probably need type
annotations.
John
--
ldly. (PCRE vs. posix) for example.
John
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL PROTECTED]
---
___
. although I doubt any of the optimizations will be implementable in
haskell any time soon. not ghc's Haskell# even...
John
--
---
John Meacham - California Institute of Technology, Alum. - [EMAIL PROT
rg/hawiki/RegexSyntax
and haddock documentation here:
http://repetae.net/john/computer/haskell/hsregex/hsregex/docs/index.html
John
--
-------
John Meacham - California Institute of Technology, Alum. - [EMAIL
lack of an early return seems like an ommision from the do syntax,
but an understandable one.
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
? I think it could be very useful
in 'real-world' programming and evaluating data structures and
algorithms programatically.
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mai
el
foo you get foo_u and foo_s to update and set the field respectivly,
these can now be used on any data value of the appropriate type, passing
through values that don't have the required field untouched.
see
http://repetae.net/john/computer/haskell/DrIFT/Changelog
for the complete changel
clean' too, since all we are doing is extending the "world" with new
state, but in a much cleaner/safer way then writing to a file or environment
variable or other methods of storing state in the world.
John
--
John Meacham - ârepetae.netâjohnâ
_
enence of the haskell site or other
worthy haskell projects (or decided on a book-by-book basis I imagine)
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
ke the works available. :)
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
On Fri, Jun 04, 2004 at 12:35:14AM -0700, Ashley Yakeley wrote:
> In article <[EMAIL PROTECTED]>,
> John Meacham <[EMAIL PROTECTED]> wrote:
>
> > I am a fan of allowing top level declarations of the form:
> >
> > foo <- newIORef "foo"
>
= runIdentity (sqr x)
now sqr' behaves exactly as if you used 'error' and direct code, but the
monadic version is still available for those that care about it.
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
one might say the language is deficient for
forcing you to make the easy decision anyway... but now I am rambling...
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
at are hard to name and
lead to naming conflicts. It is these structures that haskell programers
learn are not needed as their skills improve.
but yeah, I love intermediate structures as much as the next haskell
programmer :)
John
--
John Meacham - ârepetae.netâjohnâ
__
On Tue, Jun 15, 2004 at 11:30:24AM +0200, Wolfgang Jeltsch wrote:
> Am Dienstag, 15. Juni 2004 04:05 schrieb John Meacham:
> > [...]
>
> > now classes are a bit trickier, the main thing is that classes in
> > haskell are not like classes in other languages. A class in has
hat have happened in the meantime.
I think the moral is, don't hold your breath. and learn pattern guards,
they are a really really useful and universal extension to the language.
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell
t they were in nhc and hugs. although, I
must admit, I don't spend much time with these other compilers.
in that case, consider this a feature request for all other haskell
implementations to retroactivly make my statement true.
John
--
J
ng
on your copyright, send me a note before breaking out the lawyers and I
will be happy to work something out :)
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
find them more or less the most unfriendly and useless things
>
> So how do you debug problems like "Prelude.head: empty list"
> in large programs?
enable template haskell and use $head where $head is defined to generate
'head' with the error annotated with the curre
ing Exception
and the various routines like isIOError were modified to 'look through'
these annotations.
adding stack traces just where you think it might be useful becomes
quite easy then.
John
--
John Meacham - ârepetae.netâjohnâ
_
matching for deconstruction
is just a good habit to get into.
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
://www.cs.chalmers.se/~boquist/phd/index.html
Enjoy the books! More titles are in the queue. :)
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
o { a,b::Int }
au = Foo { a = undefined, b = 0 }
main = case au of
Foo { b = 1, a = 0 } -> print "foo"
_ -> print "bar"
ghc => error: Prelue.undefined
hugs => "bar"
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
d have been making my life easier. Perhaps I have
just not been trained to recognize when it should be used.
It is amazing what little things you pick up when you sit down and read
the report as if it were a novel :)
John
--
John Meacham - ârepetae.netâjohnâ
___
mp;& g directly where f and g are functions
which return bool.
http://repetae.net/john/recent/out/Boolean.html
it also gives you perl-like short circuting, so
Just 'a' || Just 'b' -> Just 'a'
and so forth...
John
--
John Meacham - ârepetae.netâjo
-boot files, so they will
get whatever is declared in those, but what is the correct thing that
should happen in a fully recursive module supporting haskell compiler?
John
--
John Meacham - ârepetae.netâjohnâ
___
Haskell mailing list
[E
1 - 100 of 253 matches
Mail list logo
