So you decide to print up some one-liner style programs into a
little booklet. Something between credit-card and postcard sized, with
a neat but mind-bending program on it. Don Stewart occasionally swoops
in with some fixpoint malarkey to defuse heated discussions. I mean
that kind of thing,
On 8/14/07, Dougal Stanton [EMAIL PROTECTED] wrote:
On 14/08/07, Brent Yorgey [EMAIL PROTECTED] wrote:
Clearly, we need to actually put together such a book! I'm imagining
something where you have two mostly blank facing pages, with the code by
itself in the middle of the right page
On 8/16/07, Ian Duncan [EMAIL PROTECTED] wrote:
Is there any way to view the steps that a haskell program goes
through step by step?
I'm thinking something similar to what I've seen in things I've been
reading. For example:
foldl (+) 0 [1..10]
= (0+1)
= ((0+1)+2)
= (((0+1)+2)+3)
= etc.
On 8/17/07, rodrigo.bonifacio [EMAIL PROTECTED] wrote:
Hi all.
I want to create the following polymorphic type (EnvItem) that we can
apply two functions (envKey and envValue). I tried the following:
type Key = String
data EnvItem a = EnvItem (Key, a)
envKey :: EnvItem (Key, a) -
this works. now if only there were a quiet option for ghci...
But there is! It's called -v0.
-Brent
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On 8/29/07, Alexteslin [EMAIL PROTECTED] wrote:
Hello,
I just came across with this question on the exam and can not think of
implementing it.
Wait, is this an exam for a class you're taking? Or just a problem from an
exam that you're trying to solve for fun? If the former, it really
On 8/29/07, David Frey [EMAIL PROTECTED] wrote:
Hello Haskellers,
I have been trying to learn a bit about Haskell by solving Project Euler
problems. For those of you who don't know what Project Euler is, see
http://projecteuler.net
After solving problem 21, which is related to amicable
On 8/30/07, Peter Hercek [EMAIL PROTECTED] wrote:
Hi,
I find the feature that the construct let x = f x in expr
assigns fixed point of f to x annoying. The reason is that
I can not simply chain mofifications a variable like e.g. this:
f x =
let x = x * scale in
let x = x +
On 8/30/07, Brent Yorgey [EMAIL PROTECTED] wrote:
The way to combine functions into a pipeline is by using function
concatenation:
Oops, of course I meant function composition instead of function
concatenation.
-Brent
___
Haskell-Cafe mailing
It's really maddening to write 50,000 lines of code, eventually get it
to compile, run it, and have the program lock up and start consuming so
much virtual memory that the entire PC becomes unstable within seconds.
(This isn't helped by the fact that Ctrl+C doesn't seem to make either
GHCi
On 9/1/07, Alexteslin [EMAIL PROTECTED] wrote:
Hi,
It is the former, but I sat an exam and trying to discuss my exam answers
which will make no difference to what so ever to an exam, as an exam
duration was 1.5 hours. Which means that no matter how much i would like
to
try to amend my
On 9/3/07, Vimal [EMAIL PROTECTED] wrote:
Hi
In my Paradigms of Programming course, my professor presents this piece of
code:
while E do
S
if F then
break
end
T
end
He then asked us to *prove* that the above programming fragment cannot
be implemented just using if and
On 9/6/07, Chris Saunders [EMAIL PROTECTED] wrote:
So far I'm finding Haskell difficult – I may be too thick.
Once upon a time there was a young man who wanted to be a race car driver.
He bought an old, junky car with a souped-up engine (after all, that's what
all his friends were using). It
Just bookmark: http://haskell.org/hoogle
It's not perfect, but it probably solves lots of your problems.
And if you use Firefox, you can even install Hoogle as one of the search
engines in the upper-right search box. Nice and fast!
-Brent
___
Well, for the default Google searchbox the advantage is:
Ctrl-K search phrase ENTER
versus
grab mouse .. point ... click ... move hand back to keyboard ... type
search phrase, ENTER
I never used any of the secondary search bars. Unless I can define a
shortcut to access hoogle
On 9/11/07, clisper [EMAIL PROTECTED] wrote:
haskell is greate
but i don't know how to start.
A good place to start is the Haskell wiki:
http://haskell.org/haskellwiki/Haskell
On the left, look under Learning Haskell -- there's all kinds of great
stuff linked from there. I would also
On 9/11/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
take 1000 [1..3] still yields [1,2,3]
I thought it was supposed to return an error.
Any ideas?
Thanks, Paul
If for some reason you want a version that does return an error in that
situation, you could do something like the following:
On 9/11/07, Don Stewart [EMAIL PROTECTED] wrote:
byorgey:
On 9/11/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
take 1000 [1..3] still yields [1,2,3]
I thought it was supposed to return an error.
Any ideas?
Thanks, Paul
If for some reason you want a
On 9/25/07, brad clawsie [EMAIL PROTECTED] wrote:
On Tue, Sep 25, 2007 at 01:04:56PM -0700, Evan Klitzke wrote:
Has anybody made (or have a link to) a Haskell reference cheat
sheet?
the zvon ref is pretty close:
http://www.zvon.org/other/haskell/Outputglobal/index.html
in that it
On 9/27/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
intToBin :: Int - [Int]
intToBin 1 = [1]
intToBin n = (intToBin (n`div`2)) ++ [n `mod` 2]
binToInt :: [Integer] - Integer
binToInt [] = 0
binToInt (x:xs) = (x*2^(length xs)) + (binToInt xs)
Any comments and/or criticisms on the above
Just be careful to write:
(map.map) read l
or
map.map $ read l
actually, map . map $ read l does not work, that's the same as (map . map)
(read l), whereas (map . map) read l is the same as ((map . map) read) l.
My guess is that Jules wrote that part while asleep. =)
-Brent
The compiler must be one hell of a machine. I wonder if the source
code is available to the public.
It is, and it is. =)
http://hackage.haskell.org/trac/ghc/wiki/Building/GettingTheSources
-Brent
___
Haskell-Cafe mailing list
On 9/30/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
filter :: (a - Bool) - [a] - [a]
filter f = foldr (\x - \xs - if (f x) then (x:xs) else xs) []
Somehow I feel this could be done more elegantly. What does the list
think?
Thanks, Paul
Well, note that foldr takes a function of x, which
On 10/1/07, PR Stanley [EMAIL PROTECTED] wrote:
f x = x + x
Is the x use to create a pattern in the definition and when f is
called it's replaced by a value?
Those equation-like definitions are syntactic sugar for lambda
abstractions. f could as well be defined as f = \x - x + x.
Just to be clear, I doubt the difference had anything to do with
tail-recursion per se. My guess is that with the mysum version, ghc was
able to do some strictness analysis/optimization that it wasn't able to do
(for whatever reason) with the first version. The best solution (as others
have
(moving to haskell-cafe...)
On 10/8/07, Johan Tibell [EMAIL PROTECTED] wrote:
On 10/8/07, bjornie [EMAIL PROTECTED] wrote:
Hi! I'm kind of new to functional programming with Haskell, I'm reading
a
university course you see. Now I'm having some problems with one of our
lab
assignments,
On 10/8/07, Alex Tarkovsky [EMAIL PROTECTED] wrote:
Alex Tarkovsky wrote:
Brandon S. Allbery KF8NH wrote:
I can has English? :)
This comment inspired what could be either the beginning of an
infectious Haskell recruitment campaign, or just a sign that some of us
are mad. I present
On 10/9/07, Henning Thielemann [EMAIL PROTECTED] wrote:
On Tue, 9 Oct 2007, Alex Tarkovsky wrote:
Brent Yorgey wrote:
Aren't you going to make one featuring a catamorphism? =)
Done, thanks for the contribution! ;)
I wish concat or concatMap :-)
ask and ye shall receive! =)
http
On 10/9/07, Andrew Coppin [EMAIL PROTECTED] wrote:
Brent Yorgey wrote:
On 10/9/07, *Henning Thielemann* [EMAIL PROTECTED]
mailto:[EMAIL PROTECTED] wrote:
I wish concat or concatMap :-)
ask and ye shall receive! =)
http://wso.williams.edu/~byorgey/concatMap.png
http
On 10/12/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
failure :: (Parser a) failure = \inp - []
The code might contain some syntax errors and I'd be grateful for any
corrections.
What is a dual parser failure?
You should probably put the definition on a separate line, thus:
failure ::
Well anyway, as you can see, I'm back. Mainly because I have questions
that I need answers for...
glad you're back. =)
This mailing list is the only place I know of that is
inhabited by people who actually think Haskell is something worth
persuing.
don't forget about the IRC channel!
On 10/17/07, Maurício [EMAIL PROTECTED] wrote:
Hi,
I get this error message when testing a function
in ghci:
*** Exception: stack overflow
I admit I didn't care about efficiency when I
wrote that function, but I'm almost sure it is not
supposed to eat all my memory. Do I need to say
On 10/20/07, Andrew Coppin [EMAIL PROTECTED] wrote:
I'm writing some code where I take an expression tree and transform it
into another equivilent one.
Now it's moderately easy to write the code that does the transformation.
But what I *really* want is to print out the transformation
On 10/22/07, manu [EMAIL PROTECTED] wrote:
Hello
I am not sure it is appropriate to post to this mailing list to
inquire about a peculiar algorithm, if not let me know...
I was looking at one particular puzzle posted on the Facebook site,
'Wiretaps'
Hi all,
I'm pleased to announce the release of a somewhat silly -- yet perhaps
somewhat useful -- library module,
Math.OEIShttp://hackage.haskell.org/cgi-bin/hackage-scripts/package/oeis-0.1,
intended for the enjoyment of combinatorial dilettantes, Project Euler
addicts, and the merely curious
The Online Encyclopedia of Integer Sequences should really contain more
Haskell code for describing the sequences.
Agreed! I propose an OEIS party where we all sit around one day and
submit Haskell code. =)
(I'm only half joking...)
-Brent
___
probably want to write an FFI binding to
MathLink.
On 22/10/2007, Stefan O'Rear [EMAIL PROTECTED] wrote:
On Mon, Oct 22, 2007 at 07:20:47AM -0400, Brent Yorgey wrote:
* returning a lazy infinite list for infinite sequences via an
embedded
general AI and Mathematica interpreter.
Assuming
On 10/22/07, PR Stanley [EMAIL PROTECTED] wrote:
Hi
What are the rules for calculating function types?
Is there a set procedure ?
Thanks, Paul
There must be a set procedure, since otherwise the compiler could not
function! =)
Seriously, though, I'm not exactly sure what you're asking for.
I wonder if there are tricks or lore that could be applied to get better
results or insight.
t.
Just a quick note, I doubt ghc -e does any optimizations. You'd probably
get better results by putting these tests in files and compiling with -O2.
In particular I wonder whether that would stop
On 10/23/07, Thomas Hartman [EMAIL PROTECTED] wrote:
Actually I can't compile it, with or without -O2. loads fine into ghci,
but when I try to create an executable I get
ghc quicksort.hs -o quicksort
quicksort.o: In function `r1Nc_info': undefined reference to
On 10/23/07, Galchin Vasili [EMAIL PROTECTED] wrote:
Hello,
I am trying to use a Haskell shell (Hsh.hs). I am a little
frustrated. There are two modules that are imported:
import LibPosix
import LibSystem
I am running WinHugs (Windows) and hugs/ghci can't find LibSystem. I am
On 10/26/07, Graham Fawcett [EMAIL PROTECTED] wrote:
On 10/25/07, Derek Elkins [EMAIL PROTECTED] wrote:
On Thu, 2007-10-25 at 11:30 -0400, Graham Fawcett wrote:
I'm writing a Gnu DBM module as an exercise for learning Haskell and
its FFI. I'm wondering how I might write a function that
On 10/29/07, Tim Newsham [EMAIL PROTECTED] wrote:
I would love to have the ability to define binary operator modifiers.
For example:
f \overline{op} g = liftM2 op f g
f \overleftarrow{op} n = liftM2 op f (return n)
n \overrightarrow{op} g = liftM2 op (return n) f
On Nov 5, 2007 1:46 PM, Maurício [EMAIL PROTECTED] wrote:
Hi,
Is there a way to run 'ghc -e' taking input
from standard input? I would like to use it
in a pipe.
xargs ought to do the trick nicely.
-Brent
___
Haskell-Cafe mailing list
On Nov 9, 2007 2:08 PM, Hans van Thiel [EMAIL PROTECTED] wrote:
Hello All,
Can anybody explain the results for 1.0, 2.0 and 3.0 times pi below?
GHCi yields the same results. I did search the Haskell report and my
text books, but to no avail. Thanks in advance,
Hans van Thiel
Hugs sin (0.0
On Nov 10, 2007 11:54 AM, Ryan Bloor [EMAIL PROTECTED] wrote:
hiya
I was wondering how I would get the second function do recursively do the
function for poolNews xs tried that and it fails.
Ryan
--Give wins, draws a rating.
poolNews :: Result
*-* PoolNews *-* PoolNews
GHC can be compiled with GHC 5.0 (or something around there). If they
add a new feature, they don't use it in GHC for years and years.
*Can* be compiled with GHC 5.0, or *is* compiled?
http://haskell.org/ghc/docs/6.8.1/html/users_guide/release-6-8-1.html says
that the pointer tagging in 6.8.1
On Nov 11, 2007 6:37 AM, Ryan Bloor [EMAIL PROTECTED] wrote:
hi
I was testing my code when I came across a strange predicament. The input
is a list of ints and a Results type which is of type
[(int,...),(Int..)..]. I am comparing each int from the list to
the first element in
On Nov 11, 2007 9:26 AM, Jim Burton [EMAIL PROTECTED] wrote:
I have X11 1.2.2 installed and wanted to upgrade to 1.3 (to satisfy the
dependencies of another package), but Setup configure tells me I don't
have the headers installed. I do, and when I configure 1.2.2 they're
detected. Is this
Expressiveness certainly makes it easier, but nothing (other than
sanity...) stops you from writing a Haskell compiler in, say, COBOL.
*I* would stop you. Friends don't let friends write in COBOL.
___
Haskell-Cafe mailing list
I would be the last who wanted to spoil such a good joke.
But... tell me please, ANYONE, who takes part in this inspiring exchange:
How many COBOL programs have you written in your life?
How many programs in Cobol have you actually SEEN?
My current project at work has a bunch of legacy
On Nov 14, 2007 12:32 PM, Kurt Hutchinson [EMAIL PROTECTED] wrote:
As part of a solution I'm working on for Project Euler problem 119, I
wanted to create an ordered list of all powers of all positive
integers (starting with squares). This is what I came up with:
powers = ( uniq . map fst .
On Nov 14, 2007 2:57 PM, Kurt Hutchinson [EMAIL PROTECTED] wrote:
On Nov 14, 2007 1:06 PM, Brent Yorgey [EMAIL PROTECTED] wrote:
On Nov 14, 2007 12:32 PM, Kurt Hutchinson [EMAIL PROTECTED] wrote:
The merging can be done much more simply and efficiently (this is code I
wrote when computing
apfelmus, does someone pay you to write so many thorough, insightful and
well-explained analyses on haskell-cafe? I'm guessing the answer is 'no',
but clearly someone should! =)
thanks!
-Brent
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
but isn't there a short text that describes in detail why foldl' is
different from foldl and why foldr is better in many cases? I thought
this faq would have been cached already :)
Perhaps you're thinking of http://haskell.org/haskellwiki/Stack_overflow ?
-Brent
On Nov 16, 2007 9:44 AM, PR Stanley [EMAIL PROTECTED] wrote:
Hi
I understand 2%4 will construct a fraction in Haskell. I've tried
this in GHCI but got an error message. Is there such an operator in
Prelude and if so how is it applied?
Cheers,
Paul
It's in Data.Ratio.
Prelude :m
On Nov 16, 2007 11:14 AM, Valery V. Vorotyntsev [EMAIL PROTECTED] wrote:
Add the following lines to your ~/.emacs:
--- BEGIN OF ELISP CODE ---
;(global-set-key (kbd f9 s) 'delete-trailing-whitespace)
(defun delete-trailing-whitespace-if-confirmed ()
Delete all the trailing
On Nov 22, 2007 1:22 PM, Jonathan Cast [EMAIL PROTECTED] wrote:
On 22 Nov 2007, at 10:17 AM, Maurí cio wrote:
Hi,
If I have two computations a-IO b
and b-IO c, can I join them to
get an a-IO c computation? I imagine
something like a liftM dot operator.
This is called Kleisli
-- Just for fun, make it work with StateT as well
-- (needs -fallow-undecidable-instances)
instance (Monad (t m), MonadTrans t, MonadPrompt p m) = MonadPrompt p
(tm) where
prompt = lift . prompt
Looks like that should be MonadPrompt p (t m) rather than (tm). Note the
space.
-Brent
On Nov 24, 2007 10:55 PM, Conal Elliott [EMAIL PROTECTED] wrote:
why care about trailing whitespace?
Probably because it looks bad in darcs patch summaries (trailing whitespace
-- little red dollar signs). Unless there's another reason I don't know
about.
-Brent
On Nov 27, 2007 10:43 AM, Maurício [EMAIL PROTECTED] wrote:
Hi,
If available memory is low, is the
garbage collector going to eliminate
data that is still referenced, but
it knows it can be recalculated when
needed?
If I understand it correctly, when a thunk is evaluated, it is actually
On Nov 27, 2007 2:34 PM, Andrew Coppin [EMAIL PROTECTED] wrote:
Hi guys.
Somebody just introduced me to a thing called Project Euler. I gather
it's well known around here...
Anyway, I was a little bit concerned about problem #7. The problem is
basically figure out what the 10,001st prime
foldExp :: AlgExp a - Exp - a
foldExp alg (LitI i) = litI alg i
foldExp alg (LitB i) = litB alg i
foldExp alg (add exp1 exp2) = ¿¿¿???
foldExp alg (and exp1 exp2) = ¿¿¿???
foldExp alg (ifte exp1 exp2 exp3) = ¿¿¿???
One comment: it looks like (add exp1 exp2), (and exp1 exp2) and so on
On Dec 4, 2007 12:13 PM, Ryan Bloor [EMAIL PROTECTED] wrote:
hi
I am having trouble with a function that is supposed to eliminate spaces
from the start of a String and return the resulting string. I reckon a
dropWhile could be used but the isSpace bit is causing me problems...
You need to
On Dec 4, 2007 1:29 PM, Ryan Bloor [EMAIL PROTECTED] wrote:
HI
I will try and explain it better.
I am meaning to write a function that takes a string, apple and
eliminates the spaces at the start ONLY. called removeSpace ::
String - String
I decided to use the function
On Dec 3, 2007 7:43 AM, Peter Padawitz [EMAIL PROTECTED] wrote:
What is wrong here? ghci tries (and fails) to deduce certain types for
the comp functions that I did not expect.
type Block = [Command]
data Command = Skip | Assign String IntE | Cond BoolE Block Block |
Loop
kmerge ((x,[y]):[]) = [(x,[y])]
Matching on [y] like this will only match lists with a single element (and
bind y to that element). You probably just want to say
kmerge ((x,y):[]) = [(x,y)]
etc., which will bind y to the entire list.
-Brent
___
On Dec 7, 2007 6:04 PM, Chris Eidhof [EMAIL PROTECTED] wrote:
On 7 dec 2007, at 23:51, Ryan Bloor wrote:
i am using hugs and the isDigit and anything 'is' doesn't work...
they must have forgot to add them in! Does GHC work with them.
Perhaps you need to import Data.Char?
-Brent
On Dec 12, 2007 10:36 AM, Arie Groeneveld [EMAIL PROTECTED] wrote:
Reinier Lamers schreef:
printint :: Int - [Char]
printint = map chr . map (+0x30) . reverse . map (`mod` 10) .
takeWhile (0) . iterate (`div`10)
Most of the time I use this:
digits :: Integer - [Int]
digits = map
On Dec 17, 2007 8:04 AM, Nicholls, Mark [EMAIL PROTECTED] wrote:
No that's fineits all as clear as mud!..but that's not your
fault.
To recap...
type introduces a synonym for another type, no new type is
createdit's for readabilities sake.
Newtype introduces an isomorphic copy
This is what I have so far:
type Pid = FilePath
type Uid = String
type PsData = Map String Uid
type PsChildren = Map Pid PsInfo
data PsInfo = PsInfo PsData PsChildren
type PsMap = Map Pid PsInfo
type PsTree = Map Pid PsInfo
parent :: PsData - Pid
parent psData =
class ShapeInterface shape where
area :: shape-Int
now looks dubiousI want it to be something like
class ShapeInterface shape where
area :: Num numberType = shape-Int ?
Rather, I think you probably want
class ShapeInterface shape where
area :: Num numberType =
On Jan 3, 2008 6:08 AM, Achim Schneider [EMAIL PROTECTED] wrote:
Achim Schneider [EMAIL PROTECTED] wrote:
[...]
I'm trying to grok that
[] = id
++ = .
in the context of Hughes lists.
I guess it would stop to slip away if I knew what : corresponds to.
Well, (:) has type a - [a] -
On Tue, Mar 09, 2010 at 08:42:44PM +0100, Sebastian Hungerecker wrote:
On 09.03.2010 20:04, boblettoj wrote:
score :: String - String - String
score [s] [] = false
score [s] [g] =
if valid 4 g
then (s1 ++ s2 ++ s3 ++ s4) where
s1 = Golds
s2 = show
of a specified type, type
constructor, type family, type class, or pretty much anything else that has
a kind.
This package was developed in response to a sort-of challenge from Brent
Yorgey on #haskell to create this functionality. So, uh, I stayed up last
night until 5 am learning unification
I already have one or two submissions, but a few more would be
great. If you've been thinking about submitting something but
weren't sure or haven't gotten around to it yet, now's the time!
--
Whether you're an established academic or have only just started
learning Haskell, if you
On Fri, Mar 19, 2010 at 03:15:02PM +, Ozgur Akgun wrote:
Hi Cafe!
Disclaimer: I know what I'm going to ask is now available as a language
feature normally.
And sorry for the subject of this message, I couldn't compe up with a
gooddescriptive subject.
Is there any way to limit a
On Fri, Mar 19, 2010 at 04:03:52PM -0400, Ben Derrett wrote:
trace2 a = trace (show a) a
In the definition of `trace2': trace2 a = (show a) a
These don't match. It looks like maybe you forgot the call to trace
in your definition of trace2?
-Brent
We are gauging interest in another Haskell hackathon to be hosted at U
Penn in May, the weekend of either May 15 or May 22. If you might be
interested in attending such a thing, send me an email (please DON'T
reply to all!) with your name and whether you have a strong preference
for one or the
Hi all,
Consider the following declarations.
-- from vector-space package:
(*.*) :: (HasBasis u, HasTrie (Basis u),
HasBasis v, HasTrie (Basis v),
VectorSpace w,
Scalar v ~ Scalar w)
= (v :-* w) - (u :-* v) - u :-* w
-- my code:
data
On Wed, Apr 14, 2010 at 09:51:52AM +0100, Stephen Tetley wrote:
On 14 April 2010 03:48, Brent Yorgey byor...@seas.upenn.edu wrote:
Can someone more well-versed in the intricacies of type checking with
associated types explain this? Or is this a bug in GHC?
If you take the definition
On Thu, Apr 15, 2010 at 12:48:20AM +1000, Roman Leshchinskiy wrote:
Right, this seems weird to me. Why is there still a 'u' mentioned in
the constraints? Actually, I don't even see why there ought to be
both v and v1. The type of (*.*) mentions three type variables, u, v, and
w:
On Wed, Apr 14, 2010 at 09:14:18PM +0200, Dupont Corentin wrote:
Hello Café,
do you know Nomic?
It's a fabulous and strange game where you have the right to change the
rules in the middle of the game!
In fact, changing the rules is the goal of the game. Changing a rule is
considered as a
Conal,
Thanks for looking into this! Making (:-*) into a proper type seems
promising. I did try wrapping (:-*) in a newtype but that didn't
help (although I didn't expect it to).
I see you just uploaded a new version of vector-space; what's new in
0.6.2?
-Brent
On Sat, Apr 17, 2010 at
On Mon, Apr 19, 2010 at 09:40:25AM -0700, Conal Elliott wrote:
On Sun, Apr 18, 2010 at 9:02 PM, Brent Yorgey byor...@seas.upenn.eduwrote:
Conal,
Thanks for looking into this! Making (:-*) into a proper type seems
promising. I did try wrapping (:-*) in a newtype but that didn't
help
There is still plenty of space to register [1] for Hac phi 2010, but
time is running out to get a hotel room at a reduced rate --- if you
want the special rate for the block of rooms we have reserved at the
Club Quarters, you must contact the hotel by this Friday, April 23.
Instructions are on the
I am very pleased to announce that Issue 16 of The Monad.Reader is now
available [1].
Issue 16 consists of the following three articles:
* Demand More of Your Automata by Aran Donohue
* Iteratee: Teaching an Old Fold New Tricks by John W. Lato
* Playing with Priority Queues by Louis
On Fri, May 14, 2010 at 02:37:19PM +1000, Ivan Miljenovic wrote:
On 13 May 2010 04:12, Brent Yorgey byor...@seas.upenn.edu wrote:
* Demand More of Your Automata by Aran Donohue
Great, because of Aran I now can't change some of the bits of API in
graphviz without making the code
On Fri, May 14, 2010 at 11:30:40PM +1000, Ivan Lazar Miljenovic wrote:
Brent Yorgey byor...@seas.upenn.edu writes:
On Fri, May 14, 2010 at 02:37:19PM +1000, Ivan Miljenovic wrote:
On 13 May 2010 04:12, Brent Yorgey byor...@seas.upenn.edu wrote:
* Demand More of Your Automata
On Wed, May 19, 2010 at 04:27:14AM +, R J wrote:
What are some simple functions that would naturally have the following type
signatures:
f :: (Integer - Integer) - Integer
Well, this means f is given a function from Integer to Integer, and it
has to somehow return an Integer, (possibly)
On Wed, May 19, 2010 at 01:37:49PM +, R J wrote:
This is another proof-layout question, this time from Bird 1.4.7.
We're asked to define the functions curry2 and uncurry2 for currying and
uncurrying functions with two arguments. Simple enough:
curry2 :: ((a, b) - c) - (a -
On Thu, May 20, 2010 at 11:53:09AM +1200, Richard O'Keefe wrote:
On May 20, 2010, at 3:18 AM, Brent Yorgey wrote:
On Wed, May 19, 2010 at 04:27:14AM +, R J wrote:
What are some simple functions that would naturally have the following
type signatures:
f :: (Integer - Integer) - Integer
On Sun, May 30, 2010 at 11:15:40AM -0700, Mike Dillon wrote:
begin Michael Snoyman quotation:
http://hackage.haskell.org/packages/archive/base/4.2.0.1/doc/html/Control-Monad.html#v%3AliftM2
file:///usr/share/doc/ghc6-doc/html/libraries/base-4.2.0.0/Control-Monad.html#v%3AliftM2Strangely,
Perhaps something here may be of use?
http://okmij.org/ftp/Haskell/types.html#class-based-overloading
http://okmij.org/ftp/Haskell/types.html#class-based-dispatch
-Brent
On Mon, May 31, 2010 at 01:32:18PM +0200, Steffen Schuldenzucker wrote:
Dear Cafe,
let:
data True
data False
On Mon, Jun 28, 2010 at 08:51:45AM +0400, Victor Nazarov wrote:
What we get with this instances is following code.
main =
do print (sizeof :: Sizeof Word16)
Let's try it.
$ runhaskell this.lhs
this.lhs:78:14:
Couldn't match expected type `Int'
against
I don't know the answer to your questions, but just wanted to note
that you will probably get a better response on the
glasgow-haskell-users mailing list.
http://www.haskell.org/ghc/docs/6.12.2/html/users_guide/mailing-lists-GHC.html
-Brent
On Fri, Jun 25, 2010 at 08:56:09PM -0700, braver
On Fri, Jun 25, 2010 at 02:26:54PM -0700, Walt Rorie-Baety wrote:
I've noticed over the - okay, over the months - that some folks enjoy the
puzzle-like qualities of programming in the type system (poor Oleg, he's
become #haskell's answer to the Chuck Norris meme commonly encountered in
On Sun, Jul 04, 2010 at 10:31:34AM +0100, Andrew Coppin wrote:
I have literally no idea what a type family is. I understand ATs (I think!),
but TFs make no sense to me.
ATs are just TFs which happen to be associated with a particular
class. So if you understand ATs then you understand TFs
On Sun, Jul 11, 2010 at 12:43:47AM +0200, Jose A. Ortega Ruiz wrote:
On Sat, Jul 10 2010, wren ng thornton wrote:
[...]
Yes, you can add multiple dependencies. The syntax is to use , after
the first |.
While having eight parameters is surely a desperate need for
refactoring,
On Wed, Jul 07, 2010 at 09:56:08AM +0100, Patrick Browne wrote:
Hi,
In Haskell what roles are played by 1)lambda calculus and 2) equational
logic? Are these roles related?
Hopefully this question can be answered at a level suitable for this forum.
Since no one else has responded I'll take a
1 - 100 of 472 matches
Mail list logo
