A while ago I wrote a glibc specific implementation of the CWString
library. I have since made several improvements:
* No longer glibc specific, should compile and work on any system with
iconv (which is unix standard) (but there are still glibc specific
optimizations)
* general iconv library
On Tue, 18 Jan 2005, Satnam Singh wrote:
> I'm trying to find out about existing work on implicit parallel functional
> programming. I see that the Glasgow Haskell compiler has a parallel mode
> which can be used with PVM and there is interesting work with pH at MIT. Does
> anyone know of a
vivian.mcphail:
>
>Dear All,
>I have a parser which has entries for each word, such as:
>
>ate = s \ np / np : ^x y.did(eat y x);
>
>so each word has a type (s \ np / np) and a semantics (the
>lambda term ^x y.did(eat y x)).
>
>Currently I parse the semantics into lamb
Dear All,
I have a parser which has entries for each word, such
as:
ate = s \ np / np : ^x y.did(eat y
x);
so each word has a type (s \ np / np) and a semantics (the
lambda term ^x y.did(eat y x)).
Currently I parse the semantics into lambda terms and use my
own lambda-interpreter
Hello,
> Does this mean that it is not possible to put multiple entry points
> into a GLR parser?
Correct: the GLR parser doesn't provide this standard Happy functionality.
There is the work-around that you mention.
I decided to leave %name out this time, mainly because of the possibility
of t
Functional and Declarative Programming in Education (FDPE05)
A one day workshop at ICFP05
Sunday, 25 September 2005, Tallin, Estonia
http://www.cs.kent.ac.uk/~sjt/fdpe05/
FIRST CALL FOR SUBMISSIONS
Overview
Functional and declarative programming plays an important role in
computing e
On Tue, 18 Jan 2005 12:53:18 -0800, Satnam Singh <[EMAIL PROTECTED]> wrote:
> I'm trying to find out about existing work on implicit parallel functional
> programming. I see that the Glasgow Haskell compiler has a parallel mode
> which can be used with PVM and there is interesting work with pH at
I'm trying to find out about existing work on implicit parallel functional
programming. I see that the Glasgow Haskell compiler has a parallel mode which
can be used with PVM and there is interesting work with pH at MIT. Does anyone
know of any other work on implicitly parallelizing functional p
> parser name directive
>
>This has no effect at present. It will probably remain this way: if you
> want to
> control names, you could use qualified import.
> ...
> The driver file exports a function doParse :: [[UserDefTok]] -> GLRResult
Does this mean that it is not possible to put multip
Oh! I hope that Haskell language and library semantics are defined
independently from any particular Haskell implementation.
- Conal
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf
Of Ben Rudiak-Gould
Sent: Tuesday, January 18, 2005 8:13 AM
To: Conal E
Jim Apple wrote:
> Even if this is denotationally different from a value like zero ::
> Int, I think it is also different from getLine :: IO String. It
> seems to mean something between these.
I think I understand your point better now: Do you want another
denotational distinction, somewhere betw
| Yes, once you start to use the SYB library you end up wanting it to
| cover almost all your types.
| I will make an effort *now* hoping that all the instance can still
make
| it into GHC 6,4.
| (There are indeed a few more unsupported types that make obviously
sense.)
Yes, anything in the HEAD w
Georg Martius wrote:
I was playing around with "Scap you Boilerplate" and realised some
missing instances of Typeable and Data. Is there a particular reason
why there is no Data Double instance?
There has been a Double instance under CVS (GHC HEAD) since March 2004.
It will be included in GHC 6.
Please, pass on to interested students. Apologies for multiple copies.
--
PhD Position (DEADLINE 4 February 2004! See "How to apply" below.)
Departamento de Sistemas Informaticos y Computacion
Technical University of Valencia
ANNOUNCING Happy 1.15 - The LALR(1) Parser Generator for Haskell
I'm pleased to announce version 1.15 of Happy, the parser generator
system for Haskell.
Changes from version 1.14 to 1.15
* New %expect directive
* the list of tokens passed to happyError now includes the current
token
| I was playing around with "Scap you Boilerplate" and realised some
missing instances of Typeable and
| Data. Is there a particular reason why there is no Data Double
instance?
| Furthermore I was wondering why no instance for the collection types
such as FiniteMap, Set and
| HashTable is provided
On 18 Jan 2005, at 16:12, Ben Rudiak-Gould wrote:
I'm not strongly convinced by this argument. I don't think you can
tell me which particular Char value you mean by the expression
(maxBound :: Char) either, yet you probably wouldn't argue for
changing maxBound's type. I think Jim's claim is that
Ben Rudiak-Gould <[EMAIL PROTECTED]> writes:
> How is this different from any other environmental change, such as a change
> in the program arguments?
Isn't this really the old (or fairly recent) discussion of "top level
things with identity"? Should one be able to do something like
args
Surely both requirements can be satisfied if the programs arguments are made
parameters of main:
main :: [String] -> IO ()
Keean.
Ben Rudiak-Gould wrote:
Conal Elliott wrote:
>The meaning of
>"length getArgs" would then have to be a value whose type is the meaning
>of Haskell's "Int", i.e. eithe
On Tue, Jan 18, 2005 at 08:12:42AM -0800, Ben Rudiak-Gould wrote:
> Even if you want to disallow explicit recompilation (and how do you define
> "compilation" denotationally?), an automatic rollout of a new version of Hugs
> could lead to successive invocations of a script using different values of
I still think I'm missing your point, but let me take a stab at it.
Conal Elliott wrote:
I'm suggesting you might better understand the
why of Haskell if you think denotationally (here about the meaning of
the [String] type), rather than operationally.
The meaning of a type seems to be about what h
Conal Elliott wrote:
>The meaning of
>"length getArgs" would then have to be a value whose type is the meaning
>of Haskell's "Int", i.e. either bottom or a 32-bit integer. I'm
>guessing that none of those 2^32+1 values is what you'd mean by "length
>getArgs". On the other hand, the IO monad is a
On 18 Jan 2005, at 06:31, Jim Apple wrote:
Tomasz Zielonka wrote:
I like to think that pure functions don't change between executions.
I'd like to think they wouldn't change within executions. Is there a
pure haskell way to check the value of a function between exections?
In principle, a haskell
On Tue, Jan 18, 2005 at 01:31:19AM -0500, Jim Apple wrote:
> Tomasz Zielonka wrote:
>
> >I like to think that pure functions don't change between executions.
>
> I'd like to think they wouldn't change within executions. Is there a
> pure haskell way to check the value of a function between exect
24 matches
Mail list logo
