Program Transformation
Special Issue in the Science of Computer Programming
Deadline is 1.4.2003
Find CFC attached
or at http://www.cwi.nl/~ralf/pt-scp/
(Program transformation is of interest for many subscribers
of this list because program transformation is crucial
for the implementation of fun
International Conference on
Geometric Modeling & Graphics (GMAG 2003)
(Previously, Computer Aided Geometric Design Symposium)
in co-operation with IEEE Computer Society
JULY 16-18, 2003
London, UK.
Aims and Scope:
===
Computer-Aided (CA) techniques for Geometric Modeling (GM) and Comp
Dean Herington <[EMAIL PROTECTED]> writes:
> Yes, getting the right amount of strictness--and in the right places--can be
> tricky.
Tell me about it!
> You should do the counting strictly:
>
> Just n -> case n+1 of n1 -> addToFM f w n1
Thanks for the tip. Just performing this change
> You should do the counting strictly:
>
> Just n -> case n+1 of n1 -> addToFM f w n1
Careful - that case expression doesn't actually force n to be evaluated.
It's exactly equivalent to
let n1 = n+1 in addToFM f w n1
You need to use seq to force evaluation.
Cheers,
**
** second call for papers and participation ***
**
Third International Workshop on
Reduction Strategies in Rewriting and Programm
G'day.
On Mon, Feb 17, 2003 at 01:44:07AM -0500, Mike T. Machenry wrote:
> I was wondering if it's better to define them as type classes with the
> operations defined in the class. What do haskellian's do?
I can't speak for other Haskellians, but on the whole, it depends.
Here's the common sit
Title: FM03 CFP- Deadline is
approaching
Sorry if some of you receive multiple copies of this message.
Stefania Gnesi (FM2003 General Chair)
==
Call for Papers
--
