Authority = Nothing
}
,conn )
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/http://xtalk.msk.su/~ott/
http://alexott-ru.blogspot.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
add the values together without needing to traverse the list ;-)
>
Don't need to traverse the list at run time, not compile
(actually macro-expansion) time.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
On Wed, Jan 14, 2009 at 5:16 PM, Max Rabkin wrote:
> On Wed, Jan 14, 2009 at 11:11 AM, Alex Queiroz wrote:
>> I have one for binding GET/POST variables to regular variables
>> transparently and with error checking, just inside the body of the
>> macro.
>
>
ful when writing a web app in
> Lisp was something I called hash-bind, which binds variables to the
> values in a hashtable, with the variable names as keys. For example:
>
I have one for binding GET/POST variables to regular variables
transparently and with error checking, just inside
>>>>> "AV" == Andrea Vezzosi writes:
AV> Does it also let you apply a suggestion automatically?
Not, i'll look for this suggestion, but i'm not sure, that this is possible
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/ ht
ase. The exception was:
exit: ExitFailure 1
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/http://xtalk.msk.su/~ott/
http://alexott-ru.blogspot.com/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
-mode-hook ()
(local-set-key "\C-cl" 'hs-lint))
(add-hook 'haskell-mode-hook 'my-haskell-mode-hook)
Module is available from http://xtalk.msk.su/~ott/common/emacs/hs-lint.el
--
With best wishes, Alex Ott, MBA
http://alexott.blogspot.com/http://xta
al use -- lots of other companies have
> decided this is OK. You just need to be aware of it.
>
They have decided this is OK as long as they can ship a shared library.
Cheers,
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
he sharing of parts of
structures, like lists. In an imperative world this is straightforward,
one allocates a linked list, uses it, and then releases the memory. In a
world full of closures that may have captured parts of your list, manual
memory management is near impos
Hallo,
Andrew Coppin wrote:
>>
>> In what alternate universe?
>>
>
> One with a 3-day time dilation, apparently...
>
>
>
> [Sorry, couldn't resist. ;-) ]
>
No problem, I didn't get yo
just mean the type system machinery that
> has been developed could be used for other projects?
>
In what alternate universe?
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
Andrew Coppin wrote:
>
> In other news... apparently chocolate is leathaly toxic to dogs. Random.
>
Chicolate is extremely toxic to cats.
Cheers,
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@ha
, let's wait till he finds out about
Scheme. :-)
Cheers,
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
;
Maybe they don't care *that* much?
Cheers,
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
PR Stanley wrote:
Now, if you, Jules, Alex or some other wannabe Hitler have a problem
with my freedom of expression then your best solution is to saddle up
and get the hell out yourselves. This is the wrong place for setting up
your tinpot dictatorship, Doctor!
I am grateful for the
n the nice gentlemen's
PHP closure proposal from a language point of view, or don't say anything.
Thanks Jules, I was starting to worry about Haskell-café.
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-C
xt it will gladly convert it for you. For
reading as the correcting type, the binding should have used
sqlite3_column_get_type first.
Cheers,
-alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
hable at runtime,
though - everything Just Works as though they're ordinary objects,
including flipping integer class to Bignum (which is boxed) as necessary.
--
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
works (and, more
importantly, maintenance of water networks):
http://optimatics.com/go/case-studies-andamp-testimonials
Their tools are all C++, though.
--
Alex
Dusan
PR Stanley wrote:
Hi
What does the list think of EC? Genetic algorithm is apparently the
latest thing.
Is EC mathemati
Hi there.
If someone can tell me why I am getting type ambiguity
in the following code:
class (Ord s, Num s) => Scalar s where
zero :: s
class Metric m where
delta :: Scalar s => m -> m -> s
(=~):: m -> m -> Bool
(/~):: m -> m -> Bool
(
I see..
(Presumably you meant "instance Alg Sometype",
"instance Vec Sometype" etc.)
I have got it working now, and it looks like:
1) I can't specialise superclass methods with other
class methods, within the class hierarchy, and
2) I have to instantiate each superclass individually,
for any type
#x27;m having trouble finding what I need with Google,
and SOE doesn't really go into specifics.
Thanks for any help... Alex
Make the switch to the world's best email. Get the new Yahoo!7 Mail now.
www.yahoo7.com.au/worldsbestemail
FIRST and REST, which everyone know what they mean.
Cheers,
-alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
sp is like the Matrix, you can't be told how great it
is, you have to see for yourself.
Cheers,
-alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
were to write a small
patch to hackage so that it exposes the database in the correct format.
The cabal issue I think requires only a small modification to the
searchpath code but I don't know cabal well enough to do it....
-Alex-
Duncan Coutts wrote:
On Fri, 2007-12-21 at 13:58 +1030, Mi
type?
-alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
gt;
This is not actually true. You may be thinking of macros, but
macro expansion time is before compile time. After compilation, not
many, if any, modern Lisps keep the source around. Of course the old
Lisp machines were different.
Cheers,
--
-alex
http
haskell files
Check it out at http://searchpath.org.
-Alex-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
Cristian Baboi escreveu:
From your list, I agree to add "some pattern matching abilities" to
mine, but that it all.
Keep using Haskell and resend your list in six months.
-alex
___
Haskell-Cafe mailing list
Haskell-Cafe@h
pickling goes, HAppS-Data makes it trivial to pickle most
anything into XML or name/value pairs so that is no longer a valid
complaint.
-Alex-
Dan Weston wrote:
Hans van Thiel wrote:
On Tue, 2007-12-11 at 16:56 +0100, Wolfgang Jeltsch wrote:
Maybe there are also patient people in the outside
.
-Alex-
Tom Hawkins wrote:
Hello,
Atom is a language embedded in Haskell for describing reactive
software, primarily for realtime control applications. Based on
conditional term rewriting, an atom
description is composed of a set of state transition rules. The name
"atom" come
Sorry for the noise, people - replied to the wrong list.
Is it just me that has difficulty with the reply-to address for a
message being the original poster rather than the list it came from?
--
Alex
Alex Young wrote:
Alex Jacobson wrote:
My original point (refined) was that I'd like a
Alex Jacobson wrote:
My original point (refined) was that I'd like a file extension (.ehs)
that defaults to including all extensions that don't change the meaning
of a .hs program but that may cause a small subset of them not to
compile (e.g. ones that use forall as a type variable,
There is a simplified version of HList style functionality inside
HAppS-Data because I found Oleg's repo too hard to understand.
-Alex-
Stuart Cook wrote:
On 11/25/07, Thomas Hartman <[EMAIL PROTECTED]> wrote:
I think I'm running into more or less the same issue di
Magnus Therning wrote:
On Wed, Nov 21, 2007 at 20:40:01 +, Alex Young wrote:
Magnus Therning wrote:
On Tue, Nov 20, 2007 at 12:33:21 +, Vladimir Zlatanov wrote:
Yes, those are good points. Maybe adding functionality similar to plt's
planet http://planet.plt-scheme.org and
utweighs the minor inconvenience of having to install
RubyGems outside apt as far as I'm concerned.
--
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
, either cross-compiled or donated by someone with an appropriate
compiler. Would that be a possible here? Just a thought.
--
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
Rich Neswold escreveu:
> On Nov 14, 2007 10:59 AM, Ricardo Herrmann <[EMAIL PROTECTED]> wrote:
>> Hi brazilian haskellers,
>
> Wow! I knew the Haskell community has been growing... but there's a
> brazillian of us?
>
Well, we are m
Hi all,
Does anyone know if c2hs should be working on Windows? I'm trying to
build it under ghc 6.8.0, but this happens:
C:\Users\Alex\Documents\Plugins\c2hs\c2hs-0.15.0>runghc Setup.hs configure
Configuring c2hs-0.15.0...
Setup.hs: Error: Non-empty library, but empty exposed modu
't wanna give
> you any prejudice, so I won't tell you it's APT),
> I can get upgrades easily. But that's because I
> know how to use it. There are also other options
> beside RPM and APT.
>
Aptitude is much friendlier than APT.
Cheers,
Alex Queiroz
__
Don Stewart wrote:
alex:
You can replace most of your loops with Data.List functions, and
simplify the code overall by threading around a lazy list of randoms,
rather than calling into IO all the time:
import System.Random
import System.Environment
import Data.List
import
Tim Chevalier wrote:
On 11/5/07, Alex Young <[EMAIL PROTECTED]> wrote:
randList :: Int -> [IO Int]
randList n = randListTail [] n
randPairs :: Int -> [(IO Int, IO Int)]
randPairs n = zip (randList n) (randList n)
[snip]
doCountPair :: (IO Int, IO Int) -> IO Int
doCountPair (
isn't
tail-optimising. Is it obvious to a more trained eye where the problem
is? If not, how should I start to diagnose this? I'm not really sure
where I should look for more information.
More information, if it's relevant:
Haskell: Glasgow Haskell Compiler, Versi
rver-side, and a minor hassle client-side. Plus the file
is so small it won't shave any significant load off the server,
especially when nobody will bother to seed it. I'm sure most *nix users
get GHC from their distribution's mirrors anyhow. Mirrors are really
what you need
order matters. But I hope people are transitioning to using mkCommand
instead of expose as it provides more functionality.
-Alex-
Thomas Hartman wrote:
I have a situation where
... stuff...
$(expose ['setState, 'getState]
f = SetState
compiles but
f = SetState
$(expose
Andrew Coppin wrote:
> Where do you guys find so many strange cat pictures?!
You don't know any cats or cat owners, do you? ;)
--
Alex Tarkovsky
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo
Brent Yorgey wrote:
> Aren't you going to make one featuring a "catamorphism"? =)
Done, thanks for the contribution! ;)
--
Alex Tarkovsky
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Alex Tarkovsky wrote:
> Brandon S. Allbery KF8NH wrote:
>> I can has English? :)
>
> This comment inspired what could be either the beginning of an
> infectious Haskell recruitment campaign, or just a sign that some of us
> are mad. I present the lambdacats:
&g
Will Thompson wrote:
> http://pics.livejournal.com/resiak/pic/00019kx6/
Bravo. ;)
And here's what happens when you substitute your cat for GHCi:
http://arcanux.org/lambdacats3.html
--
Alex Tarkovsky
___
Haskell-Cafe mailing list
Hask
...and the silliness continues:
http://arcanux.org/lambdacats2.html
--
Alex Tarkovsky
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Brandon S. Allbery KF8NH wrote:
> I can has English? :)
This comment inspired what could be either the beginning of an
infectious Haskell recruitment campaign, or just a sign that some of us
are mad. I present the lambdacats:
http://arcanux.org/lambdacats.html
--
Alex Tarkov
Hallo,
On 10/3/07, Pasqualino 'Titto' Assini <[EMAIL PROTECTED]> wrote:
> Hi Alex,
>
> I hope not to spoil your fun but have you had a look at this:
>
> Write Yourself a Scheme in 48 Hours
> http://halogen.note.amherst.edu/~jdtang/scheme_in_48/tutorial/overv
;)'
return $ SchList $ ls ++ [SchSymbol "..."]
parseList :: Parser SchDatum
parseList = do
ls <- parseLeftList
try (parseThreeDottedList ls) <|> (parseDottedList ls) <|>
(parseProperList ls)
Thanks for the help.
Cheers,
--
-alex
http://www.ventonegro.or
Hallo,
On 10/2/07, Brandon S. Allbery KF8NH <[EMAIL PROTECTED]> wrote:
>
> On Oct 2, 2007, at 9:52 , Alex Queiroz wrote:
>
> > (parseDottedList ls) <|> (parseProperList ls)
> >
> > I've factored out the common left sub-expression in
> > p
the list the parser sees a single dot, it tries to
match it with "...", which fails. Can anybody give advice on how to
rewrite these list parsing functions?
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
cker
who maybe interested in a Haskell job in the North area (Nahariyya).
Alex
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
I'd like to have code not compile if it doesn't pass the tests.
Is there a way to use TH to generate compiler errors if the tests don't
pass?
-Alex-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/m
We've refactored the happs repos and are now going to releasing
components of HAppS as individual useful packages. HAppS-Data is the
first one. Don't pull a tag, pull the most recent stuff in the repos.
---
HAppS-Data v0.9: XML, Name/Value Pairs, HList, deriveAll
* toXml and fromXml transfor
luation. Previous posts on this thread
> give several examples.
>
And his point was completely missed.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
bility will
still not prevent you from doing a (fromJust Nothing), but it still
seems super valuable if you are doing generic haskell type stuff?
Is there a mathematical reason why this wouldn't work?
-Alex-
___
Haskell-Cafe mailing list
H
o get short fast haskell modcount.
-Alex-
---
#!/usr/bin/env python -OO
"""Find prime numbers. See usage() for more information.
Author: JJ Behrens
Date: Sun Dec 30 03:36:58 PST 2001
Copyright: (c) JJ Behrens
Description:
Find prime numbers. See usage() for more information.
Thought perhaps the problem is that modcount is just a slower algorithm.
... nevermind. Thanks.
-Alex-
Alex Jacobson wrote:
The challenge was the implement the modcount algorithm not to calculate
primes per se.
(see e.g. http://jjinux.blogspot.com/2005/11/io-comparison.html).
-Alex
The challenge was the implement the modcount algorithm not to calculate
primes per se.
(see e.g. http://jjinux.blogspot.com/2005/11/io-comparison.html).
-Alex-
Donald Bruce Stewart wrote:
alex:
This implementation of calculating 1 primes (compiled with GHC -O2)
is 25% slower than the
Counts else newCounts) -- add if prime
isPrime = and . map ((/=0).snd)
incrMod2 (p,mc) = let mc' = mc+2 in
if mc'p then (p,1) else (p,0)
Note: It is shorter than the python, but I would have assumed that GHC
could deliver faster as well.
-Alex-
__
Have you looked at the HAppS.DBMS.IxSet? It gives you a type safe way
to query indexed collections.
-Alex-
Isto Aho wrote:
Hi,
I'd like to store small matrices into a db. Number of rows and columns
may vary in a way not
known in advance. One might use a relation (matrixId, col, row,
HTTP functionality from which
to access your replicated state.
-Alex-
Bulat Ziganshin wrote:
Hello Alex,
Wednesday, August 1, 2007, 8:34:23 AM, you wrote:
I am asking because I am trying to make HAppS a reasonable replacement
for all contexts in which you would otherwise use an external
Ok, so for low throughput applications, you actually need a disk
strategy. Got it.
Ok, is there a standard interface to BerkleyDB or some other disk based
store?
-Alex-
Duncan Coutts wrote:
On Wed, 2007-08-01 at 11:31 -0700, Bryan O'Sullivan wrote:
Alex Jacobson wrote:
If you cre
If you create a Data.Map or Data.Set larger than fits in physical
memory, will OS level swapping enable your app to behave reasonably or
will things just die catastrophically as you hit a memory limit?
-Alex-
___
Haskell-Cafe mailing list
Haskell
.
-Alex-
Isto Aho wrote:
Hi,
I was also wandering between these different db-libs and thanks for your
information.
I tried several (HDBC, HSQL, HaskellDB) and made only small trials.
HaskellDB has quite many examples on wiki that gave a quick start to
further trials.
But, I wasn't ab
l Café evolves into a very high level
discussion that may frighten some beginners, as it seems that without
a PhD in programming languages and category theory, the language is
not for you.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe
measure perfection in.
This is so much true. It has the effect of disguising Haskell as
a PhD-only language.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
s not UTF-16?
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
embedded devices).
Wrong. Java and C# are far more popular languages, but C is just
the right tool for the job.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
won't.
So you think we use C because we like it? :-) When this
revolutionary tool of yours arrive that compiles Haskell to PIC
devices, I'm gonna be the first to use it.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailin
ch to more efficient tools will
put the rest out of business (if they really are more efficient).
As I replied to Hugh, the Universe of computers is not restricted
to PCs. We, embedded developers, will be using C for a lot of time
still.
Cheers,
--
-alex
http://www.ven
uite distinct
glyph.) Last time I checked, nobody was keen on using 64 bits per
character...
You must look out more. I use áéíóúç in web pages all the time.
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
on for Haskell is not really C or
C++. C is basically dead;
20 years from now people will still be saying this...
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
large scale web sites implement some form of relational database
sharding which basically means partitioning the database and doing a bit
of graph traversal to decide on the database and then relational within
that database and then merging the results.
-Alex-
Pasqualino 'Titto' As
Titto,
Have you looked at HAppS.DBMS.IxSet? Right now it provides a generic
way to query indexed sets.
If you want to take a shot at making the queries serializable, I don't
think it would be that difficult (but I have not tried so YMMV).
-Alex-
Pasqualino 'Titto' Assini
for the task in hand, Haskell programs only ever use linked lists.
Huh?
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
On 6/18/07, Andrew Coppin <[EMAIL PROTECTED]> wrote:
OTOH... how the heck do you write an operating system in a language that
doesn't even support I/O? :-S
You can start from here: http://programatica.cs.pdx.edu/House/
Cheers,
--
-alex
http://www.ven
have the illusion of decent fonts,
but that's not exactly a productive environment now, is it?
So you'd rather use my image as background instead of compiling
GTK Emacs for you? I've got another idea, why don't you use MS Word?
It can save plain text files.
C
Ok how about this class:
class (Monoid m) => MonoidBreak m where
mbreak::m->m->m
And the condition is
mappend (mbreak y z) y == z
-Alex-
Dan Piponi wrote:
On 6/7/07, Alex Jacobson <[EMAIL PROTECTED]> wrote:
Is there a standard class that looks something like this:
Is there a standard class that looks something like this:
class (Monoid m) => MonoidBreak m where
mbreak::a->m a->(m a,m a)
and it should follow some law like:
m == uncurry mappend $ mbreak x m
-Alex-
___
Haskell-Cafe mailing lis
I suppose a deriveAll command from template haskell would work. Is that
really possible?
-Alex-
Neil Mitchell wrote:
Hi Alex,
The problem with Data.Derive is that I now have a pre-processor cycle as
part of my build process. Automatic and universal Data and Typeable
instance deriving should
lared, but that is a separate issue. My main point is that Data and
Typeable should always be there without extra futzing on the part of the
programmer.
Speaking of which, any thoughts on fixing my SYB code in the other thread?
-Alex-
___
Haskell-Cafe
les but causes the wrong behavior.
Any recommendations on how to fix this?
-Alex-
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
e perfect should not be the enemy of the good.
-Alex-
Simon Peyton-Jones wrote:
| does that help to keep it on the radar?-)
| claus
Indeed! But please modify the wiki. Email has a half life of about 1 day!
S
___
Haskell-Cafe mailing list
Haskell-C
: chunk-encoding means that there is no theoretical limit to how big
an HTTP request or response may be.
-Alex-
Jules Bean wrote:
I've been having something of a discussion on #haskell about this but
I had to go off-line and, in any case, it's a complicated issue, and I
may be able to be
the field?
I'm in a state of disbelief here.
If you want some amusement, just search for "Jon Harrop" in comp.lang.lisp.
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskel
ay not like modality, it's entirely within your rights, but
it is *not* a problem. Fortunately it's still there for the millions
of us who like it.
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://ww
e a better way to define insert that does
not have this problem?
Note: I also tried doing this so that each attribute tried to find a
matching index using fromDynamic, but that gave me an error involving
gmapQ not have an Ord constraint.
-Alex-
.2), so we have provided a readline4
compatiblity RPM for this case.'"
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hallo,
On 4/26/07, Neil Mitchell <[EMAIL PROTECTED]> wrote:
No, but Hugs does with "Here documents".
Unfortunately I'm using GHC but thanks!
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Has
Hallo,
On 4/26/07, Neil Mitchell <[EMAIL PROTECTED]> wrote:
Like the cpp will choke and die :) Multiline string literals were one
of the motivations for cpphs.
Does cpphs allow me to include a whole file into a Haskell source
file, inserting automatically the string gaps?
--
-ale
Hallo,
On 4/12/07, kynn <[EMAIL PROTECTED]> wrote:
Hi. I can't find that post. Could you point it to me please?
It's in here:
http://cgi.cse.unsw.edu.au/~dons/blog/2007/03/10#programmable-semicolons
--
-alex
http://ww
ief to see some code I can relate with. :-)
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
hout much effort?
Are they for working around some problems of HM type systems or do
they give Haskell super-language powers? I guess I could answer these
questions if I understood what FD and GATDs are all about, but I'm not
just there yet.
or the help!
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of the list.
Cheers,
--
-alex
http://www.ventonegro.org/
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
101 - 200 of 242 matches
Mail list logo
