to compete for the award. SoTeSoLa is a fun-oriented research
event.
Regards,
Jean-Marie Favre (Research 2.0 Chair)
Ralf Laemmel (General Chair, SoTeSoLa)
Vadim Zaytsev (Hackathon Coordination)
___
Haskell mailing list
Haskell@haskell.org
http
Dear Haskell-ers,
SoTeSoLa is not a Haskell- or FP-centric event, but Haskell-ers are
very much encouraged to represent their technological space at the
school. In fact, I know for a reason that some Haskell-ers will be
there, but the more the better. I expect that Haskell will play a role
in one
Dear Haskellers,
this summer school contains bits of formal methods and language design
that typically intersect very well with interests on this list.
Looking forward to meet some of you in Koblenz.
Ralf
8< - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
CALL FOR PAR
> Thank you! What I have in mind is three way merging - you have two
> revisions based on the same original value, and you need to decide whether
> they can be merged automatically or they need to be merged by a user. You
> only have a real conflict when both revisions differ from the original an
On Mon, Jun 1, 2009 at 8:20 PM, David Fox wrote:
> Is there a Scrap Your Boilerplate guru out there who could whip up a three
> argument version of gzip for me?
This can be done of course (untested but type-checked code follows).
Left wondering what the scenario might be :-)
Ralf
import Prelude
Mar 17, 2009 at 2:52 AM, Ralf Laemmel wrote:
> {-
>
> Recursive instance heads as in ...
> instance C0 (x,Bool) => C0 x
> ... are Ok if we allow for typechecking scheme as described in "SYB with
> class".
> The main idea is to assume C0 x in proving the precondit
{-
Recursive instance heads as in ...
instance C0 (x,Bool) => C0 x
... are Ok if we allow for typechecking scheme as described in "SYB with class".
The main idea is to assume C0 x in proving the preconditions of the
body of the clause.
This is also works for mutual recursion among type classes an
rials
[Deadline: 20th March]
Regards,
Ralf Laemmel
Satellite Chair GPCE 2008
PS: The paper deadline for GPCE is in May.
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/mailman/listinfo/haskell
> Given two type classes A t and B t, I'd like the typechecker to derive
> different A t instances depending exactly on whether t is an instance of
> B. In other words, is it possible to define a class (actually a type-level
> function) IsB t f such that:
A GHC-like type system is in principle pow
> You did not say anything that's imprecise about "mentioning each other
> in a cycle", just the well-known fact that it's not equivalent to total
> termination checking (in fact, it's neither fully an overestimate nor
> underestimate of termination -- it's just an estimate that's likely to
> be ri
Isaac wrote:
> I wonder whether it would be safe for the compiler to infer simply by
> the default methods mentioning each other in a cycle. It might miss
> some cases when (probably involving laziness) the default methods
> actually terminate and form an intended set of implemention, and warn
>
[You can actually check that indeed Haskell folks have contributed to this
workshop in the past. -- Ralf]
Call for papers:
FOAL: *F*oundations *o*f *A*spect-Oriented *L*anguages A one day workshop
affiliated with AOSD 2008 in Brussels, Belgium, on 31 March or 1 April 2008.
Themes and Goals
*FO
Assoc types and GADTs are great but
I am still too fond of encoding extensible datatypes with (open) classes.
I contributed to some related discussion at comp.compilers a while ago [1].
The Haskell code samples are worth sharing (because they are so simple):
http://homepages.cwi.nl/~ralf/OOHask
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.
Special Issue on
Foundations of Aspect-Oriented Programming
Science of Computer Programming
Last Call For Contributions
[
Please note the new deadline: 1 March 2005.
This deadline caters for synchronisation with the FOAL 2005 workshop.
See text below.
]
Guest Editors: Pascal Fradet and Ralf
FOAL: Foundations of Aspect-Oriented Languages
A one day workshop affiliated with AOSD 2005 in Chicago, USA, on Monday,
14 March 2005.
Themes and Goals
FOAL is a forum for research in foundations of aspect-oriented
programming languages. Areas of interest include but are not l
Hi,
I refer to Section 5.3 (title see subject line) in
Type classes: exploring the design space
by Simon Peyton Jones, Mark P. Jones and Erik Meijer
HW 1997.
There it is argued very briefly that a type system
with controlled scope of instances risks coherence.
Likewise, in Wadler's and Blotts origi
Tomasz Zielonka wrote:
BTW, This thread reminds me a similar problem that was discussed on
haskell list. Unfortunately, there were some problems with this approach
(accumulating typeclass contexts).
http://www.haskell.org/pipermail/haskell/2004-August/thread.html#14427
Yes, quite relevant.
In "Scr
Summer School on
Generative and Transformational Techniques
in Software Engineering
4 - 8 July, 2005, Braga, Portugal
http://wiki.di.uminho.pt/twiki/bin/view/GTTSE/WebHome
SCOPE AND FORMAT
The summer school brings together PhD students, lecturers, tool
presenters, as well as other researchers a
[ Functional programming
has contributed to the foundations of AOP
over the last few years.
For instance, see Walker's and Wand's contributions at ICFP 2003. ]
Special Issue on
Foundations of Aspect-Oriented Programming
Science of Computer Programming
Guest Editors: Pascal Fradet and Ralf Lämmel
[EMAIL PROTECTED] wrote:
snipped
There seems to be something in the air.
See the recent haskell-cafe thread started by Keean Schupke:
http://www.haskell.org//pipermail/haskell-cafe/2004-July/006347.html
Especially my reply:
http://www.haskell.org//pipermail/haskell-cafe/2004-July/006349.html
(this
ls, see [1,2]
There are other kinds of type reflection that come handy
in such a context; we really plan to release [3] very soon :-)
Ralf
[1] The boilerplate site: http://www.cs.vu.nl/boilerplate
[2] The code for this example:
http://www.cs.vu.nl/boilerplate/testsuite/perm.hs
[3] Scrap mo
let me know if you need further help.
Simon PJ and I have a draft which explains all this
but it is too clumsy to release yet :-)
All the best,
Ralf
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
___
Haskell mailing lis
As Bernie and Derek already pointed out, in principle, the rich work on
intensional polymorphism and dynamic typing comes to mind. In
particular, dynamics are readily supported in Haskell.
Let me add the following.
Type-safe cast is now clearly localised in the module Data.Typeable.
(Due to a refa
(*
This field has meanwhile seen a number of contributions from the
functional programming community. So it is fair to assume that
the present announcement is of interest for subscribers of this list.
*)
FOAL: Foundations of Aspect-Oriented Languages
A one day workshop affiliated with AO
(*
This field has meanwhile seen a number of contributions from the
functional programming community. So it is fair to assume that
the present announcement is of interest for some subscribers of
this list.
*)
FOAL: Foundations of Aspect-Oriented Languages
A one day workshop affil
(*
This field has meanwhile seen a number of contributions from the
functional programming community.
So it is fair to assume that the present announcement is of interest
for some subscribers of this list.
*)
FOAL: Foundations of Aspect-Oriented Languages
A one day workshop affiliated w
[EMAIL PROTECTED] wrote:
According to the communities report there are different
generic haskell projects (Jeuring/Hinze and PJ/Lämmel) out there.
But I don't understand their relation.
Can you use both at the same time?
Is one building on the other?
Are there adressing different issues?
A clarify
Regarding M. P. Jones proposal
to move command-line options to the module space,
I would like to reiterate something from an earlier email:
What if you want to express that "overlapping instances" are
fine for a certain class C but not for the rest? Recasted
to the module speak of MPJ, would that
han scraping boilerplate.
Ralf
[1} "Scrap your boilerplate: a practical design pattern for generic
programming"
by Ralf Lämmel and Simon Peyton-Jones,
appeared in Proceedings of TLDI 2003, ACM Press
http://www.cs.vu.nl/boilerplate/#paper
--
Ralf Laemmel
VU & CWI, Ams
rghetto movement
It is trivial; it makes Stephanie Weirich's type-safe
cast fit for nominal type analysis.
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
http://www.cwi.nl/~ralf/
___
Haskell mailing li
6 E6C4 815D 434D 0498 2B08 7867 4860 F5D7 639D
> _______
> Haskell mailing list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
http://www.cwi.nl/~ralf/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
t to use typeclass restrictions with traversal, or there is
> no luck for me?
>
> --
> Dmitry Astapov //ADEpt
> GPG KeyID/fprint: F5D7639D/CA36 E6C4 815D 434D 0498 2B08 7867 4860 F5D7 639D
> ___
> Haskell mailing list
> [EMAI
Ashley Yakeley wrote:
>
> At 2003-06-28 02:51, Ralf Laemmel wrote:
>
> >Suffering from persecution mania,
> >I prefer to know for sure that nobody never ever will
> >pattern match on those a's. So I prefer to write:
>
> I don't understand. Did you
other hand, supporting the above style with TypeArg's
by an ADT, would make the whole thing entirely safe and transparent.
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
http://www.cwi.nl/~ralf/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
s. I mean that the design and use of these
datatypes is normally an ingenious process as opposed to
boilerplate programming in the sense of AST or document
traversal.)
Ralf L.
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.
af 88) (Leaf 37))
So this would give you [42,88,37].
(So you do not need to force your datatypes to become
functors, neither do you write Functor instances.)
I added this example to the boilerplate page.
http://www.cs.vu.nl/boilerplate/
Ralf
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherla
functional languages, and it is
also a typical application domain of functional programming.
Other keywords: Meta-programming, XML processing, refactoring.)
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
http://www.cwi.nl/~ralf/
Special Issue on Pro
@... ?
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
http://www.cwi.nl/~ralf/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
,
and can be directed to the authors:
* Ralf Laemmel([EMAIL PROTECTED])
* Joost Visser([EMAIL PROTECTED])
Have fun!
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
Not just a few haskell@... subscribers
do transformation for/with functional programming.
Thanks for passing on to interested authors.
--
Ralf Laemmel
VU & CWI, Amsterdam, The Netherlands
http://www.cs.vu.nl/~ralf/
http://www.cwi.nl/~ralf/
Special Issue on Program Transformation
Scienc
appl. will be included in the next
release of Strafunski coming very soon now.
Ralf
--
Dr.-Ing. Ralf Laemmel
CWI & VU, Amsterdam, The Netherlands
http://www.cwi.nl/~ralf/
http://www.cs.vu.nl/~ralf/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
ELF-CHECKING notion to address all concerns a
programmer could possibly have. By self-checking I mean that the firm
adherence to a well-designed format for a catalogue is the key.
Ralf
--
Dr.-Ing. Ralf Laemmel
CWI & VU, Amsterdam, The Netherlands
http://www.cwi.nl/~ralf/
http://www.cs.vu.n
Simon Peyton-Jones wrote:
> Indeed the foralls are at the top, but I claim that wherever
> you could use the composition function you were expecting,
> you can also use the one GHC gives you. The two types
> are isomorphic.
> ...
> Let me know if you find a situation where this isn't true.
> ...
Simon Peyton-Jones wrote:
> In fact GHC does "forall-lifting" on type signatures to bring the
> foralls to the front. But there's a bug in 5.02's forall-lifting...
> ...
> Perhaps you can try the 5.03 snapshot release?
Certain things work there.
In fact, it is fascinating.
But now I did a new
h three or more layers.
I guess more people should have suffered from that?
Ralf
--
Dr.-Ing. Ralf Laemmel
CWI & VU, Amsterdam, The Netherlands
http://www.cwi.nl/~ralf/
http://www.cs.vu.nl/~ralf/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
ong direction I claim.
I tried a few other tricks but I can't get it done
although my first-class polymorphic experience makes
me think that it should be possible.
Anyway, can this problem be solved?
Any hint appreciated.
Ralf
--
Dr.-Ing
iling list
> [EMAIL PROTECTED]
> http://www.haskell.org/mailman/listinfo/haskell
--
Dr.-Ing. Ralf Laemmel
CWI & VU, Amsterdam, The Netherlands
http://www.cwi.nl/~ralf/
http://www.cs.vu.nl/~ralf/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mailman/listinfo/haskell
appreciate your feedback.
Regards,
Joost Visser and Ralf Laemmel
--
Dr.-Ing. Ralf Laemmel
CWI & VU, Amsterdam, The Netherlands
http://www.cwi.nl/~ralf/
http://www.cs.vu.nl/~ralf/
___
Haskell mailing list
[EMAIL PROTECTED]
http://www.haskell.org/mai
49 matches
Mail list logo
