March 2005 - Haskell - Haskell.org

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

ICFP 2005 - Final Call for Papers
by Benjamin C. Pierce 28 Jul '05

28 Jul '05

NEWS: * submission and formatting instructions are now available * the dates of the author response period have changed slightly --------- International Conference on Functional Programming (ICFP 2005) Call for Papers September 26-28, 2005 Tallinn, Estonia Submission deadline: 13 April, 2005 Submission instructions: http://www.cis.upenn.edu/~bcpierce/icfp05 ICFP 2005 seeks original papers on the art and science of functional programming. Submissions are invited on all topics ranging from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects and concurrency. Particular topics of interest include: * Applications and domain-specific languages: Systems programming, scientific and numerical computing, symbolic computing and artificial intelligence, databases, graphical user interfaces, multimedia programming, application scripting, system administration, distributed-systems and web programming, XML processing, security. * Foundations: Formal semantics, lambda calculus, type theory, monads, continuations, control, state, effects. * Design: Algorithms and data structures, modules and type systems, concurrency and distribution, components and composition, relations to object-oriented and logic programming. * Implementation: Abstract machines, compile-time and run-time optimization, just-in-time compilers, memory management. Interfaces to foreign functions, services, components and low-level machine resources. * Transformation and analysis: Abstract interpretation, partial evaluation, program transformation. * Software-development techniques for functional programming: Design patterns, specification, verification, validation, debugging, test generation, tracing and profiling. * Practice and experience: Functional programming in education and industry. * Functional pearls: Elegant, instructive examples of functional programming. Papers in the last three 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. A special issue of the Journal of Functional Programming will highlight selected papers from the meeting. Submission instructions are available here: http://www.cis.upenn.edu/~bcpierce/icfp05 Important Dates: Submission deadline: 13 April, 2005, at 6PM (in Philadelphia) On-line response to reviews: 19-21 May, 2005 Author notification: 3 June, 2005 Camera-ready copy: 10 July, 2005 Organizers: Conference Chair: Olivier Danvy (BRICS, University of Aarhus) Program Chair: Benjamin Pierce (University of Pennsylvania) Program Committee: Mariangiola Dezani (Universita di Torino) Mary Fernandez (AT&T Labs) Matthew Flatt (University of Utah) Cedric Fournet (Microsoft Research) Jacques Garrigue (Kyoto University) Jason Hickey (California Institute of Technology) John Hughes (Chalmers University) Johan Jeuring (Utrecht University) Frank Pfenning (Carnegie Mellon University) Benjamin Pierce (University of Pennsylvania) Andrew Pitts (University of Cambridge) Norman Ramsey (Harvard University) Manuel Serrano (INRIA Sophia Antipolis) Peter Thiemann (Universitat Freiburg) Jan Vitek (Purdue University)

2 1

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

SOS 2005: Call for Papers
by sos2005＠mcs.le.ac.uk 22 Jun '05

22 Jun '05

First Call for Papers: Structural Operational Semantics 2005 A Satellite Workshop of ICALP 2005 July 10, 2005, Lisbon, Portugal http://www.cs.le.ac.uk/events/SOS2005 Aim: Structural operational semantics (SOS) provides a framework for giving operational semantics to programming and specification languages. A growing number of programming languages from commercial and academic spheres have been given usable semantic descriptions by means of structural operational semantics. Because of its intuitive appeal and flexibility, structural operational semantics has found considerable application in the study of the semantics of concurrent processes. Moreover, it is becoming a viable alternative to denotational semantics in the static analysis of programs, and in proving compiler correctness. Recently, structural operational semantics has been successfully applied as a formal tool to establish results that hold for classes of process description languages. This has allowed for the generalization of well-known results in the field of process algebra, and for the development of a meta-theory for process calculi based on the realization that many of the results in this field only depend upon general semantic properties of language constructs. This workshop aims at being a forum for researchers, students and practitioners interested in new developments, and directions for future investigation, in the field of structural operational semantics. One of the specific goals of the workshop is to establish synergies between the concurrency and programming language communities working on the theory and practice of SOS. Moreover, it aims at widening the knowledge of SOS among postgraduate students and young researchers from the U.K. and abroad. Specific topics of interest include (but are not limited to): * programming languages * process algebras * higher-order formalisms * rule formats for operational specifications * meaning of operational specifications * comparisons between denotational, axiomatic and SOS * compositionality of modal logics with respect to operational specifications * congruence with respect to behavioural equivalences * conservative extensions * derivation of proof rules from operational specifications * software tools that automate, or are based on, SOS. Papers reporting on applications of SOS to software engineering and other areas of computer science are welcome. History: The first SOS Workshop took place on 30th of August 2004 in London as one of the satellite workshops of CONCUR 2004. Over 30 participants attended the workshop. PAPER SUBMISSION: We solicit unpublished papers reporting on original research on the general theme of SOS. Prospective authors are invited to submit their work in two stages: Firstly, the title and abstract of the paper, together with the details of the author(s), should be emailed to sos2005 AT mcs.le.ac.uk by: Friday, 13 May 2005. Secondly, a pdf file with their full paper, whose length normally should not exceed 15 pages, should be sent by email to sos2005 AT mcs.le.ac.uk by: Monday, 23 May 2005. The email message with the full paper should also include, in plain text, contact information for the author(s), the title and abstract of the submission. Authors will be notified of acceptance by Monday, 13 June 2005. Submissions from the PC members are allowed. Proceedings: Preliminary proceedings containing the abstracts of the talks will be published as a Technical Report of the Department of Computer Science of Leicester University, and will be available at the meeting. The final proceedings of the workshop will appear as a volume in the ENTCS series. If the quality and quantity of the papers accepted for the workshop warrant it, submissions will be invited for a special issue of an archival journal devoted to full versions of selected papers. IMPORTANT DATES: * Submission of abstract: Friday, 13 May 2005 * Submission of full paper: Monday, 23 May 2005 * Notification: Monday, 13 June 2005 * Final version: Friday, 24 June 2005 * Workshop: Sunday, 10 July 2005. PROGRAMME COMMITTEE: Luca Aceto (BRICS, Aalborg, DK) Wan Fokkink (Amsterdam, NL) Rob van Glabbeek (NICTA, AU) Matthew Hennessy (Sussex, UK) Ralf Laemmel (CWI, NL) Peter Mosses (Swansea, UK, co-chair) David Sands (Chalmers, SE) Alex Simpson (Edinburgh, UK) Simone Tini (Insubria, I) Irek Ulidowski (Leicester, UK, co-chair) Erik de Vink (Eindhoven, NL) INVITED SPEAKERS: Jan Friso Groote Jose Meseguer CONTACT: sos2005 AT mcs.le.ac.uk WORKSHOP ORGANISERS: Peter D. Mosses Department of Computer Science University of Wales Swansea Singleton Park Swansea, SA2 8PP United Kingdom Irek Ulidowski Department of Computer Science University of Leicester University Road Leicester, LE1 7RH United Kingdom

2 1

PPDP 2005 Submission Deadline Extended to February 22
by Amy Felty 18 May '05

18 May '05

Call for Papers: PPDP 2005 Seventh ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming Lisboa, Portugal, 11-13 July 2005 IMPORTANT DATES Submission 22 February 2005 **** NEW **** Notification 1 April 2005 Final Version 1 May 2005 INVITED SPEAKERS: Joint ICALP/PPDP Giuseppe Castagna (ENS Paris) John Mitchell (Stanford University) PPDP Manuel Hermenegildo (Technical University of Madrid, University of New Mexico) WEB SITES: PPDP 2005: http://centria.di.fct.unl.pt/conferences/ppdp05/ PPDP 2005 CFP: http://www.site.uottawa.ca/~afelty/ppdp05/ PPDP: http://pauillac.inria.fr/~fages/PPDP/ SCOPE OF THE CONFERENCE: PPDP 2005 aims to provide a forum that brings together those in the declarative programming communities, including those working in the logic, constraint and functional programming paradigms. The goal is to stimulate research in the use of logical formalisms and methods for specifying, performing, and analyzing computations, and to stimulate cross-fertilization by including work from one community that could be of particular interest and relevance to the others. Topics of more specific interest are enhancements to such formalisms with mechanisms for mobility, modularity, concurrency, object-orientation, and static analysis, as well as the fuller exploitation of the programming-as-proof-search framework through new designs and improved implementation methods. At the level of methodology, the use of logic-based principles in the design of tools for program development, analysis, and verification relative to all declarative paradigms is of interest. Papers related to the use of declarative paradigms and tools in industry and education are especially solicited. This list is not exhaustive: submissions related to new and interesting ideas relating broadly to declarative programming are encouraged. Prospective authors are encouraged to communicate with the Program Chair about the suitability of a specific topic. TOPICS (Not exhaustive): Logic, Constraint, and Functional Programming; Applications of Declarative Programming; Methodologies for Program Design and Development; Declarative Aspects of Object-Oriented Programming; Concurrent Extensions to Declarative Languages; Declarative Mobile Computing; Integration of Paradigms; Proof Theoretic and Semantic Foundations; Type and Module Systems; Program Analysis and Verification; Program Transformation; Abstract Machines and Compilation; Programming Environments PAPER SUBMISSIONS: Papers should be submitted electronically by 22 FEBRUARY 2005 via the symposium's web page. Acceptable formats are PostScript or PDF, viewable by gv. Submissions should not exceed 12 pages (including bibliography and appendices) in standard ACM conference format (see URL below). They must be written in English, must have a cover page with an abstract of up to 200 words, keywords, postal and electronic mailing addresses, and phone and fax numbers of the corresponding author. EVALUATION OF SUBMISSIONS: Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. They must describe original, previously unpublished work that has not been simultaneously submitted for publication elsewhere. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. Submissions that do not meet these guidelines may not be considered. PROCEEDINGS: Proceedings will be published by ACM Press. ACM formatting guidelines are available online, along with formatting templates or style files for LaTeX, Word Perfect, and Word: http://www.acm.org/sigs/pubs/proceed/template.html. Authors of accepted papers will be required to sign the ACM copyright form. RELATED EVENTS: PPDP 2005 will be co-located with the 32nd International Colloquium on Automata, Languages and Programming (ICALP 2005), which will take place 11-15 July 2005. See http://icalp05.di.fct.unl.pt for more information. CONFERENCE CHAIR: Pedro Barahona, Universidade Nova de Lisboa, web: http://centria.di.fct.unl.pt/~pb, email: pb(a)di.fct.unl.pt PROGRAM CHAIR: Amy Felty, University of Ottawa, web: http://www.site.uottawa.ca/~afelty, email: afelty(a)site.uottawa.ca PROGRAM COMMITTEE: Pedro Barahona (Univ. Nova de Lisboa, Portugal) Gopal Gupta (Univ. Texas at Dallas, USA) Michael Hanus (Univ. Kiel, Germany) Kohei Honda (Queen Mary & Westfield Coll., UK) Michael Maher (National ICT, Australia) Maria Chiara Meo (Univ. G. D'annunzio, Italy) Gopalan Nadathur (Univ. Minnesota, USA) Atsushi Ohori (JAIST, Japan) Carsten Schuermann (Yale Univ., USA) German Vidal (Technical Univ. Valencia, Spain) Joe Wells (Heriot-Watt Univ., UK) Elena Zucca (Univ. Genova, Italy) PREVIOUS PPDP CONFERENCES: Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), Verona (2004).

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

FLoC 2006 Preliminary Announcement
by Kreutzer + Schweikardt 31 Mar '05

31 Mar '05

Preliminary Announcement --- FLoC'06 The 2006 Federated Logic Conference Seattle, Washington, USA August 10 -- August 22, 2006 http://research.microsoft.com/projects/FLoC2006/home.html http://research.microsoft.com/floc06/ In 1996, as part of its Special Year on Logic and Algorithms, DIMACS hosted the first Federated Logic Conference (FLoC). It was modeled after the successful Federated Computer Research Conference (FCRC), and synergetically brought together conferences that apply logic to computer science. The second Federated Logic Conference (FLoC'99) was held in Trento, Italy, in 1999, and the third (FLoC'02) was held in Copenhagen, Denmark, in 2002. We are pleased to announce the fourth Federated Logic Conference (FLoC'06) to be held in Seattle, Washington, in August 2006, at the Seattle Sheraton (http://www.sheraton.com/seattle) The following conferences will participate in FLoC. Int'l Conference on Computer-Aided Verification (CAV) Int'l Conference on Rewriting Techniques and Applications (RTA) IEEE Symposium on Logic in Computer Science (LICS) Int'l Conference on Logic Programming (ICLP) Int'l Conference on Theory and Applications of Satisfiability Testing (SAT) Int'l Joint Conference on Automated Reasoning (IJCAR) Pre-conference workshops will be held on August 10-11. LICS, RTA, and SAT will be held in parallel on August 12-15, to be followed by mid-conference workshops and excursions on August 15-16. CAV, ICLP, and IJCAR will be held in parallel on August 16-21, to be followed by post-conference workshops on August 21-22. Plenary events involving all the conferences are planned. Calls for papers and call for workshop proposals will be issued in the near future. For additional information regarding the participating meetings, please check the FLoC web page (see above) later this summer. FLoC'06 Steering Committee Moshe Y. Vardi (General Chair) Jakob Rehof (Conference Chair) Edmund Clarke (CAV) Reiner Hahnle (IJCAR) Manuel Hermenegildo (ICLP) Phokion Kolaitis (LICS) Henry Kautz (SAT) Aart Middeldorp (RTA) Andrei Voronkov (IJCAR)

1 0

RE: mapping module identifiers to URLs (was RE: [Haskell] URLs in haskellmodule namespace)
by Simon Marlow 31 Mar '05

31 Mar '05

On 29 March 2005 22:47, S. Alexander Jacobson wrote: > Here is a strawman proposal for replacing -i. > > The compiler/interpreter should accept a "Modules" file that maps > thid party module identifiers to URLs at which source may be found. > Here is a strawman file format: > > #moduleId url(s) > Foo.Bar.* http://domain.com/package-v1.0.hkg > http://domain.com/package-v2.0.hkg Foo.Bar > http://domain2.com/package2.hkg > > The urls on any line enumerate all packages that have compatible > implementations of the module identified by the module identifier > on that line. > > Each imported packages may contain at most one Modules file. The > implementation attempts to find module URL implementation agreement > among all imported packages. If that fails, foreign Modules files > are interpreted as being included at the line where they were > imported. Later URLs for the same moduleId override earlier ones. > > The implementation should give a warning if third party packages > give conflicting module locations. > > Note: Yes, I know about Cabal's Build-Depends, but it doesn't serve > the need described here. It is true that Cabal's Build-Depends doesn't do everything you want it to, but your proposal also duplicates some of the functionality of Build-Depends, and makes it so that there are two places where dependencies are stored. We should only have to specify dependencies once. Rather than have a separate file to list dependencies, I'd like to see Cabal extended. Downloading and installing dependencies isn't something that should be done by the compiler: we have layered the package system in such a way that the compiler only needs to understand what packages are installed and which ones to use, and the other tools are responsible for arranging to download, build, and install packages. I don't think it's necessary to specify dependencies with module granularity. This just increases the number of possible error cases, without adding functionality. If you want to specify which module imports require each package dependency, then do it with a comment. The tools can tell you if any dependencies are redundant. Suppose that: - Package dependencies in Build-Depends could be specified using URLs. - Cabal could download, build, and install dependencies without any user intervention. That does everything you want, doesn't it? I don't think everyone would want this level of automation (eg. if you want your system's native package manager involved in package installation), but that's a separate matter. Cheers, Simon

2 1

7th ECOOP Workshop on Formal Techniques for Java-like Programs
by logozzo francesco 31 Mar '05

31 Mar '05

[ We apologize for multiple copies ] CALL FOR CONTRIBUTIONS FTfJP'2005 7th ECOOP Workshop on Formal Techniques for Java-like Programs http://www.cs.ru.nl/ftfjp/ Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Newer languages such as Java and C# provide good platforms to bridge the gap between formal techniques and practical program development, because of their reasonably clear semantics and standardized libraries. Moreover, these languages are interesting targets for formal techniques, because the novel paradigm for program deployment introduced with Java, with its improved portability and mobility, opens up new possibilities for abuse and causes concern about security. Work on formal techniques and tools for programs and work on the formal underpinnings of programming languages themselves naturally complement each other. This workshop aims to bring together people working in both these fields, on topics such as: - specification techniques and interface specification languages - specification of software components and library packages - automated checking and verification of program properties, - verification logics, - language semantics, - type systems, - dynamic linking and loading, - security. Contributions (of up to 10 pages) are sought on open questions, new developments, or interesting new applications of formal techniques in the context of Java or similar languages. Contributions should not merely present completely finished work, but also raise challenging open problems or propose speculative new approaches. We particularly welcome contributions that simply suggest good topics for discussion at the workshop, or raise issues that you feel deserve the attention of the research community. Contributions will be formally reviewed, for originality, relevance, focus of the workshop, and the potential to generate interesting discussions. The workshop is intended for around 20 participants. The workshop will be organized into four or more sessions, each initiated by a presentation of few related position papers by the respective participants, or the introduction of a topic by a single speaker, and followed by discussions. A special journal issue is planned to collect selected contributions as has been done for the previous FTfJP workshops. Contributions *must* be pdf format and must be accompanied by a plain-text abstract. They should be sent to Francesco Logozzo (Francesco.Logozzo(a)polytechnique.edu) by May 10, 2005. Important dates: submission of contributions May 10, 2005 notification June 10, 2005 workshop July 25 or 26, 2005 Program Committee: John Boyland, University of Winsconsin, USA Silvia Crafa, University of Padua, Italy Susan Eisenbach, Imperial College, UK Cormac Flanagan, University of California at Santa Cruz, USA John Hatcliff, Kansas State University, USA Joseph Kiniry, University College Dublin, Ireland Luigi Liquori, INRIA Sophia-Antipolis, France Francesco Logozzo, (co-chair) Ecole Polytechnique, France David Naumann, Stevens Institute of Technology, USA Jan Vitek, (co-chair) Purdue University, USA

1 0