April 2003 - Haskell - Haskell.org

Curiosity
by Jon Fairbairn 09 Apr '03

09 Apr '03

Is there any reason why the list type is defined in the Report as data [a] = [] | a : [a] deriving (Eq, Ord) rather than data [a] = [] | (:) {head:: a, tail:: [a]} deriving (Eq, Ord) (which would shorten Prelude.List somewhat)? -- Jón Fairbairn Jon.Fairbairn(a)cl.cam.ac.uk 31 Chalmers Road jf(a)cl.cam.ac.uk Cambridge CB1 3SZ +44 1223 570179 (after 14:00 only, please!)

3 3

Fw: [HOpenGL] Haddock installation question
by Andre W B Furtado 09 Apr '03

09 Apr '03

I got the following error while trying to compile Haddock (./configure step): error: 'lex' or 'flex' is required to compile GHC >From where can I download 'lex' or 'flex'? Do they come with Cygwin/GHC installation packages? My config is: Windows XP under Cygwin, GHC-5.04.2 Thanks, -- Andre

2 1

CfP: ELSNET/ENABLER Resources Infrastructure Workshop at ACL2003
by Steven Krauwer 09 Apr '03

09 Apr '03

ACL2003 Resources Information Infrastructure Workshop _________________________________________________________________ Last CALL for PAPERS Towards a Resources Information Infrastructure Workshop at ACL2003 in Sapporo (Japan) July 11 and 12 2003 Organised by ENABLER / ELSNET Description The problem addressed by this workshop is the well-known information problem. People are creating, exploring and exploiting language resources all over the world. Those who are working with resources know a lot about their own and other resources, and they are generally prepared to share this knowledge, their expertise and in many cases even their resources with others via publications in journals, presentations at conferences, and via the web. Unfortunately this information, however public, is not accessible in any systematic way for those who need resources, who want to know what sort of resources exist, how resources should be annotated, which standards to adhere to, which tools to use, etc etc. We will call this problem the 'Resources Information Problem'. The problem has also a geographical dimension: As work on specific languages is very often concentrated in specific parts of the world, much relevant information has a tendency to stay in one geographical place. This is an obstacle for those who are working on these same languages in different parts of the world, and it makes it harder to port knowledge and expertise gained on one language to other languages. The above observation are far from novel, and it would be naive to think that the problems will ever go away. At the same time one can observe that there are organisations (associations, agencies, projects, networks, etc) that have access to parts or fragments of this information and that have their own infrastructures that facilitate access to this information by internal or external people. The purpose of this workshop is to investigate how we can exploit the existing infrastructures to a maximum in order to facilitate world-wide access to information on language resources. The role of the workshop will be to bootstrap this process. Approach * First of all we will try to make an initial map of the language resources landscape world-wide. This map will include actors, organisations, repositories, standards, projects, tool libraries, etc etc. All participants will be asked beforehand to submit pointers to such items. They will be collected and published. * At the workshop we will invite representatives of a number of organisations that can be seen as key actors in the field, and they will be asked to present ideas about the way their organisation could contribute to solving the Resources Information Problem. These ideas could range from very concrete and immediately implementable proposals to longer term and visionary actions. * A round table discussion at the workshop will aim at the creation of convergence, coherence and synergies between the proposed actions. The intended output is a catalogue of actions to facilitate access to resources information that could be implemented (almost) immediately, a skeleton plan for longer term actions, and firm commitment from key players to make these things happen. Target audience Representatives of parties that could play a key role in providing access to resources information, such as (but not limited to) * Resources distribution agencies, e.g. LDC and ELDA/ELRA * Professional organisations, e.g. ACL, ISCA, and their regional branches, e.g. EACL, AACL, JACL, Asian NLP federation * Networks and resources infrastructure projects, e.g. ENABLER, ISLE. ELSNET * Committees, e.g. ICWLR, COCOSDA * National resources or infrastructure projects, e.g. Technolangue, Collate * International actions, e.g. OLAC * Researchers and developers interested in improving the language resources infrastructure for our community Invited and submitted papers We expect to invite some 15 representatives to give their presentations, but in addition we are issuing an open call for papers addressing the resources information problem and possible solutions. These papers will be reviewed in the usual way. Submission format Please submit full papers of maximum 8 pages (including references, figures etc). Authors should follow the main conference ACL style format. Electronic submission only. Send the pdf, postscript, or MS Word form of your submission to: Steven Krauwer (steven.krauwer(a)elsnet.org) who will also answer any queries regarding the submission. Important Dates Submission deadline for workshop papers: 13 April 2003 Notification of accepted papers: 14 May 2003 Deadline for camera ready copies 29 May 2003 Workshop dates: 11-12 July 2003 Workshop Format It will be a two-day workshop, with invited and submitted presentations in the mornings, and topical panels and round table discussion in the afternoons, including an open meeting of the newly created International Coordination Committee for Written Language Resources. Programme Committee As this workshop is jointly organized by ELSNET and ENABLER (two EU funded projects aimed at providing collaboration infrastructures), we have invited all ca 60 members of the ELSNET and ENABLER Boards to constitute the core programme committee. We may want to invite additional members from Asia and other parts of the world in order to ensure sufficient geographical coverage. A full list of PC members will be published on the workshop website at http://www.elsnet.org/acl2003-workshop The workshop will be jointly chaired by Steven Krauwer (ELSNET) and Nicoletta Calzolari/Antonio Zampolli (ENABLER) Historical note This workshop can be seen as a follow-up of the workshop organised at ACL2000 in Hong Kong, entitled 'Towards infrastructures for global collaboration'. One of the conclusions of this workshop was that the field of language resources would offer good opportunities for collaborative actions, and the first concrete goal was the creation of an international resources federation, a first step towards which is now embodied by the proposal to set up an International Committee for Written Language Resources. The workshop should lead to the definition of concrete actions to be carried out under the auspices of ICWLR, in collaboration with other organisations. Contact info Steven Krauwer (steven.krauwer(a)elsnet.org) ELSNET (http://www.elsnet.org)

1 0

CHARME03 new sbm deadline
by Tronci Enrico 08 Apr '03

08 Apr '03

---------------------------------------------------------------------- We apologize if you receive multiple copies of this announcement. ---------------------------------------------------------------------- In response to many requests we extended CHARME 2003 sbm deadline. *********************************************************************** CHARME 2003 NEW SUBMISSION DEADLINE: April 21, 2003 *********************************************************************** CHARME 2003 The 12th Advanced Research Working Conference on: Correct Hardware Design and Verification Methods 21-24 October 2003, University of L'Aquila, L'Aquila, Italy http://www.di.univaq.it/charme2003 Co-sponsored by the IFIP TC10/WG10.5 Working Group on Design and Engineering of Electronic Systems CHARME 2003 is the twelfth in a series of working conferences devoted to the development and use of leading-edge formal techniques and tools for the design and verification of hardware and systems. It has been the aim of the conference to expand its interest to software as well when the technology is related. Previous conferences have been held in Darmstadt, Edinburgh, Grenoble, Glasgow, Leuven, Torino, Arles, Frankfurt, Montreal, and Bad Herrenalb, and Edinburgh. It is the biennial counterpart of FMCAD, which takes place every even year in the USA. The aim of CHARME 2003 is to bring together researchers and users from academia and industry working in this active area of research. The conference will cover original research results, case studies, use of technologies across application domains, and reports on practical experiments. Papers describing original work in all aspects of formal hardware and system design and verification methods are invited. Papers related to formal modeling and verification of concurrent software are also welcome. The event will be held 21-24 October 2003 and hosted by University of L'Aquila, Italy. L'Aquila can be easily reached from Rome Airport. Topics of interest include, but are not limited to: * usage of semi-formal methods (combining simulation methods with formal verification) * high level design modeling languages and high level design constructs * formal verification of hybrid systems * timing verification * formal methods for commercial hardware description languages * correctness preserving transformations * formal synthesis methods * use of theorem provers for verification * BDD and FSM based approaches, including model checking and SAT checking * correctness aspects in HW/SW co-design * abstraction and compositional techniques * formal verification of protocols * diagnosis of design errors * coverage directed verification and other semi-formal verification methods * use of formal specification languages in simulation * formal verification of concurrent software * practical and industrial applications of formal techniques The conference proceedings will appear as a volume in Springer-Verlag's Lecture Notes in Computer Science series and will be available at the conference. Papers should not exceed 15 pages, formatted as specified by Springer-Verlag in the Authors Instructions page, and submitted electronically following the procedure given on the submissions page of the conference website, http://www.di.univaq.it/charme2003. Selected contributions may be invited for publication in STTT (International Journal on Software Tools for Technology Transfer, Springer-Verlag). ****************************************************************************** Author's Schedule: * 11 April 2003 - Deadline for paper submission. Extended to: April 21, 2003 * 6 June 2003 - Notification of acceptance * 11 July 2003 - Deadline for final version ****************************************************************************** Chairs Enrico Tronci (conference chair) (University of Rome, Italy) Daniel Geist (programme chair) (IBM, Israel) ****************************************************************************** Programme Committee Alan Hu (University of British Columbia, Canada) Alan Mycroft (University of Cambridge, UK) Anna Slobodova (Intel, USA) Armin Biere (Swiss Federal Institute of Technology, Switzerland) Byron Cook (Microsoft Corporation, USA) Carl Pixley (Synopsys, USA) Daniel Geist (PC Chair) (IBM, Israel) Dominique Borrione (University of Grenoble, France) Eli Singerman (Intel, Israel) Enrico Tronci (Conference Chair) (University of Rome, Italy) Ganesh Gopalakrishnan (University of Utah, USA) Hans Eveking (T.U. Darmstadt, Germany) John O'Leary (Intel, USA) Ken McMillan (Cadence, USA) Laurence Pierre (University of Marseille, France) Limor Fix (Intel, Israel) Mark Aagaard (University of Waterloo, Canada) Mary Sheeran (Chalmers Univ. and Prover Technology, Sweden) Moshe Vardi (Rice University, USA) Ofer Strichman (Carnegie-Mellon University, USA) Steve Johnson (Indiana University, USA) Thomas Kropf (Bosch, Germany) Tiziana Margaria (Univ. of Dortmund and METAFrame Techn., Germany) Tom Melham (University of Oxford,UK) Warren Hunt (University of Texas at Austin, USA) ******************************************************************************

1 0

Announcing Pan#, version 0.1
by John Peterson 07 Apr '03

07 Apr '03

------------------------------------------- Announcing Pan#, Version 0.1 ------------------------------------------- Pan is a language of interactive, functional images developed by Conal Elliott, Oege de Moor, and Sigbjorn Finne. We have built a new front and back end for the original Pan compiler to create Pan#, a stand alone system that does not require any other Haskell compiler. Pan# uses the Microsoft .NET system to compile and run the generated programs. Pan# contains its own interpreter for a small, Haskell-like language. We have simplified and extended the Haskell language somewhat but retains the core semantic basis of Haskell. This release is part of a larger effort to use functional languages and programming language principles to design new languages for educational use (http://haskell.org/edsl) Pan# has been used as a mathematical visualization language and we have developed a number of high school algebra lessons that use Pan# to create interactive visualizations which illustrate mathematical principles. Try out Pan# if you're interested in functional graphics or would like a simple language that demonstrates the power of functional programming in a new and interesting way. This is a preliminary release - it has not been extensively tested and some aspects of the system have not been implemented or are in poor shape. Pan# is easy to install and use. You can get Pan# at http://haskell.org/edsl/pansharp.html Requirements: - Windows 2000 or XP - The .NET framework (available through Microsoft Update) We would like to thank Microsoft Research for thier support of this project. John Peterson Yale Haskell Project

1 0

CFP: DALT'03 - 1st Workshop on Declarative Agent Languages and Technologies
by João Alexandre Leite 07 Apr '03

07 Apr '03

=========================================================== F I N A L C A L L F O R P A P E R S DALT 2003 First International Workshop on Declarative Agent Languages and Technologies Melbourne, Australia July 15th 2003 http://centria.di.fct.unl.pt/~jleite/dalt03/index.htm In conjunction with AAMAS 2003 2nd International Conference on Autonomous Agents and Multi-Agent Systems http://www.aamas-conference.org/ Submission: 11 of April, 2003 Post-Proceedings published by Springer-Verlag (LNAI) =========================================================== TECHNICAL DESCRIPTION Agent metaphors and technologies are ever more adopted to harness and govern the complexity of today's systems. As a consequence, the growing complexity of agent systems calls for models and technologies that promote system predictability, and enable feature discovery and verification. Recent advances in the area of logics and formal methods make declarative languages and technologies a mostly promising approach to the modeling and engineering of complex agent systems. DALT aims at fostering a discussion forum to export, on the one hand, such techniques into the broader community of agent researchers and practitioners and, on the other hand, to bring in the issues of real-world, complex, and possibly large-scale agent system design in the perspective of formal methods and declarative technologies. DALT 2003 will take place in Melbourne, Australia, in conjunction with AAMAS, the 2nd International Conference on Autonomous Agents and Multi-Agent Systems. Topics of interest include, but are not limited to: * Declarative agent communication and coordination languages * Knowledge-based and knowledge-intensive MAS * Modeling of agent rationality * Declarative approaches to the engineering of MAS * High level agent specification languages * Practical aspects of declarative agent programming and implementation * Formal methods for the specification and verification of MAS * Computational logics in MAS * Argumentation and dialectical systems in MAS * Declarative description of contracts and negotiation issues in MAS * Lessons learned from the design and implementation of MAS * Declarative paradigms for the combination of heterogeneous agents * Constraints and MAS * Declarative representation of policies and security in MAS SUBMISSIONS We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere. Papers should be written in English, formatted according to the Springer LNCS style, which can be obtained at (http://www.springer.de/comp/lncs/authors.html) and not exceed 16 pages including figures, references, etc. Send your paper in PostScript (PS) or Portable Document Format (PDF) to jleite(a)di.fct.unl.pt. IMPORTANT DATES * Submission, 11 of April, 2003 * Notification, 6 of May, 2003 * Camera Ready, 16 of May, 2003 PROCEEDINGS To encourage and promote the discussion, early and final versions of the accepted papers will be available online, at the workshop's web page, as soon as they are available. A printed volume with the proceedings will be available at the workshop. Authors of papers presented at the workshop will be asked to extend their contributions, possibly incorporating the results of the workshop discussion, to be included in the workshop post-proceedings. Post-proceedings will be published by Springer-Verlag as a volume of the Lecture Notes on Artificial Intelligence series (http://www.springer.de/comp/lncs/index.html) PROGRAM COMMITTEE Rafael Bordini, The University of Liverpool, UK Jeff Bradshaw, The University of West Florida, FL, USA Antonio Brogi, Università di Pisa, Italy Stefania Costantini, Università degli Studi di L'Aquila, Italy Yves Demazeau, Institut IMAG, Grenoble, France Jürgen Dix, The University of Manchester, UK Toru Ishida, Kyoto University, Japan Catholijn Jonker, Vrije Universiteit Amsterdam, The Netherlands Antonis Kakas, University of Cyprus, Cyprus Daniel Kudenko, University of York, UK Alessio Lomuscio, King's College, London, UK Viviana Mascardi, DISI, Genova, Italy Paola Mello, Università di Bologna, Italy John Jules Ch. Meyer, Universiteit Utrecht, The Netherlands Charles L. Ortiz, SRI International, Menlo Park, CA, USA Sascha Ossowski, Universidad Rey Juan Carlos, Madrid, Spain Luís Moniz Pereira, Universidade Nova de Lisboa, Portugal Jeremy Pitt, Imperial College, London, UK Ken Satoh, National Institute of Informatics, Tokyo, Japan Michael Schroeder, City University, London, UK Onn Shehory, IBM Research Lab in Haifa, Israel Carles Sierra, Spanish Research Council, Barcelona, Spain V.S. Subrahmanian, University of Maryland, MD, USA Francesca Toni, Imperial College, London, UK Wiebe van der Hoek, The University of Liverpool, UK Franco Zambonelli, Università di Modena, Italy ORGANIZING COMMITTEE Co-chairs: João Alexandre Leite (Contact Person) Universidade Nova de Lisboa jleite(a)di.fct.unl.pt Andrea Omicini Università di Bologna aomicini(a)deis.unibo.it Leon Sterling The University of Melbourne leon(a)cs.mu.oz.au Paolo Torroni Università di Bologna ptorroni(a)deis.unibo.it

1 0

Haskell Workshop 2003
by Johan Jeuring 07 Apr '03

07 Apr '03

Now that the deadline for ICFP has passed, please consider submitting a paper to the Haskell Workshop 2003! ACM SIGPLAN 2003 Haskell Workshop Uppsala, Sweden, August 28, 2003 http://www.functional-programming.org/HaskellWorkshop/cfp03.html Call For Papers The Haskell Workshop forms part of the PLI 2003 colloquium on Principles, Logics, and Implementations of high-level programming languages, which comprises the ICFP and PPDP conferences as well as associated workshops. Previous Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), Montreal (2000), Firenze (2001), and Pittsburgh (2002). ********************* Deadlines ********************* Deadline for submission: May 22, 2003 Notification of acceptance: June 23, 2003 Final submission due: July 3, 2003 Haskell Workshop: August 28, 2003 ********************* Topics ********************* The purpose of the Haskell Workshop is to discuss experience with Haskell, and possible future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to, the following: Language Design with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; Theory in the form of a formal treatment of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; Implementation Techniques including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; Tool Support in the form of profilers, tracers, debuggers, pre-processors, and so forth; Applications, Practice, and Experience with Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth as well as general experience with Haskell in education and industry; Functional Pearls being elegant, instructive examples of using Haskell. Following the scheme adopted by ICFP 2003, papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! ********************* Submissions ********************* Authors should submit papers in postscript format, formatted for A4 paper, to Johan Jeuring johanj(a)cs.uu.nl by 22th May 2003. The length should be restricted to the equivalent of 5000 words (which is approximately 12 pages in ACM format). Accepted papers will be available in the form of a technical report of the Utrecht University or an equivalent format in time for the workshop. In addition, the papers will be published by the ACM and will appear in the ACM Digital Library. If there is sufficient demand, we will try to organise facilities for system demonstrations during lunch and coffee breaks. If you are interested in demonstrating an application or tool written in Haskell, please contact Johan Jeuring (johanj(a)cs.uu.nl) ********************* Programme Committee ********************* Magnus Carlsson OGI Olaf Chitil University of York Ralf Hinze University of Bonn Johan Jeuring (chair) Utrecht University Jan-Willem Maessen MIT Henrik Nilsson Yale University Simon Peyton Jones Microsoft Research Claus Reinke University of Kent

1 0

RE: newbie Q: [a] -> [[a]]
by Markus.Schnell＠infineon.com 07 Apr '03

07 Apr '03

(1) Have a look at take (2) Have a look at break and span > -----Original Message----- > From: Vardhan Varma [mailto:vardhan@cadence.com] > Sent: Monday, April 07, 2003 5:31 AM > To: haskell(a)haskell.org > Subject: newbie Q: [a] -> [[a]] > > > > Hello, > Please help me with this: > I'm absolute newbie in Haskell, > I hope I'm posting to right forum. > > (1) For "abcdefgh" -> ["ab","cd","ef"] > I figured this out: > foo (x:y:z) = ( (x:y) :(foo z)) > Now how generalize this to club 'n' chars instead of two ? > 3 -> "abcdefgh" -> ["abc","def","gh"] > i.e. n -> [Char] -> [ [Char] ] -- all except last element > have length == n > > (2) My original problem is of splitting by markers. > "a<b>cd<efg>hi" -> [ "a" , "b", "cd", "efg", "hi" ] > I'm at total loss on how to do it. > Any pointer will be appreciated. > > --TIA > --Vardhan > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell >

2 1

newbie Q: [a] -> [[a]]
by Vardhan Varma 07 Apr '03

07 Apr '03

Hello, Please help me with this: I'm absolute newbie in Haskell, I hope I'm posting to right forum. (1) For "abcdefgh" -> ["ab","cd","ef"] I figured this out: foo (x:y:z) = ( (x:y) :(foo z)) Now how generalize this to club 'n' chars instead of two ? 3 -> "abcdefgh" -> ["abc","def","gh"] i.e. n -> [Char] -> [ [Char] ] -- all except last element have length == n (2) My original problem is of splitting by markers. "a<b>cd<efg>hi" -> [ "a" , "b", "cd", "efg", "hi" ] I'm at total loss on how to do it. Any pointer will be appreciated. --TIA --Vardhan

1 0

Bits Problem
by Dominic Steinitz 06 Apr '03

06 Apr '03

Can anyone explain this? Hugs doesn't complain. Prelude> :set --version The Glorious Glasgow Haskell Compilation System, version 5.04.1 test.hs:5: No instance for (Num Bool) arising from the instance declaration at test.hs:5 In the instance declaration for `Bits Bool' module Main(main) where import Bits instance Bits Bool where complement False = True complement True = False Dominic Steinitz

3 3