Hi,
Hopefully this is a simple question. I am wanting to know good ways
of using ., the function composition operator, when dealing with
currying functions.
Suppose I have the following functions defined:
f :: Int - Int
f x = x*x
g :: Int - Int - Int
g a b = a + b
If I wish to add 1
Sorry if some of you receive multiple copies of this message.
Stefania Gnesi (FM2003 General Chair)
==
Call for Participation
ICFP (the International Conference on Functional Programming) is coming up
soon -- August 25-29, in Uppsala, Sweden. The following Call for
Participation has the important bits, but here are the two key things you
need to know if you are thinking of attending this year:
- Registration is open
Could this problem be solved by having interactive environments (ghci, Hugs)
extend the default rules so that they don't just apply for Num contexts but
also for Show contexts?
For example, with a default declaration
default ((), Integer, Double)
we would have the ambiguous type
show []
- use Helium at this stage, switch to full Haskell systems later?-)
- more relevant on these two lists: people have been going on
about teaching Prelude/Libraries for years. I understand that GHC
at least has seen a lot of work on making the Prelude replacable
recently; one good way of
Please see the attached zip file for details.
Unknown command - PLEASE. Try HELP.
Summary of resource utilization
---
CPU time:0.000 sec
Overhead CPU:0.000 sec
CPU model: sun4u
Job origin: [EMAIL PROTECTED]
Compiling a program with ghc built from CVS shortly after the 6.0 release
produced this error message:
ghc -fglasgow-exts -O2 -cpp -DBUILD_DATE=\\\`date`\\\ -package-conf
../../mk/package.conf -package flux_utils -package flux_clang -package
haskell98 -c FlattenCore.hs -o FlattenCore.o -hisuf
Not sure if this counts as a bug or not, but I've got the following
program:
import GHC.Exts
import Data.List
wrapper_sum xs = ub_acc_sum xs 0#
ub_acc_sum :: [Int] - Int# - Int
ub_acc_sum [] v = I# v
ub_acc_sum ((I# x):xs) v = ub_acc_sum xs (v +#
GHC 6.0 fails to compile this on x86 Linux with -fno-implicit-prelude
-prof:
module M where {}
$ ghc -fno-implicit-prelude -prof -c M.hs
/tmp/ghc4124.hc:5: `NULL' undeclared here (not in a function)
/tmp/ghc4124.hc:5: initializer element is not constant
/tmp/ghc4124.hc:5: (near initialization
Bugs item #764602, was opened at 2003-07-02 14:03
Message generated for change (Comment added) made by simonmar
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=764602group_id=8032
Category: Compiler
Group: 6.0
Status: Closed
Resolution: None
Priority: 5
Bugs item #769733, was opened at 2003-07-11 16:15
Message generated for change (Comment added) made by simonmar
You can respond by visiting:
https://sourceforge.net/tracker/?func=detailatid=108032aid=769733group_id=8032
Category: Build System
Group: 6.0
Status: Closed
Resolution: Fixed
Priority:
There is a bug in the nightly build scripts for running the nofib
suite. Nofib programs can fail, yet the build output will still
be ok.. In fact, every single nofib program can fail to
compile, but it will still be ok. in the nightly mail.
In a normal nightly build, we get this kind of
On Mon, Jul 07, 2003 at 03:49:38PM +0100, Simon Peyton-Jones wrote:
Some of you have already discovered that GHC 6.0 has a nasty bug: if you
go
ghci foo\Baz.hs
and there is any error at all in Baz.hs, then GHC deletes the source
file! This seems like excessive punishment for a type
blaat blaat wrote on Wed, 16 Jul 2003 12:05:45 +0200:
Hi al!
In my holliday I like to hobby a bit with haskell. For a small formalization
I wanted to try out a specification which uses infinite types. Does a
(extended) haskel compiler exist which allows infinite types?
No, it simply
bjkwak wrote:
I have downloaded and read some tutorials from
the Haskell home page, but most of them are
incomplete and I decided to buy a book or two.
Did you try http://www.isi.edu/~hdaume/htut/tutorial.ps ?
Yet Another Haskell Tutorial by Hal Daume III et al.
A tutorial for Haskell that is
On Tue, Jul 15, 2003 at 09:28:32PM -0400, Abraham Egnor wrote:
What's the difference between the ghc6 packages provided by your archive
and the ones currently in Debian unstable?
You can't install the unstable packages on a stable system (too old a
libc6 for one thing). These packages are just
Sorry if this mail starts a new thread. I am not subscribed to haskell-cafe
and am new to hotmail.
Uhm, as far as the example goes. I was trying to define a small (shallow
encoding of) a reactive systems language. Because I wanted to try something
else than monads I defined the following
On Wed, Jul 16, 2003 at 02:01:36PM +0200, blaat blaat wrote:
Sorry if this mail starts a new thread. I am not subscribed to haskell-cafe
and am new to hotmail.
Uhm, as far as the example goes. I was trying to define a small (shallow
encoding of) a reactive systems language. Because I
Christian Maeder wrote:
bjkwak wrote:
I have downloaded and read some tutorials from
the Haskell home page, but most of them are
incomplete and I decided to buy a book or two.
Did you try http://www.isi.edu/~hdaume/htut/tutorial.ps ?
Yet Another Haskell Tutorial by Hal Daume III et
Dnia ro 16. lipca 2003 14:34, Ross Paterson napisa:
type R m = m - Maybe (R m, [m])
I don't think there's an extension of Haskell with regular type
unification. It's certainly possible, but there's an equivalent in
standard Haskell:
newtype R m = MkR (m - Maybe (R m, [m]))
It will
type R m = m - Maybe (R m, [m])
I don't think there's an extension of Haskell with regular type
unification. It's certainly possible, but there's an equivalent in
standard Haskell:
newtype R m = MkR (m - Maybe (R m, [m]))
It will possibly be more convenient to break the cycle in
But I have a vague recollection of an alternative syntax, something like
[(i,j) \ i - [..], j - [1..]]
that generated a list something like
[(1,1),(1,2),(2,1),(1,3),(2,2),(3,1),...]. Did I dream this, or was it
a feature of Miranda*, Gopher or Hugs many years ago?
Peter
A long time ago I
22 matches
Mail list logo
