January 2003 - Haskell

Re: Field labels must be globally unique?
by cwitty＠newtonlabs.com 15 Jan '03

15 Jan '03

"Marc Ziegert" <coeus(a)gmx.de> writes: > --------------------It would be nice to be able to overload class-functions like classes: > > instance (+), (-) -> Vector where > (+) v1 v2 = ... > (-) v1 v2 = ... > > --------------------instead of overloading parts of a class... (because of runtime-errors!) This seems related to "System CT" (http://www.dcc.ufmg.br/~camarao/CT/) In System CT, everything is (potentially) overloaded, and you don't have explicit type classes. Carl Witty cwitty(a)newtonlabs.com

1 0

Tony Davie
by Kevin Hammond 15 Jan '03

15 Jan '03

Dear Haskell list member, It is with regret that I must inform you of the death of Tony Davie, who passed away on Wednesday, January 9th following a long-standing battle with leukemia. Many of you who came into contact with him will have been impressed by his in-depth understanding of his subject, by his interesting research talks, and by his sense of humour. Tony wrote the first book on Haskell, "An Introduction to Functional Programming Systems using Haskell", worked on functional persistent systems, and designed the CASE abstract machine, as well as being a major contributor to early SASL implementations here at St Andrews. In many ways, he was a true functional programming pioneer. I am sure you will back my action in expressing the condolences of the entire international community to Tony's family. Kevin

2 1

RE: Evaluation Question
by Simon Marlow 15 Jan '03

15 Jan '03

> For each call, I believe. An exception might be if the call to nco is > inlined into the calling function, but this is unlikely as nco is > recursive. > > So, you're probably better off with: > > > nco wn = nco' > > where wn' = cis wn > > nco' = 1 : map (wn'*) nco' > > In which case it will only be evaluated once. The original version should also evaluate the expression 'cis wn' only once: > nco :: RealFloat a => a -> [ Complex a ] > nco wn = 1 : map ((*) (cis wn)) (nco wn) You can verify this using an appropriate semantics for lazy evaluation. However, another way to think about it is to consider the expression (*) (cis wn) as (let x = cis wn in (*) x) which when first evaluated will create a suspension for x in the heap, and return \y -> (*) y x as its value. So x only gets allocated/evaluated once. Cheers, Simon

2 1

type fine until you try to use it
by Abraham Egnor 15 Jan '03

15 Jan '03

In a project I'm working on, one data type I've defined is this: data FilterIS = FilterIS { source :: (InputStream s) => s, filter :: Filter } which, to me, just means it holds any instance of the InputStream class and a Filter value. Sure, says ghci, fine by me. However, if I try to do anything with that datatype, even something as simple as newFilterIS = FilterIS I get the following error, or something very like it: Stream.hs:96: Inferred type is less polymorphic than expected Quantified type variable `s' escapes Expected type: s -> t Inferred type: (forall s1. (InputStream s1) => s1) -> (forall fs. (InputStream fs) => fs -> IO Word8) -> FilterIS In the definition of `newFilterIS': FilterIS I've gotten used to having to spend a while figuring out what error messages mean, but it bugs me that there seems to be some problem with the type that's "brought out" by just making a synonym for the constructor. I know there's nothing wrong with the line where I define a synonym; there's practically nothing there to *be* wrong, so the problem has to be in the type... and yet the compiler didn't catch it until I added that synonym line. What's up? Abe

2 1

WRS 2003 - First Call for Papers
by Salvador Lucas 13 Jan '03

13 Jan '03

****************************************************************** *********** first call for papers and participation *********** ****************************************************************** Third International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) http://www.dsic.upv.es/~rdp03/wrs part of the Federated Conference on Rewriting, Deduction and Programming (RDP 2003) Valencia, Spain, June 8, 2003 ------------------------------------------------------------------ BACKGROUND AND AIMS Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting / computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages. Therefore any progress in this area is likely to be of interest not only to the rewriting community, but also to neighbouring fields like functional programming, functional-logic programming, and termination proofs of algorithms. The workshop wants to provide a forum for the presentation and discussion of new ideas and results, recent developments, new research directions, as well as of surveys on existing knowledge in this area. Furthermore we aim at fostering interaction and exchange between researchers and students actively working on such topics. The workshop is part of the Federated Conference on Rewriting, Deduction and Programming (RDP 2003) to be held in Valencia (Spain) on June 8, 2003. The workshop is (co-)organized by TU Valencia and TU Wien. TOPICS OF INTEREST Topics of interest include, but are not restricted to: - theoretical foundations for the definition and semantic description of reduction strategies - strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting and explicit substitutions, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages) - properties of reduction strategies / computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness) - interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.) - program analysis and other semantics-based optimization techniques dealing with reduction strategies - rewrite systems / tools / implementations with flexible / programmable strategies as essential concept / ingredient - specification of reduction strategies in (real) languages - data structures and implementation techniques for reduction strategies. SUBMISSIONS We solicit papers on all aspects of reduction strategies in rewriting and programming. Submissions should describe unpublished work, except for survey papers which are explicitly welcome, too. Submissions should not exceed 10 pages (however, survey papers may be longer) and be sent in postscript format to the PC co-chairs at wrs03(a)logic.at before March 23, 2003. Submissions should include the title, authors' names, affiliations, addresses, and e-mail. Selection of papers by the PC will be based on originality, significance, and correctness. Final versions will be due by May 11, 2003. PUBLICATION Accepted papers will be included in the preliminary workshop proceedings that will be available at the workshop. The final workshop proceedings will be published in the Electronic Notes in Theoretical Computer Science (ENTCS) series of Elsevier. PROGRAM COMMITTEE Sergio Antoy Portland (USA) Zena M. Ariola Oregon (USA) Roberto Di Cosmo Paris VII (France) Juergen Giesl Aachen (Germany) Bernhard Gramlich (co-chair) Wien (Austria) Salvador Lucas (co-chair) Valencia (Spain) Aart Middeldorp Tsukuba (Japan) Ricardo Pe~na Madrid (Spain) Pierre Rety Orleans (France) Eelco Visser Utrecht (The Netherlands) ORGANIZERS Bernhard Gramlich Technische Universitaet Wien Salvador Lucas Universidad Politecnica de Valencia IMPORTANT DATES Deadline for submissions: March 23, 2003 Notification: April 25, 2003 Final version due: May 11, 2003 Workshop: June 8, 2003 FURTHER INFORMATION WRS 2003 website: http://www.dsic.upv.es/~rdp03/wrs WRS 2003 e-mail address: wrs03(a)logic.at RDP 2003 website: http://www.dsic.upv.es/~rdp03 ******************************************************************

1 0

WRS 2003 - First Call for Papers
by Salvador Lucas 13 Jan '03

13 Jan '03

****************************************************************** *********** first call for papers and participation *********** ****************************************************************** Third International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) http://www.dsic.upv.es/~rdp03/wrs part of the Federated Conference on Rewriting, Deduction and Programming (RDP 2003) Valencia, Spain, June 8, 2003 ------------------------------------------------------------------ BACKGROUND AND AIMS Reduction strategies in rewriting and programming have attracted an increasing attention within the last years. New types of reduction strategies have been invented and investigated, and new results on rewriting / computation under particular strategies have been obtained. Research in this field ranges from primarily theoretical questions about reduction strategies to very practical application and implementation issues. The need for a deeper understanding of reduction strategies in rewriting and programming, both in theory and practice, is obvious, since they bridge the gap between unrestricted general rewriting (computation) and (more deterministic) rewriting with particular strategies (programming). Moreover, reduction strategies provide a natural way to go from operational principles (e.g., graph and term rewriting, narrowing, lambda-calculus) and semantics (e.g., normalization, computation of values, infinitary normalization, head-normalization) to implementations of programming languages. Therefore any progress in this area is likely to be of interest not only to the rewriting community, but also to neighbouring fields like functional programming, functional-logic programming, and termination proofs of algorithms. The workshop wants to provide a forum for the presentation and discussion of new ideas and results, recent developments, new research directions, as well as of surveys on existing knowledge in this area. Furthermore we aim at fostering interaction and exchange between researchers and students actively working on such topics. The workshop is part of the Federated Conference on Rewriting, Deduction and Programming (RDP 2003) to be held in Valencia (Spain) on June 8, 2003. The workshop is (co-)organized by TU Valencia and TU Wien. TOPICS OF INTEREST Topics of interest include, but are not restricted to: - theoretical foundations for the definition and semantic description of reduction strategies - strategies in different frameworks (term rewriting, graph rewriting, infinitary rewriting, lambda calculi, higher order rewriting and explicit substitutions, conditional rewriting, rewriting with built-ins, narrowing, constraint solving, etc.) and their application in (equational, functional, functional-logic) programming (languages) - properties of reduction strategies / computations under strategies (e.g., completeness, computability, decidability, complexity, optimality, (hyper-)normalization, cofinality, fairness, perpetuality, context-freeness, neededness, laziness, eagerness, strictness) - interrelations, combinations and applications of reduction under different strategies (e.g., equivalence conditions for fundamental properties like termination and confluence, applications in modularity analysis, connections between strategies of different frameworks, etc.) - program analysis and other semantics-based optimization techniques dealing with reduction strategies - rewrite systems / tools / implementations with flexible / programmable strategies as essential concept / ingredient - specification of reduction strategies in (real) languages - data structures and implementation techniques for reduction strategies. SUBMISSIONS We solicit papers on all aspects of reduction strategies in rewriting and programming. Submissions should describe unpublished work, except for survey papers which are explicitly welcome, too. Submissions should not exceed 10 pages (however, survey papers may be longer) and be sent in postscript format to the PC co-chairs at wrs03(a)logic.at before March 23, 2003. Submissions should include the title, authors' names, affiliations, addresses, and e-mail. Selection of papers by the PC will be based on originality, significance, and correctness. Final versions will be due by May 11, 2003. PUBLICATION Accepted papers will be included in the preliminary workshop proceedings that will be available at the workshop. The final workshop proceedings will be published in the Electronic Notes in Theoretical Computer Science (ENTCS) series of Elsevier. PROGRAM COMMITTEE Sergio Antoy Portland (USA) Zena M. Ariola Oregon (USA) Roberto Di Cosmo Paris VII (France) Juergen Giesl Aachen (Germany) Bernhard Gramlich (co-chair) Wien (Austria) Salvador Lucas (co-chair) Valencia (Spain) Aart Middeldorp Tsukuba (Japan) Ricardo Pe~na Madrid (Spain) Pierre Rety Orleans (France) Eelco Visser Utrecht (The Netherlands) ORGANIZERS Bernhard Gramlich Technische Universitaet Wien Salvador Lucas Universidad Politecnica de Valencia IMPORTANT DATES Deadline for submissions: March 23, 2003 Notification: April 25, 2003 Final version due: May 11, 2003 Workshop: June 8, 2003 FURTHER INFORMATION WRS 2003 website: http://www.dsic.upv.es/~rdp03/wrs WRS 2003 e-mail address: wrs03(a)logic.at RDP 2003 website: http://www.dsic.upv.es/~rdp03 ******************************************************************

1 0

First APPSEM-II Workshop
by Graham Hutton 13 Jan '03

13 Jan '03

+---------------------------------------------------------------------+ FIRST ANNOUNCEMENT AND CALL FOR PARTICIPATION First APPSEM-II Workshop 26th - 28th March 2003 Nottingham, United Kingdom The first annual workshop of the IST working group APPSEM-II (Applied Semantics II) will be held at the University of Nottingham from 26-28 March 2003. All members of the working group are invited to attend, but participation of non-members from both academia and industry with interests in application-oriented programming language semantics is actively encouraged. The purpose of the workshop is to present new results and plan future work in each of the nine themes of the group: A - Program structuring: OO programming, modules (Didier Remy); B - Proof assistants, functional programming, and dependent types (Thierry Coquand); C - Program analysis, generation, and configuration (Neil Jones); D - Specification and verification methods (Uday Reddy); E - Types and type inference in programming (Fritz Henglein); F - Games, sequentiality, and abstract machines (Pierre-Louis Curien); G - Semantic methods for distributed computing (Glynn Winskel); H - Resource models and web data (Peter O'Hearn, Philippa Gardner); I - Continuous phenomena in Computer Science (Achim Jung). For each theme there will be a session of presentations, organised by the theme leader (in parentheses above). There will also be a number of invited presentations, an industrial panel session, a brainstorming session, and a business meeting. Following on from the workshop an informal proceedings will be published on the web. Further details regarding registration, accommodation, travel, etc will be available shortly. In the meantime, if you would like to attend the workshop, please email appsem03(a)cs.nott.ac.uk by FRIDAY 31ST JANUARY. If you would like to give a talk, please also include a title, short abstract (and paper if available), and a list of the themes to which it is relevant in order from most to least. Note that the fun of programming symposium in honour of Richard Bird's 60th birthday will be held in Oxford during the two days before the workshop, so participants may like to attend both events. Useful links: APPSEM-II working group: http://www.tcs.informatik.uni-muenchen.de/~mhofmann/appsem2/ First APPSEM-II workshop: http://www.cs.nott.ac.uk/~gmh/appsem03.html Fun of programming symposium: http://web.comlab.ox.ac.uk/oucl/research/areas/ap/fop/ Graham Hutton Workshop Organiser +---------------------------------------------------------------------+ | Dr Graham Hutton Email : gmh(a)cs.nott.ac.uk | | School of Computer Science and IT Web : www.cs.nott.ac.uk/~gmh | | University of Nottingham | | Jubilee Campus, Wollaton Road | | Nottingham NG8 1BB Phone : +44 (0)115 951 4220 | | United Kingdom Fax : +44 (0)115 951 4254 | +---------------------------------------------------------------------+

1 0

First APPSEM-II Workshop
by Graham Hutton 13 Jan '03

13 Jan '03

+---------------------------------------------------------------------+ FIRST ANNOUNCEMENT AND CALL FOR PARTICIPATION First APPSEM-II Workshop 26th - 28th March 2003 Nottingham, United Kingdom The first annual workshop of the IST working group APPSEM-II (Applied Semantics II) will be held at the University of Nottingham from 26-28 March 2003. All members of the working group are invited to attend, but participation of non-members from both academia and industry with interests in application-oriented programming language semantics is actively encouraged. The purpose of the workshop is to present new results and plan future work in each of the nine themes of the group: A - Program structuring: OO programming, modules (Didier Remy); B - Proof assistants, functional programming, and dependent types (Thierry Coquand); C - Program analysis, generation, and configuration (Neil Jones); D - Specification and verification methods (Uday Reddy); E - Types and type inference in programming (Fritz Henglein); F - Games, sequentiality, and abstract machines (Pierre-Louis Curien); G - Semantic methods for distributed computing (Glynn Winskel); H - Resource models and web data (Peter O'Hearn, Philippa Gardner); I - Continuous phenomena in Computer Science (Achim Jung). For each theme there will be a session of presentations, organised by the theme leader (in parentheses above). There will also be a number of invited presentations, an industrial panel session, a brainstorming session, and a business meeting. Following on from the workshop an informal proceedings will be published on the web. Further details regarding registration, accommodation, travel, etc will be available shortly. In the meantime, if you would like to attend the workshop, please email appsem03(a)cs.nott.ac.uk by FRIDAY 31ST JANUARY. If you would like to give a talk, please also include a title, short abstract (and paper if available), and a list of the themes to which it is relevant in order from most to least. Note that the fun of programming symposium in honour of Richard Bird's 60th birthday will be held in Oxford during the two days before the workshop, so participants may like to attend both events. Useful links: APPSEM-II working group: http://www.tcs.informatik.uni-muenchen.de/~mhofmann/appsem2/ First APPSEM-II workshop: http://www.cs.nott.ac.uk/~gmh/appsem03.html Fun of programming symposium: http://web.comlab.ox.ac.uk/oucl/research/areas/ap/fop/ Graham Hutton Workshop Organiser +---------------------------------------------------------------------+ | Dr Graham Hutton Email : gmh(a)cs.nott.ac.uk | | School of Computer Science and IT Web : www.cs.nott.ac.uk/~gmh | | University of Nottingham | | Jubilee Campus, Wollaton Road | | Nottingham NG8 1BB Phone : +44 (0)115 951 4220 | | United Kingdom Fax : +44 (0)115 951 4254 | +---------------------------------------------------------------------+

1 0

Field labels must be globally unique?
by Kim-Ee Yeoh 13 Jan '03

13 Jan '03

Dear Haskellers, Why can't field labels have the same name in different types? Here's some actual code on finite state automata I'm working on: > data BMC > = BMC { node :: !Int, > threshold :: !Float, > edge0 :: BMC, > edge1 :: BMC } > data BFSM > = BFSM { bfsmnode :: !Int, > bfsmstate :: Maybe Bool, > bfsmoutput :: [Bool], > bfsmedge0 :: BFSM, > bfsmedge1 :: BFSM } What I really want is to use the same field labels of node, edge0, and edge1 in the BFSM type, but I can't because otherwise I get the following in hugs: ERROR xxx - Repeated definition for selector "edge0" I'm not an expert on programming languages, but doesn't it seem that Haskell, as a strongly-typed language, should not have any problem distinguishing the field labels of different datatypes? Kim-Ee

6 7

Re: Evaluation Question
by Tom Pledger 13 Jan '03

13 Jan '03

Hal Daume III writes: : | So, you're probably better off with: | | > nco wn = nco' | > where wn' = cis wn | > nco' = 1 : map (wn'*) nco' | | In which case it will only be evaluated once. The following version also evaluates 'cis wn' only once. > nco wn = iterate (cis wn *) 1 I've only tested this in hugs with no command line flags, and can't explain the theory offhand. > import Complex() > import Trace > cis t = trace "\ncis\n" (Complex.cis t) > nco wn = iterate (cis wn *) 1 Main> take 5 (nco (pi/2)) [1.0 :+ 0.0, cis (-4.37114e-08) :+ 1.0,(-1.0) :+ (-8.74228e-08),1.31134e-07 :+ (-1.0),1.0 :+ 1.74846e-07] Regards, Tom

1 0