[Haskell-cafe] Re: newbie question about denotational semantics

Alexander Vodomerov <[EMAIL PROTECTED]> wrote in article <[EMAIL PROTECTED]> in gmane.comp.lang.haskell.cafe: > The question is: how can this "theorem" be formulated (and prooved) in > mathematically precise way? It seems to me that you can define a type-directed translation from the old denotati

Re: [Haskell-cafe] Re: Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve)

Someone asked if I'd include a "classic C" version of the Sieve in my comparisons. Having done so, Lennart wrote (slightly rephrased): How did you compare the C version with the Haskell versions? The Haskell programs produce the Nth prime, whereas the C code produces the last prime less than

Re: [Haskell-cafe] Illegal polymorphic or qualified type: forall l.

Hello Marc, Friday, February 23, 2007, 5:22:12 PM, you wrote: > type ActionMonad a l = forall l. (HOccurs D1 l) >=> ( ReaderT l IO a ) 'l' should be either parameter of type constructor or forall'ed variable. it seems that you try to set limitations on type constr

Re: [Haskell-cafe] How to build a generic spreadsheet?

Basically, a spreadsheet, but generalized for any computation http://www.cse.ogi.edu/~magnus/Adaptive/ Thanks, this is exactly what I was looking for! http://www.haskell.org/frp/ Cool, this is probably what I'm attempting to reinvent. :) http://

Re: [Haskell-cafe] Need help of explanation possible!!! Pls

iliali16 wrote: take :: Integer -> [Integer] -> [Integer] take _ [] = [] take n xs |x < lenghtList xs = (take (n-1) xs :[]) |otherwise = xs I have decleared lenghtList before. The wrong expression "xs:[]" indicates a major misunderstanding; it worries me alot because you also say you understa

Re: [Haskell-cafe] Re: Code and Perf. Data for Prime Finders (was: Genuine Eratosthenes sieve)

How did you compare the C version with the Haskell versions? The Haskell programs produce the Nth prime, whereas the C code produces the last prime less than N. To make the C code to what the Haskell code does you need to set some upper bound that is related to the prime number distribution. I se

[Haskell-cafe] Re: Embedding ghc

On 2007-02-10, Brian Smith <[EMAIL PROTECTED]> wrote: > "If you have to ask, you can't afford it." :) OK, then what about embedding Hugs? ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Need help of explanation possible!!! Pls

Hi I am abit new to this language though I manage to study it very fast and understand it well. I have some tutorials to do inorder to practice it. The thing is I want to declear some functions but to do that I need to understand how exactly "take" works in hugs. Couse I want to build a similar fu

Re: [Haskell-cafe] haskell-art mailing list

Is this something for the list at http://haskell.org/mailman/listinfo ? (Maybe this page could be moved to haskellwiki?) Met vriendelijke groet, Henk-Jan van Tuyl -- http://Van.Tuyl.eu/ -- On Sat, 24 Feb 2007 00:10:57 +0100, alex <[EMAIL PROTECTED]> wrote: Hi all, After a bit of discu

Re: [Haskell-cafe] Extracting structured data in XML into records

On Saturday 24 February 2007 21:22, Johan Tibell wrote: > So my question is. How can I write the function > 'extractElementsIntoRecords' below. Or, perhaps HXT is the wrong tool > for the job and I should be trying to walk the DOM tree instead? > > > module HCard where > > > > import Text.XML.HXT.A

[Haskell-cafe] Extracting structured data in XML into records

Hi! I'm trying to extract HCards (http://microformats.org/wiki/hcard) from HTML documents. HCard is a microformat. Microformats is an attempt to add semantic information to XML documents without adding any new tags. This is done by adding semantic information in class attributes instead (see the