Hello Anton,
thanks for your enlightening piece of code. foldD does exactly what I was
hoping for.
Now it becomes very obvious to me that the positions of the forall's in the
Digit definition are crucial.
Thanks a lot to Alfonso, Luke and Ryan as well. Haskell Cafe is a really
good place to
Hi, I'm back. I have some troubles understanding your code:
Chaddaï Fouché-2 wrote:
findAllAns 0 0 = [[]]
findAllAns 0 s = []
findAllAns n s = [ x:xs | x - [0..s], xs - findAllAns (n - 1) (s - x) ]
Let's try a test case (CMIIW) for findAllAns 2 1:
findAllAns 2 1 = [ 0:(findAllAns 1 1) ]
$ ll $ORACLE_HOME/lib
...
I assume that libociei.so is the library I need.
Actually it's libclntsh.so. You need to change the oracle section in
Takusen.cabal to this:
hand-slaps-forehead/
Another difference between Windows and Linux Oracle installations is
that the client libs are in
Hi,
After reading the latest article on the Haskell Hacking blog (Daily Haskell:
Download and analyse logs, then generate
sparklineshttp://cgi.cse.unsw.edu.au/%7Edons/blog/2008/06/24#daily-haskell-one)
I wanted to install cabal-install to check it out. Soon I found out that it
has a dependency
On Tue, 24 Jun 2008, Alistair Bayley wrote:
2008/6/24 Henning Thielemann [EMAIL PROTECTED]:
When you run configure, you should get output that says:
Using Oracle: path
What is path?
I don't get these questions.
Sorry. I was really asking (not very clearly): what is the output from
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of
Henning Thielemann
I don't get an error. sqlplus is in $ORACLE_HOME/bin, but the
RPM package
also sets a link from /usr/bin/sqlplus to $ORACLE_HOME/bin,
thus 'sqlplus'
is in the $PATH also without $ORACLE_HOME. (But
On Wed, 2008-06-25 at 10:15 +0200, Sasko Mateski wrote:
I wanted to install cabal-install to check it out. Soon I found out
that it has a dependency on Cabal (=1.41.5), so next thing to do
was getting and installing Cabal-1.4.0.1 (since the version coming
with ghc-6.8.3 is 1.2.4.0). But
2008/6/25 leledumbo [EMAIL PROTECTED]:
Hi, I'm back. I have some troubles understanding your code:
( 1:1:? is never reached. )
Why would 1:1 be reached when we search for lists with a sum of 1 ??
Your derivation is incorrect, when you're reading a list comprehension
you
I'll have to change the way that Setup.hs tries to find $ORACLE_HOME.
Using getEnv would be a much better idea. I don't recall why I didn't
use it before; perhaps it's not always set on Windows installations.
Try this version of configOracle in Setup.hs:
configOracle verbose buildtools = do
Henning Thielemann wrote:
On Tue, 24 Jun 2008, Alistair Bayley wrote:
2008/6/24 Henning Thielemann [EMAIL PROTECTED]:
(Btw. Takusen should be split into
several packages for all database backends because Cabal flags must not
influence the package interface.)
I don't understand this (cabal
On Wed, 25 Jun 2008, John Goerzen wrote:
I haven't read this entire thread, but I might also just interject here
that HDBC supports ODBC (on Windows, and on Linux/Posix platforms via
unixODBC, iODBC, or similar), which may be another avenue for you to
try. I'm sure there are ODBC Oracle
ICFP 2008 poster session
September 21, 2008
Call for presentation proposals
ICFP 2008 will feature a poster session for researchers and
practitioners, including students. The session will provide friendly
feedback for work that is in gestation or ongoing, as well as
opportunities to meet each
I have a foggy memory that early ML had only binary pairing, nesting for
n-tuples. Can anyone confirm this memory. If so, does anyone remember the
rationale for going to n-tuples? Performance, perhaps?
Similarly, did the Haskell designers consider pairs as an alternative to
n-ary tuples?
The
Hello,
I'm trying to learn how to use HaXml, but I'm having trouble getting off
the ground. I can see from the documentation how to process XML using
the combinators and processXmlWith, but processXmlWith seems to hide
the actual process of reading and parsing the XML. Suppose that
processXmlWith
Conal Elliott wrote:
I have a foggy memory that early ML had only binary pairing, nesting for
n-tuples. Can anyone confirm this memory. If so, does anyone remember
the rationale for going to n-tuples? Performance, perhaps?
In Isabelle HOL * is a right-associative (pair) type constructor.
2008/6/25 Conal Elliott [EMAIL PROTECTED]:
I have a foggy memory that early ML had only binary pairing, nesting for
n-tuples. Can anyone confirm this memory. If so, does anyone remember the
rationale for going to n-tuples? Performance, perhaps?
Similarly, did the Haskell designers consider
On Tue, 2008-06-24 at 14:08 -0700, Don Stewart wrote:
Just a quick question, did you try using the pandoc markdown parser?
http://hackage.haskell.org/packages/archive/pandoc/0.46/doc/html/Text-Pandoc-Readers-Markdown.html
It'd be useful to know if that was enough for printing and
nielsadb:
On Tue, 2008-06-24 at 14:08 -0700, Don Stewart wrote:
Just a quick question, did you try using the pandoc markdown parser?
http://hackage.haskell.org/packages/archive/pandoc/0.46/doc/html/Text-Pandoc-Readers-Markdown.html
It'd be useful to know if that was enough
On Wed, 2008-06-25 at 16:50 +0200, Conal Elliott wrote:
I have a foggy memory that early ML had only binary pairing, nesting
for n-tuples. Can anyone confirm this memory. If so, does anyone
remember the rationale for going to n-tuples? Performance, perhaps?
What is the difference between a
Henning Thielemann wrote:
On Wed, 25 Jun 2008, John Goerzen wrote:
I haven't read this entire thread, but I might also just interject here
that HDBC supports ODBC (on Windows, and on Linux/Posix platforms via
unixODBC, iODBC, or similar), which may be another avenue for you to
try. I'm
On Wed, 2008-06-25 at 10:46 -0700, Don Stewart wrote:
One of the reasons I started worked on a MediaWikiParser was because I
wanted to use the Haskell language and some of its tools rather than just
read about them. I'm not really interested in making a clone of something
that already
On Wed, 2008-06-25 at 20:17 +0200, Niels Aan de Brugh wrote:
By the way, does anyone know the answer to my original question?
Especially the first one (Alex' AlexPosn vs. Parsec's SourcePos) is
worrying me somewhat.
To answer my own question: as it turns out I was using an old version of
This post borders on being off-topic, but it seems like people on this
list would be interested.
First, some of you know that I had the distinct privilege of flying
out to Microsoft this week to interview for a Software Development
Engineer position on their Live Search team. So I want to first
On Wed, Jun 25, 2008 at 02:24:57PM -0400, Brent Yorgey wrote:
On Wed, Jun 25, 2008 at 07:50:08PM +0200, Niels Aan de Brugh wrote:
On Wed, 2008-06-25 at 16:50 +0200, Conal Elliott wrote:
I have a foggy memory that early ML had only binary pairing, nesting
for n-tuples. Can anyone confirm
On Wed, 25 Jun 2008, Andrew Wagner wrote:
The recruiter even said something along the lines of anyone who knows
haskell is certainly worth our time to talk to. Moral of the story:
Haskell rocks, and even Microsoft knows it!
Interesting. That is they are aware what they support in Cambridge
I would guess that there are a lot of things their research department
does that doesn't get used or thought about on a daily basis by the
implementation teams. Either way, the sarcasm is not necessary.
On Wed, Jun 25, 2008 at 4:49 PM, Henning Thielemann
[EMAIL PROTECTED] wrote:
On Wed, 25 Jun
---
Haskell Weekly News
http://sequence.complete.org/hwn/20080625
Issue 74 - June 25, 2008
---
Welcome to issue 74 of HWN, a newsletter covering
On 2008 Jun 25, at 16:49, Henning Thielemann wrote:
On Wed, 25 Jun 2008, Andrew Wagner wrote:
The recruiter even said something along the lines of anyone who
knows haskell is certainly worth our time to talk to. Moral of the
story: Haskell rocks, and even Microsoft knows it!
Yes, early ML had nested pairs. We introduced n-tuples in Lazy ML
because in a lazy language n-tuples are not isomorphic to nested pairs
(whereas they are in a strict language). So n-tuples are nasty
because they are not inductive, but they are in many ways much more
reasonable than lazy nested
On 26 Jun 2008, at 8:14 am, Andrew Wagner wrote:
6.) You have a [(WeatherStationId, Latitude, Longitude)]. Similar to
#3, write a function which will, off-line, turn this into a data
structure from which you can easily determine the nearest Weather
Station, given an arbitrary Latitude and
30 matches
Mail list logo
