ackage.conf . Is this the
problem and how do I fix it?
Greetings,
Mads Lindstrøm
signature.asc
Description: This is a digitally signed message part
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi
The --user flag did the trick. Thank you very much.
/Mads
Daniel Fischer wrote:
> Am Sonntag 28 Februar 2010 14:41:03 schrieb Mads Lindstrøm:
> > Hi
> >
> > When I do:
> > > cabal list --simple-output | grep -i "HaXml 1.20"
> >
> > I
.
Greetings,
Mads Lindstrøm
signature.asc
Description: This is a digitally signed message part
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
type, which contains both content and
encoding, would be standardizing on some encoding like UTF-8. I realize
that we have the utf8-string package on Hackage, but people (at least
Happstack and Network.HTTP) seem to prefer ByteString. I wonder why.
Greetings,
Mads Lindstrøm
signature.asc
Hi
David Leimbach wrote:
>
>
> On Mon, Mar 22, 2010 at 6:10 AM, Johan Tibell
> wrote:
> On Mon, Mar 22, 2010 at 1:16 PM, Johann Höchtl
> wrote:
> > My question or discussion point: Why not depreciate [Char]
> altogether
> > and favour of lazy Bytestrings
Hi
For some time I have been thinking about an idea, which could limit
Haskell's memory footprint. I don't know if the idea is crazy or clever,
but I would love to hear peoples thoughts about it. The short story is,
I propose that the garbage collector should not just reclaim unused
memory, it sho
Hi
On Fri, 2010-03-26 at 21:24 +, Sebastian Sylvan wrote:
>
>
> On Fri, Mar 26, 2010 at 9:21 PM, Brandon S. Allbery KF8NH
> wrote:
> On Mar 26, 2010, at 16:28 , Mads Lindstrøm wrote:
> For some time I have been thinking about an idea,
>
Hi
On Fri, 2010-03-26 at 21:33 +, Sebastian Sylvan wrote:
>
>
> Reorganizing data on the fly sounds like it may be a pretty sensible
> idea now that cache misses are so bad (in comparison). The fact that
> Haskell data is generally immutable helps too.
> However, I think your scheme sounds
t is, that it is properly true that most COBOL programmers sees
functions as part of the language. But you cannot generalize from COBOL
programmers to programmers in say Java, in this particular case.
>
> I'll stop whining now.
Greetings,
Mads Lindstrøm
[1]
http://en.wikipedia.o
XML documents can get different
results when applied to the same XPath.
Also, is there any way to get 'getXPathTreesWithNsEnv' to recognize
XPath namespace declarations? I am thinking about declarations like:
declare namespace foobar='http://
same XPath again and again. A
stand-alone function to parse an XPass expression, would also make it
easy to create a Template Haskell parse-xpath-function, that gave
compile-time error messages and increased performance for XPath
expression know at compile-time.
Regards,
Mads Lindstrøm
signat
Hi
Don Stewart wrote:
> gue.schmidt:
> > Hi all,
> >
> > I've never found an easy way to deal with ByteStrings.
> >
> > I'm using the RSA library and it en- and decodes
> > Data.ByteString.Lazy.ByteString.
> >
> > I initially start with Strings, ie. [Char], but there is no function to
> > conv
Hi Uwe
> This is a right point. Here the current XPath calling interface is too simple.
> A separation into XPath parsing and evaluation would be more flexible.
> The parsing (and error handling of XPath syntax errors) could be done once.
> I will extend the interface to support this.
That would
Hi Uwe
I read your reply multiple times, but I am still confused. I think
either I misunderstand you or I did not explain myself properly in the
first mail.
> Hi Mads,
>
> > In HXT, namespace prefixes bound by an XML document are valid in the
> > context of an XPath. How do avoid that?
> >
> >
Hi
Replying to myself:
> I think another example will clarify my point. The code:
>
> simpleXmlOne, simpleXmlTwo :: String
> simpleXmlOne = "http://foo.org\"/>"
> simpleXmlTwo = "http://foo.org\"/>"
>
> nsEnv :: [(String, String)]
> nsEnv = [ ("notFoo", "http://notfoo.org";) ]
>
> evalXPa
Hi Uwe
> Hi Mads,
>
> > Replying to myself:
> >
> > > I think another example will clarify my point. The code:
> > >
> > > simpleXmlOne, simpleXmlTwo :: String
> > > simpleXmlOne = "http://foo.org\"/>"
> > > simpleXmlTwo = "http://foo.org\"/>"
> > >
> > > nsEnv :: [(String, String)]
> > > nsEn
Hi
On Sat, 2010-04-24 at 19:25 +1000, Ivan Lazar Miljenovic wrote:
> Roman Leshchinskiy writes:
> > John Goerzen gave one in the very first post of this thread: the fix
> > to old-locale which didn't change any types but apparently changed the
> > behaviour of a function quite drastically. Anothe
Hi
On Sat, 2010-04-24 at 19:47 +1000, Ivan Lazar Miljenovic wrote:
> Mads Lindstrøm writes:
> > You could automatically generate QuickCheck tests for many pure
> > functions. It will not catch every API change, but it would catch some.
> > It would have caught the API chang
Hi
I have tried haskell.org, Google and Hoolge, but I cannot find any
function to give me the available and/or used memory of a Haskell
program. Is it just not there? Or am I missing it somehow?
/Mads
___
Haskell-Cafe mailing list
Haskell-Cafe@haskel
ated
> to measure allocations in calls like GHCi does.
>
> On Tue, Apr 27, 2010 at 12:01 PM, Mads Lindstrøm
> wrote:
> Hi
>
> I have tried haskell.org, Google and Hoolge, but I cannot find
> any
> function to give me the availa
Hi
I do not have an example for you, but I do have some text conversion
functions you may find useful. I have attached the text conversion
functions in a file.
/Mads
On Mon, 2010-04-26 at 09:46 +, Johannes Waldmann wrote:
> Hi - I'm looking for an example/demo happstack server
> that handle
Hi
On Tue, 2010-04-27 at 14:55 -0700, Don Stewart wrote:
> We could bind to Rts.c in the GHC runtime, and get all the stats
> programmatically that you can get with +RTS -s
That would be nice.
/Mads
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.
Hi
From
http://haskell.org/ghc/docs/6.12.1/html/libraries/base-4.2.0.0/Control-Exception.html#3
"... The difference between using try and catch for recovery is that in
catch the handler is inside an implicit block (see "Asynchronous
Exceptions") which is important when catching asynchronous
excep
Hi
Pressing documentation-link here http://happstack.com/index.html I still
get the 0.4.1 version.
But impressive set of new features.
/Mads
On Mon, 2010-05-03 at 12:57 -0500, Jeremy Shaw wrote:
> (Note: Reply-to is set to haskell-cafe@haskell.org)
>
>
> Hello,
>
>
> I am very pleased to an
iling list. What is meant by "proper
authority"? Can I just try to create one and see if I am successful? Or
must I request someone to do it?
Regards,
Mads Lindstrøm
signature.asc
Description: This is a digitally signed message part
___
Haske
lement different type classes. We could have type classes like
MouseEvents, KeyboardEvents, Activated, ...
/Mads Lindstrøm
signature.asc
Description: This is a digitally signed message part
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://w
lly, there is no Haddock documentation in uu-parselib.
The lack of entry-level documentation and few predefined parsing
combinators in uu-parselib do make for a steep learning curve.
Kind regards,
Mads Lindstrøm
[1]
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/uu-parsinglib
[2
lmYear <- getLine
> main filmsInGivenYear [Year [Film]]
> else if x == 5
> then do putStr "Enter the fan name: "
> fanName <- getLine
> main givenUser [fanName [Film]]
>
Hi
Has anybody implemented an Emacs mode for the Utrecht Attribute Grammar
System (UUAG), and is willing to share it ?
Greetings,
Mads Lindstrøm
signature.asc
Description: This is a digitally signed message part
___
Haskell-Cafe mailing list
xplicitly join
on foreign keys.".
Actually SQL has natural joins, where you can do without explicit join
conditions. Unfortunately, natural joins seems like they were explicitly
designed to create trouble. It would be nice if "they" fixed SQL to
consider relationships.
Greetings
You don't have to care about ids. you just assign a new value and
> tell
> the engine that it should commit.
> So again less chances to get something wrong.
>
Could you not do in SQL:
UPDATE pupils SET age = 14 WHERE age = 13
That is, without using ids.
Greetings,
Mads Li
Hi Marc Weber
> Hi Mads!
>
> On Tue, Jun 30, 2009 at 11:49:40PM +0200, Mads Lindstrøm wrote:
> > Hi Marc Weber
> >
> > > Another example: Updating the age of a pupil:
> > >
> > > row = SELECT * FROM pupils where age = 13;
> > >
Hi Petr,
Maybe this will give inspiration
http://en.wikipedia.org/wiki/Selection_algorithm
It seems to me, that you just need a selection algorithm which works in
O(n * k) time for k arbitrary elements. If you combine O(n*k) selection
algorithm with any O(n * lg n) sort, you furfil your time cons
rred to the length of the package excluding the header.
So I am right to see this as a bug in network-data ?
Regards,
Mads Lindstrøm
[1] http://hackage.haskell.org/package/network-data
[2]
http://hackage.haskell.org/packages/archive/network-data/0.0.2/doc/html/src/Data-IP.html
ut you also have a
learning by doing approach, which I personally find very productive.
And do not give up yet. Haskell has a lot to offer and I think it is
well worth the steep learning curve.
Cheers,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the number of
SYB3's floating around.
Greetings,
Mads Lindstrøm
> Haskellians,
>
> Does anyone know the status of SYB3 codebase? It appears that FreshLib
> critically depends on it, but the code downloadable from
> http://homepages.cwi.nl/~ralf/syb3/code.html dies in make
their version.
Greetings,
Mads Lindstrøm
P.s. if you decide using the Shelarcy patch then apply it with:
> patch -u -dSYB3 Haskellians,
>
> Does anyone know the status of SYB3 codebase? It appears that FreshLib
> critically depends on it, but the code downloadable from
> http:/
er words, we
just need to read the "logged" values when the transformation has
occurred, not while it is occurring.
Greetings,
Mads Lindstrøm
> You store the transformation sequence in the state while processing
> the tree, then you simply retrieve the state and print it out.
>
Hi Ian
Ian Lynagh:
> On Fri, Oct 19, 2007 at 07:59:37PM +0200, Mads Lindstrøm wrote:
> >
> > http://hackage.haskell.org/cgi-bin/hackage-scripts/package/syb-with-class-0.3
> > (hereafter know as HappS-SYB3). HappS-SYB3 is based on the SYB3 code
> > you mention, but the
7;s
> probably the one to look at first.
>
It occurred to me that the voting could be implicit. That is, if 10
libraries/programs use library X, then library X gets 10 votes. Kind of
like Google PageRank for libraries.
Greetings,
Mads Lindstrøm
___
ething wrong when searching haskell.org?
Properly not. I think the problem is that haskell.org do not index
words, that have length <= 3. MediaWiki (which I think haskell.org uses)
do not by default index short words (length <= 3 or length <= 4 - can't
remember which).
If you search for yhc y
Hi,
Andrew Coppin wrote:
> Galchin Vasili wrote:
> > Hello,
> >
> > https://buildsecurityin.us-cert.gov/daisy/bsi/articles/knowledge/coding/295.html
> >
> > I stumbled across this page. It seems that Haskell and other strongly
> > typed functional languages like Ml/OCaml will fare much, much
nt do not know when the server is
finished sending data, the client will wait forever.
Greetings,
Mads Lindstrøm
>
> The server looks like this:
>
> interactTCP :: Int -> (String -> IO String) -> IO ()
> interactTCP port f = withSocketsDo $ do
> servS
llwiki.
Not MediaWiki, but the underlying database. If HaskellWiki uses MySql
ft_min_word_len needs to be set to something smaller than four. See
http://dev.mysql.com/doc/refman/5.0/en/fulltext-fine-tuning.html . After
doing this the indexes needs to be rebuild.
Greetings,
Mads Lindstrøm
>
Hi Alan
I can help but feeling curious. Did some of the answers actually help
you? Are you still as doubtful about Haskell as when you wrote your
email?
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http
Hi David
On Mon, 2010-09-06 at 13:50 -0700, David Anderson wrote:
>
>
> - Simple timing attacks: If code path A takes longer than code path B
> to execute, an attacker can use that information to reverse engineer
> the outcome of branching tests, and from there possibly recover secret
> key ma
buffers.
Hope somebody can help,
Mads Lindstrøm
[1] http://hackage.haskell.org/package/protocol-buffers
[2] http://code.google.com/p/protobuf/
[3] Delimited messages is a protocol buffers technique, where one writes
the size of the message before the actual message:
http://code.google.com/apis
roto file, to
implement this feature.
What do people think of these ideas?
Regards,
Mads Lindstrøm
[1] http://code.google.com/apis/protocolbuffers/docs/proto.html#options
[2] http://hackage.haskell.org/package/protocol-buffers
[3]
http://code.google.com/apis/protocolbuffers/docs/techniques.h
e it is a HDBC and not a ODBC-library problem? It seems that
you use unixODBC and can then try the command:
isql test
which will connect though unixODBC without involving HDBC. If you still
have the same problems, then it must be unrelated to HDBC.
>
> 2. when using UID=chylli, why the use
about what a good paper looks
like. I would especially like comments about the overall quality of
the paper, can it be called scientific and comments about anything I
could do to improve the paper. And remember, if commenting, honest is
better than polite.
Greetings,
Mads Lindstrøm
[1]
Andrew Coppin wrote:
> Idiomatic Haskell seems to consist *only* of single-letter variable
> names. When did you last see a pattern like (customer:customers)? No,
> it'd be (c:cs), which isn't very self-documenting. Ditto for type
> variables by the way. (Map k v, anyone?) It also seems to be H
wlicen.htm :
"The wxWindows Licence is essentially the L-GPL (Library General Public
Licence), with an exception stating that derived works in binary form
may be distributed on the user's own terms. This is a solution that
satisfies those who wish to produce GPL'ed software using w
Hi,
Galchin, Vasili wrote:
> Hi Duncan,
>
> I was under the impression that HDBC doesn't support myqsl??
You can connect HDBC to MySQL using the HDBC-ODBC backend, see
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/HDBC-odbc.
Greetings,
Mads Lindstrøm
>
ell database libraries are
implemented, but at least some of them use unsafe foreign calls. So
which database library is you using?
>
> What can I do?
If the problem has to do with unsafe foreign calls, then you can
implement the database calls in a separate process. Not t
necessary to use the -threaded
option when linking your program, and to make sure the foreign import is
not marked unsafe."
/Mads
>
> On Sun, Dec 21, 2008 at 11:16 PM, Mads Lindstrøm
> wrote:
> Hi Günter
>
> Günther Schmidt wrote:
>
Hi Günther,
> Hi Mads,
>
> I'm using HDBC with sqlite3
Looking at
http://software.complete.org/software/repositories/entry/hdbc-sqlite3/Database/HDBC/Sqlite3/Connection.hs
and
http://software.complete.org/software/repositories/entry/hdbc-sqlite3/Database/HDBC/Sqlite3/Statement.hsc
you can see
do not feel all that novel. Somebody has
properly thought about it before, but gave it a different name. If
anybody has links to some papers it would be much appreciated. If
anybody has some thoughts of the desirability of value class it would
also be much appreciated.
/Mads Lindstrøm
signature
returnA -< Widget cls cs
But it do not work as intended. In stead I get the following output:
[Widget {cls = "ex1", children = []},Widget {cls = "ex1", children =
[]},Widget {cls = "ex1", children = []},Widget {cls = "ex1", children =
[]},Widget {cls = &
ad :: r a -> m a
> write :: r a -> a -> m ()
I do not think you can call it standard, but TypeCompose
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/TypeCompose-0.5 do
implement Data.RefMonad, which does what you are describing.
Greetings,
Mads Lindstrøm
>
> Wh
?
>
> Marc Weber
Another question is why do you want to we replace RDBMS-es?
Greetings,
Mads Lindstrøm
>
> One solution I came up within minutes :) I love haskell. You write it
> down fix error and it works :)
> Would you prefer another way to solve this?
>
> --pa
may only need to prepare the execution plan once. PostgreSQL
seems to supports preparing both parse result and the prepare-plan result (see
http://www.postgresql.org/docs/8.1/interactive/sql-prepare.html ).
/Mads Lindstrøm
> b) Type safety. HaskellDB is nice.. But it's limiting becaus
) list. Due to step two we
can make the returned values type-safe.
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
ase have identical metadata at
run and compile -time. Either using the same database or a copy. Though
one should note that HaskellDB has the same disadvantage. Actually it do
not seem much of a disadvantage it all, as most code accessing SQL
databas
Hi Wouter
Wouter Swierstra wrote:
> Here's a concrete example. Suppose you have a query q that, when
> performed, will return a table storing integers. I can see how you can
> ask the SQL server for the type of the query, parse the response, and
> compute the Haskell type "[Int]". I'm not su
I should mention a couple of drawbacks with the TH-based
approach. While SQL got static typing, it is not really as powerful as
it could be. For example if you do "select sum(...) from ..." the type
system will tell you that a set of values are returned. In reality this
set w
as
soon I have packaged up and wrote a little tutorial about my other
project (SybWidget). I already started that about three weeks ago, so it
should be finished soon.
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@ha
an.org/News/weekly/2008/08/ . But with a project like
Debian that releases when ready, not on a deadline, you never quite know
when the next release will be there.
>
> -k
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
Have you considered using LyX ( http://www.lyx.org/Home ) in stead of
TexMacs?
I have never tried TexMacs, but newer versions of LyX do seem to have a
more modern interface than TexMacs. I do not know have easy LyX is to
modify to your needs though.
Greetings
Mads Lindstrøm
Massimiliano
aries are
loaded in? If so, do anybody know how to specify the load order?
Can anybody help med with a good approach for debugging this error?
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi all,
Is it possible to ask the GHC garbage collector to run ? Something like
a collectAllGarbage :: IO() call.
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
fix: add a type signature that fixes these type variable(s)
I am compiling with:
> runhaskell Setup.hs build
I run Debian Linux with GHC 6.10.1.
Anybody has a solution for my problem?
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskel
type variable(s)
>
>
> I am compiling with:
>
> > runhaskell Setup.hs build
>
> I run Debian Linux with GHC 6.10.1.
>
> Anybody has a solution for my problem?
>
>
> Greetings,
>
> Mads Lindstrøm
/Mads
___
Hi Maurício
Great idea. I would love a toy one with a Lambda logo.
I found one on Amazon
http://www.amazon.com/Plush-Sloth-Bear-Cuddlekin-12/dp/B000FBLP76 , but
without the logo.
But we would of cause need one with Haskell logo printed upon it. I
could not find a place with user-definable texti
Hi Haskelleers
Has anybody written a SQL parser in Haskell (and is willing to share the
code) ?
Greetings,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
he server outputs:
> Hello world
as expected. Thus I think the certificates are fine, and the Java client
is fine. But what am I doing wrong in the Haskell server?
I have attached JavaServer.java.
Regards,
Mads Lindstrøm
import javax.net.*;
import java.net.*;
import javax.net.ssl.*;
impor
Hi again,
I found a simpler way to test the server connection, but it is still not
working. Namely,
> penssl s_client -connect 192.168.1.6:8000
> CONNECTED(0003)
> 18683:error:140790E5:SSL routines:SSL23_WRITE:ssl handshake >
> failure:s23_lib.c:188:
Regards,
Mads Li
Hi Vincent,
On Mon, 2010-12-13 at 08:51 +, Vincent Hanquez wrote:
> that doesn't buy much since nobody should connect to a pure SSLv2 server.
>
> For the openssl cmdline, you can add a simple -ssl3 flag or -tls1 flag to
> start
> negociating at the right version straight away.
Yes, that wor
e SSL3 from Java.
/Mads
On Mon, 2010-12-13 at 08:51 +, Vincent Hanquez wrote:
> On Sun, Dec 12, 2010 at 08:13:59PM +0100, Mads Lindstrøm wrote:
> > Hi Haskellers,
> >
> >
> > I am trying to connect a Java client to a Haskell server using the
> > Haskell t
ore as
suggestions for a better interface.
Regards,
Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
take the resultant Handle, call forkIO
> with the TLS actions and the resultant handle. Go back to 1.
>
> So even though the TLS code blocks on the handle, that's in a
> different thread from the code which is waiting on the socket to
> accept additional connections.
>
> Take c
Hi Antoine
> On Thu, Dec 16, 2010 at 2:38 PM, Mads Lindstrøm
> Maybe a better interface would be along the lines of:
>
> -- | Do not use the handle when you are done!
> openTLSConnection: Handle -> { information? Maybe not needed} -> IO
> TLSConnection
>
> And th
Hi Michael
The type of lst is "IO [Int]" and therefore "fmap (+1)" applies (+1) to
the hole lists of integers, and not to each member of the list. That is:
fmap (+1) lst <=>
fmap (+1) (return [1,2,3,4,5]) <=>
return ([1,2,3,4,5] + 1)
and you cannot say [1,2,3,4,5] + 1.
Does that make sense?
do know about it in with respect to
existentially quantified types), but with no luck. So, if anybody has
some good pointers, please let med know about it.
/Mads Lindstrøm
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi John Goerzen
> On 2005-06-27, Mads Lindstrøm <[EMAIL PROTECTED]> wrote:
> > Hi John
> >
> >> test :: forall a. (Num a) => a
> >> test = 2 * 5 + 3
>
> [ snip ]
>
> > I had newer seen anybody use "forall a." in function signatu
84 matches
Mail list logo