x27; is a graph whose nodes are labelled with elements of
> type n and whose edges are labelled with elements of type e.
I posted an imperative graph module on this list. You could try that instead
of functional graphs. I'm going to write a functional wrapper for that in the
future.
Rega
On Saturday 12 April 2003 23:52, Dominic Steinitz wrote:
> For the theory, look at
> Triples, Toposes and Theories by Barr & Wells. I think it's chapter 7 but I
> haven't got it in front of me.
>
This looks like it's quickly getting out of the realm of programmin
___
> Haskell-Cafe mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell-cafe
--
Eray Ozkural <[EMAIL PROTECTED]>
Software Engineer, BICOM Inc.
GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 874D 539C
___
is one of the simpler category theoretical concepts and I think you
don't even need to know too much about category theory to write monadic
programs. Going beyond monads is more interesting on the other hand. I
haven't been able to catch up with the developments in that area howeve
functions which seemed to be unavoidable. Then you look at the code
as it feels too much like an imperative code and start wondering why you are
using a functional language :)
Happy new year to all Haskellers by the way.
Cheers,
--
Eray Ozkural <[EMAIL PROTECTED]>
Software Engineer, B
s the worst PL in the world after giving 7
years to it
exa <-- He also ditched his C++ like imperative OO language design that he
wasted valuable time with
--
Eray Ozkural <[EMAIL PROTECTED]>
Software Engineer, BICOM Inc.
GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE
s.
The remedies I thought of were using chainl or eliminating left recursion in
the grammar. What do you think should be done in such a case?
Regards,
--
Eray Ozkural <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.e
nter-intuitive. :) The errors resulting from
layout mistakes are hard to spot and are annoying.
On the other hand, it has a blend of intuition. If you are writing in a
certain, not-so-clear-what style, it makes life easier. :)
As you can see I've contradicted myself.
** Type error.
--
On Tuesday 28 May 2002 15:24, Eray Ozkural wrote:
> Hi there,
>
> While trying to read a list of records from a binary database I think I've
> encountered a space leak but I'm not proficient enough to detect the cause
> of the error.
>
Thanks to dennisb from #haskell
an type
it in bash. I think I can't type any of those international chars in ghc.
Maybe some bug fix is in order.
Regards,
--
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo Malfunction: http://mp3.com/ariza
GPG publ
ement causes my problems.
readSessionList :: Handle -> IO [Session]
readSessionList h =
do session <- readSession h
case session of
Nothing -> return []
Just s -> do rest <- readSessionList h
return (s:rest)
Comments appreciated,
66,105,108,105,-2,105,109,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32]
StockList> a
*** Exception: Prelude.chr: bad argument
The problem is the 66 in the beginning of the list. I'm not giving the entire
code, it's not needed...
What should I be using to work with such strings?
Thanks,
--
Eray Ozkural (exa) <[EMAIL PROTECT
> very obviously a friendly, open forum.
>
I think the notion of a cyber cafe works well in project oriented mailing
lists. It has worked well for KDE folks, too.
Thanks,
--
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.b
On Sunday 07 April 2002 09:10, Michal Wallace wrote:
>
> Oh, wow. I just realized I was doing someone's homework.
> That's not cool. :/
I think that's happening for the 100th time on this list.
--
Eray Ozkural <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilken
askell would save you a lot of resources.
Look at the applications on your computer. Something a little too complex and
it becomes 10's of megabytes in source code.... That's surely not needed.
Thanks,
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent Univers
o would be really able to program in Haskell,
I would look for somebody who has done a variety of things rather than
focusing on a single technology/application (just pure mathematics wouldn't
do ;). That kind of a person would be able to find his way in any maze.
Thanks,
- --
Eray
this that they can share?
>
I know it's easy. Try me. ;)
Sincerely,
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo
GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 874D 539C
-
ybody,
>
> I would like to ask you, if you do not know any graph library for
> haskell. I would like to use haskell for prototyping some of
> algorithms on graphs and finite state automata/transducers. In fact
> what I'm looking for is a good (efficient and easy readable) d
quot; keyword was for security.
I think it's obvious, with many years of worldwide experience of Internet
security, why obscurity is *not* security.
Thanks,
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo
al concept such as reflection cannot be deemed as worthless in itself.
Any system that has a tiny bit of introspective powers can be said to be
reflective to some extent, for instance a Haskell interpreter.
Thanks,
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent Unive
d the compilers also know that certain expressions are always
free of side effects, etc.
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo
GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 8
As a programming language it is worse than Fortran (save for vectorized
> arithmetic). So, linguistically a functional scientific programming tool
> would be really very nice. But the performance is another issue.
>
Well I think it is like that because of the way it started. They surely
nature)
Thanks,
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo
GPG public key fingerprint: 360C 852F 88B0 A745 F31B EA0F 7C07 AE16 874D 539C
-BEGIN PGP SIGNATURE-
Version: GnuPG v1.0.6 (GNU/Linux)
take a rather trite
> point of view, in a language such as C /everything/ is done
> within a monad, and all types, even int, are really IO
> something (IO Int).
>
> In Haskell you may see costs associated with using Monads,
> but they are mainly to do with dealing with the dif
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
This looks like a homework! Do you think this would not be plagiarism?
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo
GPG public key fingerprint: 360C 852
ect IIRC.
2. I don't think following the outline of a class based imperative language
will be fitting for a high quality Haskell tutorial. I think you should look
at OcaML tutorial and the python tutorial, and combine ideas from both as
well as your own :)
Thanks,
- --
Eray Ozkural
ue stating whether or not it is a tautology.
>
> If you really want to impress your tutor, see if you can find a function
> that does this in polynomial time.
Wouldn't that be overly impressive? :)
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University,
t the online docs had
to offer although its purpose was to teach only a small subset of the
language for algorithm design.
Thanks,
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. Dept., Bilkent University, Ankara
www: http://www.cs.bilkent.edu.tr/~erayo
GPG public key fingerprint: 360C 85
f "kdoc",
which is the C++/IDL documentation system used in KDE project. It might be
possible to autogenerate haskell bindings for QT using this compiler, sort of
like what gtk-- wants to achieve (but cannot ;)
Thanks,
- --
Eray Ozkural (exa) <[EMAIL PROTECTED]>
Comp. Sci. D
29 matches
Mail list logo
