Am Montag, 28. November 2005 20:52 schrieb John Hughes:
> Wolfgang Jeltsch wrote:
> > "What is the first programming language students on your degree programme
> > learn?"
> > "What is the second programming language students on your degree programme
> > learn?"
> >
> > This is too restrictive. Wh
Wolfgang Jeltsch wrote:
"What is the first programming language students on your degree programme
learn?"
"What is the second programming language students on your degree programme
learn?"
This is too restrictive. What if the lecture "Computer Science I" is held in
different years by differ
Wolfgang Jeltsch wrote:
Am Montag, 28. November 2005 16:39 schrieb John Hughes:
I'm carrying out another survey of the Haskell community, this time to
find out how Haskell is being used in university teaching.
"Roughly how many students took the course last time it was taught?"
What
On 11/28/05, Wolfgang Jeltsch <[EMAIL PROTECTED]> wrote:
>
> As I already said, this approach may lead to mixing different concepts.
> Example:
>
> data Person = Person { name :: String }
> data File = File { name :: String }
>
> A field identifier has to be seen in context of the d
"What is the first programming language students on your degree programme
learn?"
"What is the second programming language students on your degree programme
learn?"
This is too restrictive. What if the lecture "Computer Science I" is held in
different years by different lecturers which teach d
Am Montag, 28. November 2005 16:39 schrieb John Hughes:
> I'm carrying out another survey of the Haskell community, this time to
> find out how Haskell is being used in university teaching.
"Roughly how many students took the course last time it was taught?"
What if this course was never thaught
Am Sonntag, 27. November 2005 22:34 schrieb John Lask:
> correct me if I am wrong but ...
>
> 1. Field namespaces: solved by using type classes
>
> This would imply that the type of the field is the same between all
> instances of this common field.
>
> Under this proposal two fields with s
Good questions.
You can't have a polymorphic typecase like "`extQ` (show :: Show a => a
-> String )" because that's not really a *type*case. It is too
polymorphic.
You can have a polymorphic typecase like "`extQ` ( lshow :: [ a ] ->
String )" because that's covered by the SYB2 paper; you need ex
Ketil Malde wrote:
>> Perhaps data Foo = Foo { foo :: Int, bar :: Int ; bar = 2 * foo self }
>> with a reserved word "self" is better. - Are there semantic problems?
>
> Can't you solve this by writing a fiunction to construct Foo with the
> desired properties?
Sure but by the same argument I
Johannes Waldmann <[EMAIL PROTECTED]> writes:
> Again, the concrete syntax problem is whether to hide the argument.
> Perhaps data Foo = Foo { foo :: Int, bar :: Int ; bar = 2 * foo self }
> with a reserved word "self" is better. - Are there semantic problems?
Can't you solve this by writing a f
I'm carrying out another survey of the Haskell community, this time to
find out how Haskell is being
used in university teaching. If you're teaching a course and using
Haskell in any way, then this survey
is aimed at you! You can find the survey form at
http://www.cs.chalmers.se/~rjmh/Wash/S
Dear all, in Data.Generics.Text
http://cvs.haskell.org/cgi-bin/cvsweb.cgi/fptools/libraries/base/Data/Generics/Text.hs?rev=1.10
I find this nice example
gshow = ( \t ->
"("
++ showConstr (toConstr t)
++ concat (gmapQ ((++) " " . gshow) t)
++ "
> It actually sounds a lot like pattern guards, since you're suggesting this
> sugar could be applied to any sort of object? So your desugarer would
> allow a function like
>
> islong :: [a] -> Bool
> islong {length = l} = l > 10
this looks like a hack that only works for one-argument functions
On Sun, Nov 27, 2005 at 08:47:54PM +, Rob Ennals wrote:
> On 11/23/05, David Roundy <[EMAIL PROTECTED]> wrote:
> > > 3. "Safe" getters for multi-constructor data types: ditto
> >
> > I think either you misunderstood my meaning by "safe", or I misunderstood
> > your paper. I meant that if I wri
I apologize for the posting in which I mention the inadequacy of Doaitse
Swierstra partition program, it has been commented by others, and the thread
is obsolete. But my posting (issued immediately then) got delayed by the
moderator because of the schizoidal nature of my e-mail address... Sorry.
[ Our apologies for multiple copies. ]
==
Second Call for Papers
COORDINATION 2006
8th International Conference on Coordination Models and Languages
http://www.cs.un
*
Call For Papers
The 2006 International Symposium on Memory Management (ISMM'06)
Co-located with PLDI 2006
Ottawa, Canada
Doaitse Swierstra wrote:
Or (since we started to do someone's homework anyway)
generate 0 = [[]]
generate n = [x:rest | x <- [1..n], rest <- generate (n-x)]
Unless I am misled, this will generate the *unordered* partitions,
e.g., for n=7, 64 of them, not 15.
Jerzy Karczmarczuk
_
18 matches
Mail list logo
