December 2004 - Haskell

Haskell-mode 2.0
by Stefan Monnier 02 Feb '09

02 Feb '09

I have recently taken over maintainership of Haskell-mode, and after making a bunch of changes, I figured it would be a good idea to make a new release. You can find this new release at: http://www-perso.iro.umontreal.ca/~monnier/elisp/ If you think it should also be found at http://www.haskell.org/haskell-mode/, then please tell John Peterson to get back to me (my email to him seem to go straight to the bitbucket. John?). This release has several changes that have all been only lightly tested, especially w.r.t compatibility with various Emacsen. See appended the NEWS file that describes some of the notewirthy changes. Stefan Changes since 1.45: * keybindings C-c <char> have been replaced by C-c C-<char> so as not to collide with minor modes. * The following modules are now automatically activated without having to add anything to haskell-mode-hook: haskell-font-lock (just turn on global-font-lock-mode). haskell-decl-scan (just bind `imenu' to some key). * In recent Emacsen, haskell-doc hooks into eldoc-mode. * haskell-hugs and haskell-ghci are superceded by inf-haskell. * Indentation rules have been improved when using layout inside parens/braces. * Symbols like -> and \ can be displayed as actual arrows and lambdas. See haskell-font-lock-symbols. * Tweaks to the font-lock settings. Among other things paren-matching with things like \(x,y) should work correctly now. * New maintainer <monnier(a)gnu.org>.

3 6

Mixing monadic and non-monadic functions
by Sean E. Russell 17 Sep '05

17 Sep '05

Hello, I posted this question to comp.lang.functional, and someone suggested that I try this group instead. I'm struggling with monads. Well, not monads themselves, but mixing them with non-monadic functions. Here's my base case: someFunc :: String -> IO [a] ... ax <- someFunc a bx <- someFunc b assertBool "fail" $ length ax == length bx I don't like the assignments; the typing is redundant, if I have a lot of asserts like this, and the "variables" are temporary. What I'd much rather have is: ... assertBool "fail" $ (length $ someFunc a) == (length $ someFunc b) which is more readable, to my eye. The only solution which has been suggested that may work is liberal use of the liftM variants, but this gets *really* tedious and obtuse. Is there an elegant way to do what I want to do, or am I stuck with procedural-style assignments and bunches of temp vars? Thanks! -- ### SER ### Deutsch|Esperanto|Francaise|Linux|XML|Java|Ruby|Aikido ### http://www.germane-software.com/~ser jabber.com:ser ICQ:83578737 ### GPG: http://www.germane-software.com/~ser/Security/ser_public.gpg

23 37

WS-FM 2004 Call For Participation
by Mario Bravetti 20 Jul '05

20 Jul '05

---------------------------------------------------------------------- We apologize if you receive multiple copies of this announcement. ---------------------------------------------------------------------- ====================================================================== 1st International Workshop on Web Services and Formal Methods (WS-FM 2004) February 23-24, 2004, Pisa, Italy Workshop affiliated to COORDINATION 2004, February 24-27, 2004 WS-FM 2004 homepage: http://www.cs.unibo.it/~lucchi/ws-fm04/ ====================================================================== - The technical program is available at: http://www.cs.unibo.it/~lucchi/ws-fm04/ - Information about registration, travel and accomodation can be found at the COORDINATION 2004 web site: http://www.di.unipi.it/Coordination2004/ If you intend to participate, we recommend you to register and book the hotel as soon as possible. The Coordination 2004 Organizing Committee informed us that hotels are going to be fully booked in short time.

1 1

ICALP'05: Call for Papers
by Luis Caires 13 May '05

13 May '05

___________________________________________________________________ CALL FOR PAPERS - ICALP'05 32nd International Colloquium on Automata, Languages and Programming July 11-15, 2005, Lisboa, Portugal http://icalp05.di.fct.unl.pt/ ___________________________________________________________________ The 32nd International Colloquium on Automata, Languages and Programming, the main conference and annual meeting of the European Association for Theoretical Computer Science EATCS will take place from the 11th to the 15th of July 2005 in Lisboa, Portugal. As a complement to the established Tracks on Algorithms, Automata, Complexity and Games (A), and on Logic, Semantics, and Theory of Programming (B), corresponding to the two main streams of the journal Theoretical Computer Science, ICALP'05 innovates on the structure of its traditional scientific program with the inauguration of a new special Track (C). The aim of Track C is to allow a deeper coverage of a particular topic, to be specifically selected for each year's edition of ICALP on the basis of its timeliness and relevance for the theoretical computer science community. Papers presenting original research on all aspects of theoretical computer science are sought. Typical but not exclusive topics of interest are: Track A (Algorithms, Automata, Complexity and Games): Giuseppe F. Italiano Università di Roma "Tor Vergata", Italy (PC Chair) * Algorithmic Aspects of Networks * Algorithms and Data Structures * Automata Theory and Formal Languages * Combinatorics in Computer Science * Computational Biology * Computational Complexity * Computational Geometry * Internet Algorithmics * Machine Learning * Parallel and Distributed Computing * Quantum Computing Track B (Logic, Semantics, and Theory of Programming): Catuscia Palamidessi INRIA Futurs and LIX, France (PC Chair) * Algebraic and Categorical Models * Databases, Semi-Structured Data and Finite Model Theory * Principles of Programming Languages * Logics, Formal Methods and Model Checking * Models of Concurrent, Distributed, and Mobile Systems * Models of Reactive, Hybrid and Stochastic Systems * Program Analysis and Transformation * Specification, Refinement and Verification * Type Systems and Typed Calculi Track C (Security and Cryptography Foundations): Moti Yung Columbia University, USA (PC Chair) * Cryptographic Notions, Mechanisms, Systems and Protocols * Cryptographic Proof Techniques, Lower bounds, Impossibilities * Foundations of Secure Systems and Architectures * Logic and Semantics of Security Protocols * Number Theory and Algebraic Algorithms in Cryptography * Pseudorandomness, Randomness, and Complexity Issues * Secure Data Structures, Storage, Databases and Content * Security Modeling: Combinatorics, Graphs, Games, Economics * Specifications, Verifications and Secure Programming * Theory of Privacy and Anonymity * Theory of Security in Networks and Distributed Computing * Quantum Cryptography and Information Theory SUBMISSIONS: ************ Authors are invited to submit an extended abstract of no more than 12 pages in LNCS style presenting original research on the theory of Computer Science. Submissions should indicate to which track (A, B, or C) the paper is submitted. No simultaneous submission to other publication outlets (either a conference or a journal) is allowed. The proceedings will be published in the Lecture Notes in Computer Science Series by Springer-Verlag. IMPORTANT DATES: **************** Workshop proposals due: November 28, 2004 Submissions: February 13, 2005 Notification: April 8, 2005 Final version due: April 30, 2005 PROGRAM COMMITTEE: ****************** Track A (Algorithms, Automata, Complexity and Games) * Lars Arge, Duke University, USA * Giorgio Ausiello, University of Rome "La Sapienza", Italy * Surender Baswana, Max-Planck-Institut fur Informatik, Saarbrucken, Germany * Hans Bodlaender, University of Utrecht, The Netherlands * Véronique Bruyère, University of Mons-Hainaut, Belgium * Adam Buchsbaum, AT&T Labs - Research, USA * Josep Diaz, Universitat Politecnica de Catalunya, Spain * David Eppstein, University of Irvine, USA * Andrew Goldberg, Microsoft, USA * Monika Henzinger, ETH Lausanne, Switzerland * Giuseppe F. Italiano, University of Rome "Tor Vergata", Italy (Chair) * Marios Mavronicolas, University of Cyprus, Cyprus * Peter Bro Miltersen, University of Aarhus, Denmark * Mike Paterson, University of Warwick, United Kingdom * Dominique Perrin, Université de Marne la Vallée, France * Seth Pettie, Max-Planck-Institut fur Informatik, Saarbrucken, Germany * Yuval Rabani, Technion, Israel * Antonio Restivo, University of Palermo, Italy * José Rolim, University of Geneva, Switzerland * Dorothea Wagner, University Karlsruhe, Germany * Tandy Warnow, University of Texas at Austin, USA * Christos Zaroliagis, CTI and University of Patras, Greece Track B (Logic, Semantics, and Theory of Programming) * Kenichi Asai, University of Ochanomizu, Japan * Joos Baeten, University of Eindhoven, NL * Peter Buneman, University of Edinburgh, UK * Zoltan Esik, University of Szeged, Hungary * Javier Esparza, University of Stuttgart, Germany * Marcelo Fiore, Christ's College and University of Cambridge, UK * Manuel Hermenegildo, Universidade de Madrid, Spain * Delia Kesner, Universite Paris VII, France * Kim Guldstrand Larsen, University of Aalborg , Denmark * Gopalan Nadathur, University of Minnesota, USA * Uwe Nestmann, EPFL, Switzerland * Catuscia Palamidessi, INRIA, France (Chair) * Amr Sabry, University of Indiana, USA * Davide Sangiorgi, Universita di Bologna, Italy * Roberto Segala, Universita di Verona, Italy * Harald Sondergaard, University of Melbourne, Australia Track C (Security and Cryptography Foundations) * David Basin, ETH Zurich, Switzerland * Christian Cachin, IBM Research, Switzerland * Alfredo De Santis, Universita di Salerno, Italy * Cynthia Dwork, Microsoft Research, USA * Matt Franklin, U.C. Davis, USA * Michael Goodrich, U.C. Irvine, USA * Andrew D. Gordon, Microsoft Research, UK * Roberto Gorrieri, Universita di Bologna, Italy * Yuval Ishai, Technion, Israel * Phil McKenzie, DoCoMo Labs., USA * Tatsuaki Okamoto, NTT Labs., Japan * David Pointcheval, ENS Paris, France * Tal Rabin, IBM Research, USA * Omer Reingold, IAS Princeton, USA * Adi Rosen, Technion, Israel * Amit Sahai, UCLA, USA * Andre Scedrov, University of Pennsylvania, USA * Igor Shparlinsky, Macquarie University, Australia * Nigel Smart, University of Bristol, UK * Moti Yung, Columbia University, USA (Chair) ORGANIZING COMMITTEE: ********************* Luis Monteiro Luis Caires Antonio Ravara Vasco Vasconcelos CONTACT ADDRESSES: ****************** For further information see: http://icalp05.di.fct.unl.pt/

1 2

Hierarchical module namespace extension not sufficiently flexible
by Duncan Coutts 07 Mar '05

07 Mar '05

All, So here's the problem: we have a binding to a large foreign library (GTK) which we are trying to fit nicely into hierarchical module name space. It would live under Graphics.UI.Gtk Graphics.UI.Gtk.Button Graphics.UI.Gtk.Frame ... etc Now there are over 100 modules directly under Graphics.UI.Gtk and you don't want to have to import each one of them separately. Of course you will not use all of them in one module but you might reasonably use 20+ of them. So it'd be nice to be able to say: > import Graphics.UI.Gtk or > import qualified Graphics.UI.Gtk as Gtk But now we have a problem. These import directives import a flat namespace, or a flat namespace qualified by a single module alias (ie Gtk in the second example). But the Gtk modules are deliberatly designed to have hierarchical names. You cannot simply combine them all together into a flat namespace without falling back to the trick of prefixing each function name with the module name. So while we would like to be able for users to do this: > import Graphics.UI.Gtk > > ... Button.setLabel ... They will instead have to say: > import Graphics.UI.Gtk > > ... buttonSetLabel ... Which is one of the things that the hierarchical module namespace extension was trying to get rid of! All the other language bindings for Gtk (apart from C) use the former import and useage style. It doesn't make us look good! :-) So my question is: have I overlooked something or is this really not possible at the moment. And secondly, if it is currently not possible is there a 'nice' extension that would allow this sort of thing. (Where nice probably means Haskell98 compatible / 'doesn't' break existing programs) How about: > module Graphics.UI.Gtk ( > > module qualified Graphics.UI.Gtk.Button as Button > ... > ) where > > import Graphics.UI.Gtk.Button or equivalently(?): > module Graphics.UI.Gtk ( > > module qualified Button > ... > ) where > > import Graphics.UI.Gtk.Button as Button Duncan Ps there's a oddity I found where if you say: > module Foo ( > module Bar > ) > > import qualified Bar then module Foo exports precisely nothing. But there's no error or warning.

8 12

WRS05: Second Call For Papers
by Roberto Di Cosmo 28 Dec '04

28 Dec '04

********************************************************************** 5th Int'l Workshop on Reduction Strategies in Rewriting and Programming WRS'05 Nara, Japan, April 22nd, 2005 Second Call For Submissions ********************************************************************** 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. Information on the previous, and forthcoming, WRS editions is available from the WRS permanent homepage. TOPICS 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). Please, send a message containing the title, authors, and abstract of your submission before January 21, 2005 to the PC co-chairs at wrs05(a)pps.jussieu.fr The full version of your submission should be sent in postscript or PDF format before January 31, 2005. 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 March 18, 2005. PUBLICATION Accepted papers will be included in the preliminary workshop proceedings that will be available at the workshop. Selected papers will be published in the Electronic Notes in Theoretical Computer Science (ENTCS) series of Elsevier. IMPORTANT DATES January 21, 2005 Deadline for electronic submission of abstracts January 31, 2005 Deadline for electronic submission of papers February 25, 2005 Notification of acceptance of papers March 18, 2005 Deadline for final versions of accepted papers April 22, 2005 Workshop INVITED SPEAKERS * Kokichi Futatsugi (JAIST, Japan) * Hongwei Xi (Boston University, USA) PROGRAM COMMITTEE * Sergio Antoy (Portland) * Eduardo Bonelli (Stevens) * Roberto Di Cosmo (Paris VII, Co-Chair) * Bernhard Gramlich (Wien) * Stefano Guerrini (Roma) * Salvador Lucas (Valencia) * Aart Middeldorp (Innsbruck) * Yoshihito Toyama (Tohoku, Co-Chair) PROGRAM CO-CHAIRS Roberto Di Cosmo Laboratoire PPS - Universite Paris 7, France Email: roberto(a)dicosmo.org Yoshihito Toyama Tohoku University, Japan Email: toyama(a)nue.riec.tohoku.ac.jp FURTHER INFORMATION * Call for papers in Text, PostScript and PDF format * WRS permanent website: http://www.dsic.upv.es/~wrs * WRS 2005 e-mail address: wrs05(a)pps.jussieu.fr * RDP 2005 website: http://www.kurims.kyoto-u.ac.jp/rdp05/

1 0

CFP APLAS'05
by Kwangkeun Yi 28 Dec '04

28 Dec '04

[apologies if you receive this CFP multiple times] ------------------------------------------------------------------------------- CALL FOR PAPERS The Third Asian Symposium on Programming Languages and Systems (APLAS 2005) November 3-5, 2005 Tsukuba, Japan Submission deadline: 10 June, 2005 http://ropas.snu.ac.kr/aplas05 APLAS seeks original papers on all topics of programming languages and systems. APLAS aims at stimulating programming language research by providing an international forum for the presentation of original results and the exchange of ideas and experience. The APLAS series is sponsored by the Asian Association for Foundation of Software (AAFS), which has been founded by Asian researchers in cooperation with many researchers from Europe and the USA. The first two formal APLAS symposiums were successfully held in Taipei (2004, Taiwan) and Beijing (2003, China) after three informal workshops held in Shanghai (2002, China), Daejeon (2001, Korea) and Singapore (2000). TOPICS The symposium is devoted to all topics ranging from foundational to practical issues in programming languages and systems. Submissions are invited on, but not limited to, the following topics: * semantics, logics, foundational theory * type systems, language design * program analysis, optimization, transformation * software security, safety, verification * compiler systems, interpreters, abstract machines * domain-specific languages and systems * programming tools and environments for embedded and mobile codes PROGRAM APLAS technical program consists of paper presentations, invited talks, and a dedicated session for posters. During the poster session students and professionals can present their works-in-progress or very recent results and can get feedback from other colleagues. Before the symposium, all the poster authors are asked to read other posters' abstracts and give feedbacks beforehand. IMPORTANT DATES Paper Abstract & title: 28 May, 2005 Full paper submission: 10 Jun, 2005 Author notification: 05 Aug, 2005 Camera-ready copy: 26 Aug, 2005 Poster Abstract & title: 16 Sep, 2005 Feedback: 07 Oct, 2005 SUBMISSIONS INFORMATION - All submissions be submitted electronically online via the symposium web page http://ropas.snu.ac.kr/aplas05. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. - Paper or poster abstract submissions should not exceed 300 words. - Paper submissions should not exceed 15 pages in LNCS format, excluding bibliography and figures. - Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should clearly identify what has been accomplished and why it is significant. - The work described should not have been previously published in a journal and conference proceedings. Authors must indicate if a closely related paper is also being considered for another conference or journal. - The proceedings of the symposium (papers and invited talks) will be published by Springer-Verlag's Lecture Notes in Computer Science series. GENERAL CHAIR Tetsu Ida (U. of Tsukuba, Japan) tetsuo.ida(a)acm.org PROGRAM CHAIR Kwangkeun Yi (Seoul National U., Korea) kwang(a)ropas.snu.ac.kr PROGRAM COMMITTEE Radhia Cousot (Ecole Polytechnique, France) Manuel Fahndrich (Microsoft Research, USA) Masami Hagiya (U. of Tokyo, Japan) Luddy Harrison (U. of Illinois at Urbana-Champaign, USA) Siau-Cheng Khoo (National U. of Singapore, Singapore) Naoki Kobayashi (Tohoku U., Japan) Oukseh Lee (Hanyang U., Korea) Peter Lee (Carnegie Mellon U., USA) Huimin Lin (Chinese Academy of Science, China) Soo-Mook Moon (Seoul National U., Korea) Alan Mycroft (U. of Cambridge, UK) Atsushi Ohori (Japan Advanced Inst. of Sci.& Tech., Japan) David Schmidt (Kansas State U., USA) Harald Sondergaard (U. of Melbourne, Australia) Martin Sulzmann (National U. of Singapore, Singapore) Wuu Yang (National Chiao-Tung U., Taiwan) Wang Yi (Uppsala U., Sweden) Kwangkeun Yi (chair) (Seoul National U., Korea) POSTER CHAIR Hongseok Yang (Seoul National U., Korea) LOCAL ARRANGEMENT Mircea Marin (U. of Tsukuba, Japan) -------------------------------------------------------------------------------

1 0

Debugging in Haskell?
by Peter Rosenbeck 25 Dec '04

25 Dec '04

I am a seasoned Smalltalk programmer (> 15 years experience) with a strong background in Lisp, Scheme and Prolog. I discovered Haskell because it is used in a computer science class of my daughter and she needed some help fom me. Let me first tell you that I am very much excited by the concepts and the elegance of the language. At he same time, I'm quite disappointed about the development environment that comes with GHCI and Hugs (the only systems which I had a closer look at). Compared to PLT Scheme (not to mention Smalltalk) this feels very antiquated. No trace, no symbolic debugging, no breakpoints. I admit that all necessary error information is contained in what the type checker gives you, but there is no way to understand these before one has mastered the language, which is quite hard for me and almost impossible for a beginner. Although, I am a fervent advicate of test driven development. I understand that a Haskell believer would prefer proof over test and I agree in principle, but how would a Haskell developer prove properties of a graphical user interface? Is therer something I missed? Is there an implementation of the UnitTest-Framework which is so popular in the OO community. Where can I get help? Thanks in advance Peter

2 1

re:please help!haskell
by M.I.Azad1＠Bradford.ac.uk 25 Dec '04

25 Dec '04

hi could somebody please explain how everything works in this function? and why is 'list' there? any help will be much apprecited Regards Imran all_rotations :: [a] -> [[a]] all_rotations xs = take (length xs) (iterate list xs) list xs = tail xs ++ [head xs] ------------------------------------------------------------ This mail sent through IMP: http://webmail.brad.ac.uk To report misuse from this email address forward the message and full headers to misuse(a)bradford.ac.uk ------------------------------------------------------------

2 1

Ph D position available at University Utrecht
by jur 22 Dec '04

22 Dec '04

Hello, we have a Ph D position available, to be filled as soon as possible, but May 1st at the latest. The topic is the Top library and its use in making program analyses, like type inferencing, scriptable. Send this e-mail on to anyone you think might apply. This is a link to a more complete description, http://www.cs.uu.nl/vacatures/62411.html regards, Jurriaan Hage

1 0