IFL/TFP 2003 2nd call for participation/registration

ter the workshop, a high-quality subset of contributions will be published in the Springer LNCS series. All speakers attending the workshop are invited to submit a paper. Papers for the LNCS proceedings will be refereed according to normal conference standards. Greg Michaelson and Phil Tri

Re: Web Demonstration of Type Error Slicing

Please give some examples. It doesn't like ; at the end but says EOF when ; is missed. It doesn't show the examples when I select them. Greg ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

Re: Web Demonstration of Type Error Slicing

Please tell me when it recognises [] as the empty list and :: as a list constructor. Thanks! Greg ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

FINAL CALL: 3rd SCOTTISH FUNCTIONAL PROGRAMMING WORKSHOP

kshop For further details, please see: http://www.cee.hw.ac.uk/~greg/sfp3/ Sharon Curtis | Greg Michaelson| Workshop Coordinators Phil Trinder | ___ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell

RE: rules

ungroup higher order functions to try and optimise skeleton based parallelism. We're also investigating program synthesis to "lift" higher order functions from programs that don't contain them explicitly. Greg Michaelson

Re: GHC in Japanese Fifth Generation Project!

It's: Guarded Horn Clauses. Horn Clauses are a normal form for predicate calculus expressions. I expect that Haskellites are probably familiar with guards... Greg Michaelson

Re: Standard Haskell

r even Haskell-A... I'm almost missing incomprehensible discourse on the Haskell type system... Greg Michaelson

Re: Could Haskell be taken over by Microsoft?

t then why maintain its purity other than as an academic exercise? More to the point, would a standard imperative notation sitting on top of monads really hurt Haskell that much? Greg Michaelson PS from an SML enthusiast... Step 4: MS Office is rewritten in Haskell. All PCs now require a minimum

Re: Exceptions and functions. Second round?

ed in prototyping and then generating code for such multi-process use. Greg Michaelson PS 4004 < 8008 < 8080 < 8086 < 80286 < 80386 < 80486 < Pentium ...

Re: Exceptions and functions. Second round?

have written interrupt driven multi-process systems. It probably has horrendous semantic implications... Greg Michaelson

Re: Formal design spec into Haskell or Miranda

orthodoxy... No one has yet confessed to using Haskell for such degenerate purposes... The reference is: Hayes & Jones, `Specifications are not (necessarily) executable', Software Engineering Journal, Vol 4, No 6, pp330-338, 1989 Greg Michaelson

Re: Formal design spec into Haskell or Miranda

m Software Engineering Journal called something like "Executions are not (always) executable" to discover why persons of good taste in the formal community will no longer speak to you if you take this any further... Greg Michaelson

Re: Pattern guards

id this difficulty with functions like g2... Why does the Haskell community have such an antipathy to if...then...else...? Tony said that choice of construct is a matter of personal style. Nonetheless, I think that this whole debate crystalises a consensus that guards are prefereable to conditional expressions. Greg Michaelson

Re: A new view of guards

list comprehension + fold I can appreciate that the declunkification transformation simplifies a common problem but the cost seems to be yet another way of writing a for loop... Are there any style guidelines for when to use what? Greg Michaelson

Function values

ally acceptable. Other people in this list and in email to me have said that this is something they'd like. So, perhaps implementors might consider providing function value display in future systems? Greg Michaelson

Do functions exist?

ss objects - full orthogonality doesn't stretch to printing functions. And we call this functional programming? Greg Michaelson

Denotation & operation

John, why does your argument not hold for INPUT function representations as well as OUTPUT function representations? Consider the "identity" interpreter: interpret program == program interpret : string -> string Presumably this preserves meaning. So why is it that the "lambda x.x" in the c

Function denotations

easy to reverse engineer. Similarly, reconstructing lambda calculus from SECD machine configurations is straightforward. If we can establish that printable function representations are not heretical :-) would other people find them useful? Greg Michaelson

Function denotations

unctions is non-trivial. However, there are big benefits in easing debugging by allowing tracing of function applications, especially "partial application" of higher order functions. Function representations coupled with regular types would also enable Haskell to be used in teaching pu

recursive types

pdate functions. I don't think the direct Haskell equivalents can be typed by current systems? I don't think that there are typeable Haskell equivalents without using layers of concrete datatypes? Greg Michaelson