- Haskell - Haskell.org

LPNMR'05: Call for Systems and Applications
by lpnmr05.publicity＠mat.unical.it 04 Apr '05

04 Apr '05

Call for Systems and Applications 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05) Diamante/Cosenza, Italy September 5-8, 2005 http://www.mat.unical.it/lpnmr05/ As part of the technical program of LPNMR'05, we plan a special session devoted to presentations and demonstrations of LPNMR systems and LPNMR applications. Accepted contributions will be published as part of the regular conference proceedings in the Springer "Lecture Notes in Computer Science" series (with a limit of four to five pages). System descriptions should provide information on the theoretical background, features, and possibly implementation techniques, experimental evaluation, programming methodology and availability. Application descriptions should refer to concrete applications of LPNMR and describe design choices and decisions, interesting implementation issues, techniques, and methodology, experimental evaluation and availability. SUBMISSION OF PAPERS -------------------- Submissions must not exceed five pages including title page, references and figures. They must be written in English and formatted according to the Springer LNCS/LNAI authors' instructions. Final versions might be limited to four pages. Please e-mail your submission to lpnmr05(a)pfeifer.com as a MIME-attached PDF document. See <http://www.springer.de/comp/lncs/authors.html> for detailed instructions by the publisher. In case of questions, please contact Gerald Pfeifer <gerald(a)pfeifer.com>. IMPORTANT DATES --------------- Submission Deadline May 1, 2005 Notification (Accept/Reject) June 1, 2005 Final Version June 10, 2005 Early Registration Deadline July 4, 2005 Conference Sep. 5-8, 2005 PROGRAM COMMITTEE ----------------- Gerald Pfeifer (chair) Marcello Balduccini Texas Tech University Yuliya Lierler Universität Erlangen Ilkka Niemelä Helsinki University of Technology Yuting Zhao Istituto Trentino di Cultura

1 0

Memoization in Haskell
by Bright Sun 04 Apr '05

04 Apr '05

I can not understand memoization in Haskell. I can not find an example except the fib. For example, I want drop a list 4 times like, >drop 4 (drop 3 (drop 2 (drop 1 [1,2,3,4,5,6,7,8,9,10,11,12]))) >[11,12] can I implement a memoization funcation like >droploop [1,2,3,4] [1,2,3,4,5,6,7,8,9,10,11,12] to get same result >[11,12] so, if possible to do it? or any other example like it? Bright __________________________________________________ Do You Yahoo!? Tired of spam? Yahoo! Mail has the best spam protection around http://mail.yahoo.com

2 1

How to make Haskell more popular
by Jon Fairbairn 02 Apr '05

02 Apr '05

1) If another language has a feature, add it to Haskell, so that absolutely everything can be done in more than one way. This allows people to write Haskell programmes without going through the tiresome process of learning Haskell.` 2) Overload the syntax so that the Hamming distance between syntactically valid programmes is very small 3) Allow casting of any type to any other. 2 and 3 together mean that the programmer wins the "fight" with the compiler more often, and can get on with the exciting business of debugging. 4) Add lots of libraries with widely different styles of interface lacking any recognisable algebraic properties. This makes it hard to learn the libraries, so the programmer gets increased satisfaction when the task is finally completed, and a programmer who understands a given library becomes more valuable in the market. 4a) write the libraries at a low level of abstraction, using as few sophisticated features as possible. This makes it easier for novice programmers to modify libraries and add *features* 5) Static type checking is for wimps. Move it all to runtime, so debugging is even more exciting. With 3, this allows us the glorious possibility of using the same value in different types with different meanings, mimicking PHP's wonderful strpos etc, where the return value zero indicates failure if it's a boolean or success if it's an integer. 6) Use strings for abbreviated syntax, so avoiding even syntax checking at compile time. 7) On second thoughts, all syntax checking is for wimps. Move the rest of it to runtime too. After all, /part/ of the programme might produce plausible output, and we wouldn't want to miss out on that. This adds the further exciting possiblity that end-users will get to see Haskell syntax errors, so more of the world will hear of Haskell. -- Jón Fairbairn Jon.Fairbairn at cl.cam.ac.uk

5 4

CLIMA VI :: new deadline April 15
by clima VI <clima-vi＠deis.unibo.it> 02 Apr '05

02 Apr '05

[Apologies for cross-postings. Please send to interested colleagues and students] ========================================================================== * DEADLINE EXTENSION * CLIMA VI Sixth International Workshop on Computational Logic in Multi-Agent Systems featuring: the First CLIMA Tutorial Programme and the First CLIMA Competition City University, London, UK, June 27-29, 2005 http://clima.deis.unibo.it/ * SUBMISSIONS OPEN UNTIL APRIL 15, 2005 * ==========================================================================

1 0

CfP FOCLASA'05 at CONCUR 2005: Foundations of Coordination Languages and Software Architectures
by Foclasa 2005 02 Apr '05

02 Apr '05

FOCLASA 2005 4th International Workshop on the Foundations of Coordination Languages and Software Architectures A Satellite Workshop of CONCUR 2005 August 27, 2005 San Francisco, Californa (USA) http://foclasa05.lcc.uma.es Abstract ======== A number of hot research topics are currently sharing the common problem of combining concurrent, distributed, mobile and heterogenous components, trying to harness the intrinsic complexity of the resulting systems. These include coordination, peer-to-peer systems, grid computing, web-services, multi-agent systems, and component-based systems. Coordination languages and software architectures are recognised as fundamental approaches to tackle these issues, improving software productivity, enhancing maintainability, advocating modularity, promoting reusability, and leading to systems more tractable and more amenable to verification and global analysis. The goal of this workshop is to put together researchers and practitioners of the aforementioned fields, to share and identify common problems, and to devise general solutions in the contexts of coordination languages and software architectures. Topics of interest ================== Topics of interest include (but are not limited to): * Theoretical models (coordination, component composition, concurrency, semantics, expressiveness); * Specification, refinement, and analysis of software systems (architectures, patterns and styles, verification of functional and non-functional properties); * Languages for interaction, coordination, architectures, and interface definition (implementation, interoperability, heterogeneity); * Dynamic software architectures (mobile agents, self-organizing/adaptive/reconfigurable systems); * Tools and environments for the development of applications. In particular, practice, experience and methodologies from the following areas are solicited as well: - Web-services - Multi-agent systems - Peer-to-peer systems - Grid computing - Component-based systems Call for Papers =============== FOCLASA 2005 is a satellite workshop of the 16th International Conference on Concurrency Theory (CONCUR 2005). The workshop will be held at same location as CONCUR 2005 on August 27, 2005, one day after the main conference. The workshop tries to provide a venue where researchers and practitioners on the topics above can meet, exchange ideas and problems, identify some of the key and fundamental issues related to coordination languages and software architecture, and explore together and disseminate solutions. FOCLASA 2005 invites the submission of technical papers in any of the topics of interest and areas listed above. Submissions must describe authors original research work and their results. Description of work-in-progress is also encouraged. The contributions should not exceed 15 pages formatted according to the style of the Electronic Notes on Theoretical Computer Science (ENTCS), and should be emailed as PostScript (PS) or Portable Document Format (PDF) files to foclasa05(a)lcc.uma.es. All submissions will be reviewed by an international program committee that will select them for presentation in the workshop. Selected papers will be available through the workshop website, and a printed version of the proceedings will be distributed among participants during the workshop. The proceedings of the workshop will be published in Electronic Notes in Theoretical Computer Science (ENTCS). Participants will make a presentation of their papers (about twenty or twenty five minutes maximum), followed by a five to ten minutes round of questions and discussion on participants work. The workshop will also include a closing panel in which several issues related to the topics of the workshop and some issues raised during the workshop will be discussed. The Panel Chair (to determine) will invite the panelists and moderate the debate. The publication of a special issue on FOCLASA 2005 in an international scientific journal is also being prepared. Selected participants will be invited to submit an extended version of their papers after the workshop. These extended versions will be reviewed by an international program committee, which will decide on their final publication on the special issue. Previous editions of FOCLASA have been published on Fundamenta Informaticae and Science of Computer Programming. Program Committee ================= Farhad Arbab, CWI, The Netherlands Antonio Brogi, University of Pisa, Italy Carlos Canal (co-chair), University of Málaga, Spain Atsushi Igarashi, University of Kyoto, Japan Jean-Marie Jacquet, University of Namur, Belgium Nickolas Kavantzas, Oracle, USA Antónia Lopes, University of Lisbon, Portugal Ronaldo Menezes, Florida Institute of Technology, USA John-Jules Ch. Meyer, Universiteit Utrecht, The Netherlands Ernesto Pimentel, University of Málaga, Spain Alessandro Ricci, University of Bologna, Italy Katia Sycara, Carnegie Mellon University, USA Vladimiro Sassone, University of Sussex, UK Mirko Viroli (co-chair), University of Bologna, Italy Jan Vitek, Purdue University, USA Gianluigi Zavattaro, University of Bologna, Italy Important dates =============== Submission: May 31, 2005 Notification of acceptance: June 30, 2005 Final version due: July 15, 2005 Workshop: August 27, 2005 Organisation ============ Carlos Canal Universidad de Málaga (Spain) E-mail: canal(a)lcc.uma.es http://www.lcc.uma.es/~canal Mirko Viroli Università degli Studi di Bologna (Italy) E-mail: mviroli(a)deis.unibo.it http://www.ingce.unibo.it/~mviroli

1 0

MATES/CIA 2005: Submission Deadline Extended Until April 18, 2005
by Matthias Klusch 01 Apr '05

01 Apr '05

+++ Apologies for multiple copies due to cross postings +++ CALL FOR PAPERS - EXTENDED SUBMISSION DEADLINE ********************************************* Third German Conference on Multi-Agent System Technologies (MATES 05), September 11 - 13, 2005, Koblenz, Germany http://www.mates2005.de/ * Incorporating the 9th International Workshop on Cooperative Information Agents (CIA 2005) * Co-located with the 28th German Conference on Artificial Intelligence (KI 2005) * Co-sponsored by Siemens, Germany; Whitestein Technologies, Switzerland; German Computer Society (GI); European Coordination Action for Agent-Based Computing (AgentLink III) ********************************************* IMPORTANT DATES Submission of papers *** EXTENDED: APRIL 18, 2005 *** Notification of authors: June 3, 2005 Camera-ready papers: June 20, 2005 Conference: September 11-13, 2005 ********************************************* Please find more information about Aims & Scope, Topics, and Submission Details on the conference website at http://www.mates2005.de/. The proceedings of MATES 2005 will be published as volume 3550 in the Springer series of Lecture Notes on Artificial Intelligence (LNAI). These proceedings are considered as joint proceedings with CIA 2005. MATES and CIA 2005 jointly issue a "MATES/CIA 2005 Best Paper Award". This award is sponsored by Siemens, Germany. CIA 2005 issues a "CIA 2005 System Innovation Award" to acknowledge and stimulate development of highly innovative systems of intelligent information agents. This award is sponsored by Whitestein Technologies, Switzerland. MATES 2005 provides limited financial support to a limited number of students who are co-authors of accepted papers to give their presentation at the MATES 2005 conference. *************************************************************** The MATES/CIA 2005 Organizational Board Matthias Klusch (DFKI Saarbruecken, D) Michael Huhns (U South Carolina, USA) Torsten Eymann (U Bayreuth, D) Franziska Kluegl (U Wuerzburg, D) Winfried Lamersdorf (U Hamburg, D)

1 0

ESCAR in Tallinn, 2nd CFP
by geoff＠cs.miami.edu 01 Apr '05

01 Apr '05

------------------------------------------------------------------------------- ESCAR, a CADE-20 Workshop 22nd-23rd July 2005 http://www.cs.miami.edu/~geoff/Conferences/ESCAR/ Tallinn, Estonia The CADE-20 Workshop on Empirically Successful Classical Automated Reasoning (ESCAR) will bring together practioners and researchers who are concerned with the implementation and deployment of working automated reasoning systems for classical logic (propositional, first order, and higher order). The workshop will discuss "really running" systems, and not theoretical ideas that have not yet been translated into working software. ESCAR is the successor to the successful ESFOR workshop held at IJCAR 2004. CADE-20 will be 22nd to 27th July 2005, with ESCAR on the 22nd and 23rd. Full details are available at: http://www.cs.miami.edu/~geoff/Conferences/ESCAR/ Submission of papers for presentation at the workshop, and proposals for system and application demonstrations at the workshop, are now invited. Submissions will be refereed, and a balanced program of high-quality contributions will be selected. The submission deadline is 1st May, notification of acceptance on 30th May, and camera ready versions due 12th June. Submission information is online at: http://www.cs.miami.edu/~geoff/Conferences/ESCAR/ Additionally, the Journal of Automated Reasoning has agreed to a special issue on emperically successful automated reasoning. Authors of ESCAR papers will be able to submit extended versions of their workshop papers for this special issue. All papers submitted for the special issue will be reviewed according to the journal's standards. -------------------------------------------------------------------------------

1 0

CfP: PDMC'05 at ICALP'05
by Martin Leucker 01 Apr '05

01 Apr '05

[[ -- Apologies for multiple copies of this message -- ]] ============================================================================= Call for Papers 4th International Workshop on PARALLEL AND DISTRIBUTED METHODS IN VERIFICATION (PDMC 2005) July 10, 2005 - Lisboa, Portugal Workshop affiliated to ICALP'05 http://pdmc.informatik.tu-muenchen.de ============================================================================= OBJECTIVES: The growing importance of automated formal verification in industry is driving a growing interest in those aspects which have a direct impact on its applicability to real world problems. One of the main technical challenges is in devising tools that allow to handle large state spaces. Over the last years numerous approaches have been developed. Recently, an increasing interest is in parallelizing and distributing of verification techniques. The aim of the PDMC workshop series is to cover all aspects of parallel and distributed methods and techniques for formal verification. Theoretical results, algorithms and case studies are equally welcome. Contributions from the domains of model checking, theorem proving, and equivalence checking are anticipated. The PDMC workshop aims to provide a working forum for presenting, sharing, and discussing recent achievements in the field of parallel and distributed verification. The workshop will consist of invited talks and a selection from submitted papers. SCOPE AND TOPICS: Papers describing recent work on all aspects of parallel and distributed verification are solicited as contributions to PDMC. Topics of interest include, but are not limited to: * parallel and distributed model checking * parallel and distributed equivalence checking * parallel and distributed satisfiability checking * slicing and distributing the state space * distributed theorem proving * distributed constraints solving * parallel methods in probabilistic model checking * file systems for distributed transitions systems * parallel methods in performance evaluation * tools and case studies * industrial applications INVITED SPEAKER: * Kim G. Larsen (Aalborg University, Denmark) SUBMISSION GUIDELINES: There are two categories of submissions: regular papers and presentations. * Manuscripts of regular papers are limited to a maximum of 10 pages (excluding bibliography and technical appendices) in postscript or PDF format (ENTCS style strongly recommended). * Presentations report on relevant results submitted to other forums or already published or on not yet finished work in progress. Presentations will appear in the workshop preliminary proceedings, but will not be considered for the final workshop proceedings. The space limit for presentations is 10 pages (excluding bibliography and technical appendices) in postscript or PDF format (ENTCS style strongly recommended). Submissions should be made electronically using PDMC'05 Submission Page. PROCEEDINGS: The preliminary workshop proceedings will be available at the meeting. The final proceedings appear as a volume of Electronic Notes in Theoretical Computer Science. After the workshop, selected authors will be invited to submit full versions of their papers (regular papers or presentation results not submitted for journal publication) to a special section of a journal (under negotiation). IMPORTANT DATES: * Submission deadline: April 17, 2005 * Notification of acceptance: May 16, 2005 * Presentations deadline: May 22, 2005 * Final version: June 3, 2005 PROGRAM COMMITTEE: * Howard Barringer (Manchester Univ., UK) * Lubos Brim (Masaryk Univ., CZ) * Gianpiero Cabodi (Torino, IT) * Joerg Denzinger (Alberta, Canda) * Wan Fokkink (CWI Amsterdam, NL) * Hubert Garavel (INRIA, FR) * Juergen Giesl (RWTH Aachen, DE) * Orna Grumberg (Haifa, Israel) * Boudewijn R. Haverkort (Univ. of Twente, NL) * Marta Kwiatkowska (Univ. of Birmingham, UK) * Martin Leucker (TU Munich, DE) - Co-chair * Eric Mercer (Brigham Young Univ., USA) * Jaco van de Pol (CWI, NL) - Co-chair * Gerardo Schneider (Univ. of Oslo, Norway) * Willem Visser (NASA Ames Research Center, USA) Martin Leucker & Jaco van de Pol workshop organizers

1 0

FLoC 2006 Preliminary Announcement
by Kreutzer + Schweikardt 01 Apr '05

01 Apr '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 01 Apr '05

01 Apr '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