On 30.04.2011 5:06, Rogan Creswick wrote:
On Fri, Apr 29, 2011 at 3:05 PM, Daniil Elovkov
daniil.elov...@gmail.com wrote:
Hello list
I have an idea on versioning of Haskell packages and a small question about
release model of Haskell Platform. Since the latter is shorter let's start
common, then this could simplify building
packages/programs and maintaining installed packages.
What do you think?
--
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
the topic of gluing code.
Because as for gluing code, type signature for io writing d - IO () is
perfectly sufficient.
--
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Jason Dagit wrote:
On Mon, Apr 19, 2010 at 3:01 AM, Daniil Elovkov
daniil.elov...@googlemail.com mailto:daniil.elov...@googlemail.com
wrote:
Hello haskellers!
I'm trying to process an xml file with as little footprint as
possible. SAX is alright for my case, and I think that's
rest i
f [] i = i
Thanks for you thoughts!
--
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
seem to have the older 1.7 version.
Can somebody point me to the repository? Is there any chance that
hsql-oracle compiles with new hsql?
Thanks
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman
Hello Thiago, John.
I've taken the Oracle HDBC driver at
http://thiagoarrais.com/repos/hdbc-oracle
modified it just a little to suite 6.10.4 and briefly looked if it works.
It does, that's cool! Thanks Thiago!
A question follows, maybe it's worth to mention it at the HDBC page
and/or put it
Ryan Ingram wrote:
On Tue, Sep 8, 2009 at 12:44 PM, Daniil
Elovkovdaniil.elov...@googlemail.com wrote:
Existential is a perfect word, because it really is
data S = exists a. Show a = S [a].
If you were going to make exists a keyword, I think you would write
it like this:
data S = ConsS
it, I just tried to word it :)
--
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
on command line it strictly searches for dll and complains if
it's not found. Adding lib exlpicitly on the cmd line doesn't seem to
have any effect.
Thanks
2008/12/24 Daniil Elovkov daniil.elov...@googlemail.com:
Hello
How is decided whether the name of imported function gets the ending
Thiago Arrais wrote:
Are there Oracle bindings for HDBC anywhere? The HDBC project page talks about
Oracle backends but there isn't an Oracle-specific driver listed (I assume one
can reach an Oracle backend through the ODBC interface?).
Yes, I was a bit confused by that, as well.
I started
fero wrote:
And what if writing new application? Has anybody experience with enterprise
application in functional language? Is it really clearer? I can see a
advantage in using Scala but it doesn't have some features from Haskell or
CAL or requires more code to write. Or better has anybody
Henning Thielemann wrote:
On Sat, 21 Jun 2008, Lanny Ripple wrote:
I had luck with this the other day using Database.HDBC.ODBC. For
Ubuntu's Hardy I found that Oracle's 10.2.0.3 worked best.
(10.2.0.4 and 11 seemed to have problems for me at least.)
Hello
Evan Laforge wrote:
I have two related questions:
#1
I'm getting some annoying type errors that I don't fully understand,
and wind up having to do a workaround that I don't totally like.
Here's a simplified version of my situation:
data Ambi m = Ambi {
ambi_monad :: m Int
,
Hello
You may find this paper useful
http://research.microsoft.com/~simonpj/Papers/spineless-tagless-gmachine.ps.gz
It should give you the general feeling of how things are actually executed.
It's quite old, some things in GHC have changed, but the overall scheme,
I believe, is the same. The
Felipe Lessa wrote:
On Thu, May 1, 2008 at 9:44 AM, Felipe Lessa [EMAIL PROTECTED] wrote:
On Thu, May 1, 2008 at 9:32 AM, Edsko de Vries [EMAIL PROTECTED] wrote:
So then the question becomes: what *is* the best way to write this function?
I guess it would be simpler to have the counter on
Brent Yorgey wrote:
On Mon, Apr 28, 2008 at 6:09 PM, Daniil Elovkov
[EMAIL PROTECTED] mailto:[EMAIL PROTECTED]
wrote:
Hello
Somewhat on the topic of optimistic evaluation, I've just thought of
another way to evaluate thunks.
When the program is about to block on some IO
*An:* Daniil Elovkov
*Cc:* haskell-cafe@haskell.org
*Betreff:* Re: [Haskell-cafe] Something like optimistic evaluation
On Mon, Apr 28, 2008 at 6:09 PM, Daniil Elovkov
[EMAIL PROTECTED]
mailto:[EMAIL PROTECTED] wrote:
Hello
Somewhat on the topic of optimistic
Hello
Somewhat on the topic of optimistic evaluation, I've just thought of
another way to evaluate thunks.
When the program is about to block on some IO, what if we start a thread
to evaluate (any) unevaluated thunks. We'll have additional system
thread, but the blocked one will not
Simeon Mattes wrote:
I have found that ghc has adopted the existential data constructors. Because it
was first time I have heard this term I have found some articles about it. The
less complex for me was the following explanation
data Worker x y = Worker {buffer :: b, input :: x, output :: y}
Hello
I remember there was a problem with haskell wiki pages not being indexed
and searched.
Now it seems to work perfectly. Actually typing 'monomorphism
restriction' in google I see the appropriate wiki page as the first result.
I must have missed the moment when it was fixed. Just
Richard Kelsall wrote:
Daniil Elovkov wrote:
Hello
I remember there was a problem with haskell wiki pages not being
indexed and searched.
Now it seems to work perfectly. Actually typing 'monomorphism
restriction' in google I see the appropriate wiki page as the first
result.
I must have
It's great to see that Haskell and FP gains more and more visibility.
One very little comment, continuing on the topic of mathematical schools
and traditions:
Shönfinkel was not a German mathematician, but a Soviet one (he was
Jewish, of course).
Taking into account the fact that he already
Hello folks.
I don't understand whether hdbc has a specific Oracle backend or not
(not via odbc). It is listed in the description of hdbc, but not really
found elsewhere, it seems.
I'd like to have a non-odbc support because it is very desirable to have
it working on Solaris, and I'm not
Hello Ian
2007/11/10, Ian Lynagh [EMAIL PROTECTED]:
Hi Daniil,
On Sun, Nov 04, 2007 at 03:49:54PM +0300, Daniil Elovkov wrote:
A quick look at the 6.8.1 user's guide reveals some broken links:
1)
Obtaining code coverage, pointing to
http://haskell.org/ghc/docs/6.8.1/html
being broken.
Thank you
--
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
shouldn't happen
go (l:ls) (x:xs) = go ls xs
--
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
to me. But having one library
instead of 2 distinct ones is appealing. And avoiding depending on a
separate unixODBC is also good.
2007/7/12, Bryan O'Sullivan [EMAIL PROTECTED]:
Daniil Elovkov wrote:
Yes, thanks. But the emphasis was on Solaris. I don't quite understand
what is the common way
Hello fokls
Would you please tell me, what would be my choice if I wanted to
interact with MySql and Oracle from a Haskell program on Solaris?
Thank you
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
2007/7/11, Bryan O'Sullivan [EMAIL PROTECTED]:
Daniil Elovkov wrote:
Would you please tell me, what would be my choice if I wanted to
interact with MySql and Oracle from a Haskell program on Solaris?
http://www.haskell.org/haskellwiki/Applications_and_libraries/Database_interfaces
If you
2007/7/10, Andrew Coppin [EMAIL PROTECTED]:
I stand in awe of people who actually understand what universal and
existential actually mean... To me, these are just very big words that
sound impressive.
The following is only my own understanding, please correct me if it's
totally wrong!
(and
Hello
In the archives of haskell-cafe I found a mention of constraints on
datatypes as a mis-feature of Haskell. In particular, that they're not
propagated well. Can someone elaborate on that?
Also, are they still considered a mis-feature with the emergence of GADTs ?
If I have
data GADT a
2007/7/1, Andrew Coppin [EMAIL PROTECTED]:
I'm going to have to take some time to bend my mind around that one too...
(Does anybody else on this list frequently get the feeling their IQ is
just too low for Haskell??)
I do. Sometimes when I find myself doing some type hackery.
And that's a
Hello Titto
2007/6/28, Pasqualino 'Titto' Assini [EMAIL PROTECTED]:
Hi Daniil,
I had a look at the paper and associated code that Oleg refers to there is no
special parsing taking place:
From Vector/read-examples.hs:
v3 = do
let m1 = $(dAM [[1,2],[3,4]])
s - readFile
Hello Oleg
2007/6/28, [EMAIL PROTECTED] [EMAIL PROTECTED]:
Daniil Elovkov wrote:
The fact that structure is mixed with properties seems to put some
limits on both doability and, even more, practilaty of encoding
complex properties.
That's why phantom types, attached via a newtype wrapper
2007/6/28, Pasqualino 'Titto' Assini [EMAIL PROTECTED]:
On Wednesday 27 June 2007 23:28:44 [EMAIL PROTECTED] wrote:
In his system, the type of the matrix includes includes the matrix
size and dimensions, so invalid operations like improper matrix
multiplication can be rejected statically. And
OnlyRoot ioOperation
flag someComplexFlag anotherOperation
Daniil Elovkov
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi Conal
2007/6/24, Conal Elliott [EMAIL PROTECTED]:
By embedded DSL, we usually mean identifying meta-language (Haskell)
expressions with object language (DSL) expressions, rather than having an
Exp data type. Then you just use meta-language variables as
object-language variables. The new
PROTECTED] [EMAIL PROTECTED]:
Daniil Elovkov wrote:
I've recently asked some questions here about some little type hackery
implementing an embedded dsl. But now I wonder if it's worth the
effort at all...
Yes it is. Typed embedded DSL are quite useful and widely used. For
example, Lava (high-level
Hello folks
I've recently asked some questions here about some little type hackery
implementing an embedded dsl. But now I wonder if it's worth the
effort at all...
The thing is enforcing static constraints turns out to be quite time
consuming, even for 'reasonble' things. The dsl I'm writing
Hi again
So, I keep trying to implement the dsl, I mentioned yesterday. I ran
into a problem which can be illustrated by the following small
example.
class Cl s1 a1 s2 a2 where
clF :: a1 - a2
clF doesn't mention s1 and s2, they're used only to restrict types below
data T s a where
C
Hello folks
Haskell is considered good for embedded DSLs. I'm trying to implement
some simple EDSL in a typeful manner and having a problem with looking
up variable values.
I've got an Expression GADT, which admits variables. The problem is
with writing compute function which will lookup
Hi
I wanted to add a couple of words that another solution would be to
add an option to xargs in target.mk
xargs -n NNN
where NNN is less than the OS limit.
(That helped me to build LambdaVM on windows, there are quite a lot of
class files there, and no SPLITOBJS will obviously help)
(castIntToDouble x)
matches _ _ = Nothing
2007/6/7, Daniil Elovkov [EMAIL PROTECTED]:
Hello folks
Haskell is considered good for embedded DSLs. I'm trying to implement
some simple EDSL in a typeful manner and having a problem with looking
up variable values.
.
My try was
compute :: Scope
Ok,
btw, this works :)
data Cnd c where
In :: (Eq (c a)) = c a - [c a] - Cnd c
check :: (Eq (c a)) = Cnd c - Bool
check (x `In` items) = x `elem` items
That's nice :)
2007/3/23, Simon Peyton-Jones [EMAIL PROTECTED]:
| Interesting thing though, it's the same on 6.4.1.
|
| Wasn't this
2007/3/23, Daniil Elovkov [EMAIL PROTECTED]:
Ok,
btw, this works :)
data Cnd c where
In :: (Eq (c a)) = c a - [c a] - Cnd c
check :: (Eq (c a)) = Cnd c - Bool
Eq constraint isn't even needed here, obviously
check (x `In` items) = x `elem` items
Hello folks
A section on GADTs in the GHC user's guide gives a simple example:
data Term a where
Lit:: Int - Term Int
Succ :: Term Int - Term Int
IsZero :: Term Int - Term Bool
eval :: Term a - a
eval (Lit i) = i
eval (Succ t) = 1 + eval t
eval (IsZero t) =
Ok, thank you very much.
Interesting thing though, it's the same on 6.4.1.
Wasn't this brokenness introduced in 6.6, but rather has lingered in
ghc for a while, or since the introduction of GADTs, at all?
2007/3/22, Simon Peyton-Jones [EMAIL PROTECTED]:
Try the HEAD. GADTs + type classes are
Hello Brian
I wrote you on this just some hours ago, before I had looked through
haskell-cafe! That's an interesting coincidence!
Anyway, moving my questions here.
1.
How easy is it to interoperate with Java code (call methods, pass Java
objects) for Haskell code run by LambdaVM rts? And vice
Hello Haskellers
My desire is simple. I want GHC-Cygiwn. I spent quite a lot of time
struggling, trying to build ghc-6.6-Cygwin with ghc-6.4.1-mingw32.
After having patched a lot of #ifdefs and the like I finally did it.
Threaded RTS doesn't seem to work, but that's ok.
And all that only to
Hello
Well, where possible seem to be important words in my view.
There are quite a lot of Haskell problems which rely on posix
functionality. Still, it is very desirable to work with them on
Windows to me.
Maybe there is another way to deal with them, that hasn't come to my mind?
2007/1/30,
2007/1/30, Daniil Elovkov [EMAIL PROTECTED]:
Hello
Well, where possible seem to be important words in my view.
There are quite a lot of Haskell problems which rely on posix
Haskell programs, sorry :)
It's quite late here already
functionality. Still, it is very desirable to work with them
52 matches
Mail list logo
