enquiries about the position via email to Klaus
Ostermann
http://ps.informatik.uni-tuebingen.de/team/ostermann/
-- Klaus
___
Haskell mailing list
Haskell@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell
[Haskell developers are particularly encouraged to apply]
Dear all,
we are happy to announce that we have new openings at the PhD and PostDoc level.
The Programming Language and Software Technology
Group, headed by Klaus Ostermann, conducts research dedicated to
developing new technologies
ear all,
we are happy to announce that we have new openings at the PhD and
PostDoc level. The Programming Language and Software Technology
Group, headed by Klaus Ostermann, conducts research dedicated to
developing new technologies that help to construct high-quality
software in a productive way
to:
Klaus Ostermann
Contact data available at:
http://www.informatik.uni-marburg.de/~kos/
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
At first I'd like to thank Claus, Ryan, Edsko, Luke and Derek for their
quite helpful replies to my previous thread.
In the course of following their advice I encountered the problem of
moving a forall quantifier over a wrapper type constructor.
If I have
newtype Wrapper a = Wrapper a
and
But here we have an argument that can return a Wrapper (t a) for any
'a'; that does *not* mean it can return a wrapper of a polymorphic type.
If you think about 'a' as an actual argument, then you could pass 'Int'
to get a Wrapper (t Int), Bool to get a wrapper (t Bool), or even
(forall a.
Why does the code below not pass the type checker?
If I could explictly parameterize y with the type constructor Id (as e.g. in
System F), then 'y Id' should have the type Int - Int
and hence y Id x should be OK, but with Haskell's implicit type parameters
it does not work.
So, how can I make
Hi there,
in structural operational semantics, an evaluation context is often used to
decompose an expression into a redex and its context. In a formal semantics on
paper, an expression can just be pattern matched over the grammar of an
evaluation context. If one wants to implement such a
I would like to have a program that can synthesize programs for a
given type, composing only functions from a given library.
For example, suppose my library has
isZero :: Int - Bool
map :: (a - b) - [a] - [b]
and :: Bool - Bool - Bool
fold :: (a - b - a) - a - [b] - a
True :: Bool
(.) :: (b -
Hi all,
I have a problem which is probably not a problem at all for Haskell experts,
but I am struggling with it nevertheless.
I want to model the following situation. I have ASTs for a language in two
variatns: A simple form and a labelled form, e.g.
data SimpleExp = Num Int | Add SimpleExp
for the GADT suggestion. I assume you are referring to Bringert's
ICFP'06 paper? I will take a look.
Klaus
-Original Message-
From: Christophe Poucet [mailto:[EMAIL PROTECTED]
Sent: Thursday, August 03, 2006 1:02 PM
To: Klaus Ostermann
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe
: Niklas Broberg [mailto:[EMAIL PROTECTED]
Sent: Thursday, August 03, 2006 5:15 PM
To: Klaus Ostermann
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Variants of a recursive data structure
Oops, sorry, I think I'm getting too addicted to flags. ;-)
The module I wrote actually doesn't need
Daniel Fischer schrieb:
I'd prefer (very strongly) something like
class Graph g n e | g - n, g - e where
isConnectedTo :: g - n - e - Bool -- or perhaps rather without g
startNode, endNode :: e - n
. . . -- other Methods of interest like nodes, edges, components . . .
with,
13 matches
Mail list logo
