April 2004 - Haskell - Haskell.org

CICLOPS 2004: Extended deadline [May 7th]
by Manuel Carro 22 Apr '04

22 Apr '04

[ N O T E: E X T E N D E D D E A D L I N E ] [ Please accept our apologies if you receive this message several times ] --------------------------------------------------------------------------- C A L L F O R P A P E R S CICLOPS 2004 Colloquium on Implementation of Constraint and LOgic Programming Systems to be held at Saint-Malo (France) at the occasion of ICLP'04 September, 2004 http://clip.dia.fi.upm.es/Conferences/CICLOPS-2004 --------------------------------------------------------------------------- Important dates --------------- * submission deadline: May 7 [EXTENDED] * notification of acceptance: June 7 * final version: June 28 * workshop dates: still to be decided (they depend on the organization of ICLP 2004) Topics of interest ------------------ This workshop aims at discussing and exchanging experience on the design, implementation, and optimization of logic, constraint (logic) programming systems, and systems intimately related to logic as a means to express computations. Experience backed up by real implementations and their evaluation will be given preference, as well as descriptions of work in progress in that direction. Topics include, but are not limited to: * Standard and alternative sequential implementation schemes (e.g., generalization / modification of the WAM, translation to lower-level and/or general-purpose languages, etc.) * Interaction between high-level optimizations / transformations / specialization and low-level issues. * Compile-time analysis and its application to code generation. * Low-level cost models to guide high-level optimizations. * Memory management, indexing, and garbage collection issues. * Balance between compile-time effort and run-time machinery. * Implementation of parallel and concurrent logic and constraint programming systems. * Implementation techniques for declarative programming paradigms with basis on, or extending, logic and constraint programming, such as non-monotonic reasoning, inductive logic programming, etc. * Implementation of systems closely related to, or based on, logic, such as theorem provers and natural language processing systems. * Performance evaluation of logic and constraint programming systems. * User oriented tools for performance evaluation and profiling. * Software design with and for LP/CP systems: components, patterns, etc. * Design and implementation of programming environments. * Experiences from using systems in real-life applications. Workshop Goals -------------- Our intent is to bring together, in an informal setting, people involved in research on sequential and parallel implementation technologies for logic and constraint programming languages and systems, in order to promote the exchange of ideas and feedback on recent developments. We hope that the workshop will provide a meeting point for people working on implementation technology for different aspects of logic and constraint-based languages and systems. Rationale and History --------------------- The last years have witnessed continuous progress in the technology available both for academic and commercial computing environments. Examples include more processor performance, increased memory capacity and bandwidth, faster networking technology, and operating system support for cluster computing. These improvements, combined with recent advances in compilation and implementation technologies, are causing high-level languages to be regarded as good candidates for programming complex, real world applications. Techniques aiming at achieving flexibility in the language design make powerful extensions easier to implement; on the other hand, implementations which reach good performance in terms of speed and memory consumption make declarative languages and systems amenable to develop non-trivial applications. Logic Programming and Constraint Programming, in particular, seem to offer one of the best options, as they couple a high level of abstraction and a declarative nature with an extreme flexibility in the design of their implementations and extensions and of their execution model. This adaptability is key to, for example, the implicit exploitation of alternative execution strategies tailored for different applications (e.g., for domain-specific languages) without jeopardizing efficiency unnecessarily. This workshop continues a tradition of successful workshops on Implementations of Logic Programming Systems, previously held with in Budapest (1993) and Ithaca (1994), the Compulog Net workshops on Parallelism and Implementation Technologies held in Madrid (1993 and 1994), Utrecht (1995) and Bonn (1996), the Workshop on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages held in Port Jefferson (1997), Manchester (1998), Las Cruces (1999), and London (2000), and more recently the Colloquium on Implementation of Constraint and LOgic Programming Systems in Paphos (Cyprus, 2001), Copenhagen (2002), and Mumbai (2003), and the CoLogNet Workshops on Implementation Technology for Computational Logic Systems held in Madrid (2002) and Pisa (2003). Submission Information ---------------------- Authors are invited to submit papers written in English and not exceeding 12 pages. To speed up the process of refereeing, authors are requested to submit their paper in Postscript or PDF form. Hard copies may be sent to the contact address below only if access to electronic media is not available; please contact the organizers beforehand if that is the case. Submissions should contain full return mail and email address (if applicable) and FAX number (if applicable) of the contact author. Prospective authors are kindly requested to first send an indication of interest together with a paper title and abstract, in plain text format, to the organizers at the e-mail address at the bottom of the page. LaTeX style files are available via WWW at the Workshop web site. We strongly encourage their use, both in the preparation of submissions and, specially, for the final version. In order to obtain homogeneous workshop proceedings, authors of accepted papers will be requested to send the sources to the organizers. Authors who wish to prepare papers in formats other than LaTeX are kindly requested to contact the organization beforehand in order to make sure that we have available the right tools to process the files (if needed), or in order to receive detailed format instructions otherwise. Organization ------------ Program Committee: * Manuel Carro (Spain) * Ricardo Lopes (Portugal) * José F. Morales (Spain) * Enrico Pontelli (USA) * Vítor Santos (Brazil) * Tom Schrijvers (Belgium) * Christian Schulte (Sweden) * Paul Tarau (USA) * Neng-Fa Zhou (USA) Workshop Coordinators: Manuel Carro (contact person) http://lml.ls.fi.upm.es/~mcarro Phone: +34-91-3367455 Fax: +34-91-3366595 José F. Morales http://clip.dia.fi.upm.es/~jfran Phone: +34-91-3367448 Fax: +34-91-3366595 Invited Speaker: To be announced Contact Please address any question regarding the workshop organization to the address ciclops-org(a)clip.dia.fi.upm.es

1 0

FM 2005: Call for Papers
by events-admin＠fmeurope.org 22 Apr '04

22 Apr '04

Call for Papers FM 2005 The 13th International Symposium of Formal Methods Europe Newcastle upon Tyne, UK 18-22 July 2005 www.csr.ncl.ac.uk/fm05/ Important dates: 24 January 2005 Paper submission deadline 07 March 2005 Last date for Workshop & Tutorial proposals 09 April 2005 Decisions on papers 02 May 2005 Final versions of papers due 09 May 2005 Last date for Tools Exhibition & Demonstration proposals FM'05 is the thirteenth in a series of symposia organized by Formal Methods Europe, an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. The symposia have been notably successful in bringing together innovators and practitioners in precise mathematical methods for software development, industrial users as well as researchers. Submissions will be welcomed in the form of original papers on research and practice, proposals for workshops and tutorials, and entries for the exhibition of software tools, publications and companies. FM'05 welcomes papers in all aspects of formal methods for computer systems, including, but not restricted to, the following: * introducing formal methods in industrial practice (technical, organizational, social, psychological aspects) * reports on practical use and case studies (reporting positive or negative experiences) * formal methods in hardware and system design * reusable domain theories * theoretical foundations (specification and modelling, refining, verification, calculation etc.) * tool support and software engineering * environments for formal methods * method integration Papers ====== Full papers should be submitted electronically via the Web by 24 January 2005. Full submission details will be published on the conference web site. Papers will be evaluated by the Program Committee according to their originality, significance, soundness, quality of presentation and relevance with respect to the main issues of the symposium. Papers should have not been submitted elsewhere for publication. Accepted papers will be published in the Symposium Proceedings, to appear in Springer-Verlag's Lecture Notes in Computer Science Series. Papers should not exceed 16 pages and should be in LNCS format: see http://www.springer.de/comp/lncs/authors.html Please include a short list of keywords on a separate line at the end of the abstract, beginning with "Keywords:" in boldface. Workshops ========= We welcome proposals for one-day or two-day workshops related to FM'05. Proposals may be considered and evaluated at any time up to 7 March 2005 and should be directed to the Workshop Chair Juan Bicarregui (J.C.Bicarregui(a)rl.ac.uk) Early contact is recommended. Tutorials ========= We welcome proposals for half-day or full-day tutorials related to formal methods. Tutorial proposals will be evaluated on the basis of their potential benefit for participants, and should contain an outline of the objectives, format, content and, if appropriate, history of the tutorial. Proposals may be considered and evaluated at any time up to 7 March 2005, and should be sent to the Tutorial Chair, Neil Henderson (Neil.Henderson(a)ncl.ac.uk) Early contact is recommended. Exhibition & Sponsors' Presentations ==================================== An exhibition of projects and tools will also take place during the symposium, with the opportunity of holding presentations for each tool. The opportunity also exists to give a presentation as a sponsor. Proposals are welcomed at any time up to 9 May 2005 and should be directed to the Exhibition and Sponsors' Chair, Joan Atkinson (Joan.Atkinson(a)ncl.ac.uk) Early contact is recommended. Contacts ======== General Chair: John Fitzgerald, University of Newcastle upon Tyne, UK John.Fitzgerald(a)ncl.ac.uk Programme Chairs: Ian Hayes, University of Queensland, Australia Ian.Hayes(a)itee.uq.edu.au Andrzej Tarlecki, Warsaw University, Poland tarlecki(a)mimuw.edu.pl Organisers: Claire Smith & Jon Warwick, University of Newcastle upon Tyne, UK Claire.Smith(a)ncl.ac.uk, Jon.Warwick(a)ncl.ac.uk Workshops Chair: Juan Bicarregui, Rutherford Appleton Laboratory, UK J.C.Bicarregui(a)rl.ac.uk Tutorials Chair: Neil Henderson, University of Newcastle upon Tyne, UK Neil.Henderson(a)ncl.ac.uk Exhibitions & Sponsorship: Joan Atkinson, University of Newcastle, UK Joan.Atkinson(a)ncl.ac.uk Programme Committee =================== Bernhard Aichernig, UNU-IIST, UN Keijiro Araki, Kyushu University, Japan Michel Bidoit, LSV, CNRS & ENS de Cachan, France Juan Bicarregui, Rutherford Appleton Laboratory, UK Ed Brinksma, University of Twente, The Netherlands Luca Cardelli, Microsoft Research, UK Ernie Cohen, Microsoft, USA Jin Song Dong, National University of Singapore, Singapore Jose Fiadeiro, University of Leicester, UK John S. Fitzgerald, Centre for Software Reliability, UK Stefania Gnesi, CNR, Italy Anthony Hall, Praxis Critical Systems, UK Ian Hayes, University of Queensland, Australia (Co-chair) Anne E. Haxthausen, Technical University of Denmark, Denmark Thomas Henzinger, University of California, Berkeley, USA He Jifeng, UNU-IIST, UN Cliff Jones, University of Newcastle upon Tyne, UK Shaoying Liu, Hosei University, Japan Mícheál Mac an Airchinnigh, Trinity College, Dublin, Ireland Tom Maibaum, King's College, London, UK Dino Mandrioli, Politecnico di Milano, Italy Richard Moore, IFAD A/S, Denmark Tobias Nipkow, Technische Universität München, Germany José Oliveira, Universidade do Minho, Portugal Sam Owre, CRI, USA Alexander Petrenko, ISPRAS, Russia Nico Plat, West Consulting, Netherlands Ken Robinson, University of New South Wales, Australia Mark Saaltink, ORA, Canada Shin Sahara, JFITS, Japan Steve Schneider, Royal Holloway, UK Kaisa Sere, Åbo Akademi, Finland Ketil Stølen, SINTEF, Norway Andrzej Tarlecki, Warsaw University, Poland (Co-chair) Martyn Thomas, Martyn Thomas Associates, UK Mark Utting, Waikato University, New Zealand Marcel Verhoef, Chess IT & Radboud University, Nijmegen, Netherlands Alan Wassyng, McMaster University, Canada Martin Wirsing, Ludwig-Maximilians-Universität, München, Germany _______________________________________________ events mailing list events(a)fmeurope.org http://www.fmeurope.org/mailman/listinfo/events

1 0

EuroHaskell - come to sweden, write code
by Shae Matijs Erisson 21 Apr '04

21 Apr '04

You are cordially invited to come to EuroHaskell for fun and code. EuroHaskell is a sprint[1] and gathering happening at Chalmers University of Technology in Gothenburg, Sweden on June 10th, 11th, and 12th. The goal is to meet, learn, and code. The [dis]organizers are Björn Bringert and Shae Erisson. There is no entrance fee. Food and drink are not supplied, but feel free to bring your own. More information is available on the EuroHaskell wiki page: http://www.haskell.org/hawiki/EuroHaskell [1]A sprint is a focussed development session based on the principles of Extreme Programming, in which developers pair off together in a room and focus on a particular subsytem or task. for more info see : http://www.zopemag.com/Guides/miniGuide_ZopeSprinting.html -- Shae Erisson - putStr $ fix("HELLO\n"++) - http://www.ScannedInAvian.org/ OSDir: Community building... interesting... what's the secret sauce? Limi: Irresponsible sleep patterns. -- Alexander Limi, one of the Plone founders http://osdir.com/Article199.phtml

1 0

Haskell and Artificial Intelligence
by GAYLE, Orrett Orville 21 Apr '04

21 Apr '04

I am having great difficulty finding resources with AI sysytems implemented in Haskell. If anyones knows of a book or site which covers AI techniques implemented using haskell, could you please help me. Thanks in advance.

2 1

haskell for XMI processing?
by Johannes Waldmann 21 Apr '04

21 Apr '04

I wonder if Haskell (HXmlToolbox) has been used for processing XMI data. -- -- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 -- ------ http://www.imn.htwk-leipzig.de/~waldmann/ ---------

1 0

PDMC'04: Call for Papers
by Martin Leucker 20 Apr '04

20 Apr '04

[[ -- Apologies for multiple copies of this message -- ]] ============================================================================= Call for Papers 3rd International Workshop on PARALLEL AND DISTRIBUTED METHODS IN VERIFICATION (PDMC 2004) September 4, 2004, London, U.K. Workshop affiliated to CONCUR'04, 31 August - 3 September 2004. http://www.fi.muni.cz/~brim/PDMC04 ============================================================================= 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. After two successful meetings in 2002 and 2003 with primary focus on parallelization of model checking, the scope of the workshop have been extended to cover all approaches where parallel and distributed techniques can make the automated verification more effective and/or extend its applicability. This extension is also reflected in the new name of the workshop. 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 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). * Presentation reports 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'04 Submission Page. PROCEEDINGS: The preliminary workshop proceedings will be available as a Research Report of Imperial College London. 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 issue of IEEE Transaction of Parallel and Distributed Systems (under negotiation). IMPORTANT DATES: * May 29, 2004: Submission deadline for regular papers. * July 5, 2004: Notification of acceptance. * July 10, 2004: Deadline for presentations. * July 31, 2004: Camera ready copy for proceedings. INVITED SPEAKER: Boi B. Faltings (Swiss Federal Institute of Technology, Lausanne) PROGRAM COMMITTEE: * Howard Barringer (Manchester Univ., UK) * Lubos Brim (Masaryk Univ., CZ) - Co-chair * Gianpiero Cabodi (Torino, IT) * Wan Fokkink (CWI Amsterdam, NL) * Hubert Garavel (INRIA, FR) * Hanne Gottliebsen (Queen Mary Univ. of London, UK) * Orna Grumberg (Haifa, Israel) * Boudewijn R. Haverkort (Univ. of Twente, NL) * Michael Jones (Brigham Young Univ., USA) * Marta Kwiatkowska (Univ. of Birmingham, UK) * Martin Lange (LMU Muenchen, DE) * Reinhard Letz (TU Muenchen, DE) * Martin Leucker (Uppsala Univ., SE) - Co-chair * Sharad Malik (Princeton Univ., USA) * Eric Mercer (Brigham Young Univ., USA) * Michel Rueher (Universite Nice Sophia Antipolis, FR) * Pascal Van Hentenryck (Brown University, USA) * Willem Visser (NASA Ames Research Center, USA) Lubos Brim & Martin Leucker workshop organizers

1 0

CIA04: Extended Submission Deadline
by Matthias Klusch 19 Apr '04

19 Apr '04

++ Apologies for multiple copies due to cross-posting ++ Dear colleague(s), due to many requests in the past days, the paper submission deadline for the 8th international workshop CIA 2004 on cooperative information agents to be held September 27-29, 2004 in Erfurt(Germany), in cooperation with ACM SIGART and ACM SIGWeb has been EXTENDED to **** May 10, 2004 (Monday) *** For more information on this event please visit http://www.dfki.de/~klusch/cia2004/ Best regards, The CIA 2004 Organisational Board __________________________________________________ Dr. Matthias Klusch German Research Center for Artificial Intelligence Stuhlsatzenhausweg 3, 66123 Saarbrücken, Germany phone +49-6813025297, fax +49-6813022235 http://www.dfki.de/~klusch __________________________________________________

1 0

ANNOUNCE: JVM-Bridge 0.3 released
by Ashley Yakeley 19 Apr '04

19 Apr '04

Release 0.3 of Haskell/Java VM Bridge is now available in source-code form. New in Version 0.3: * Windows support (thanks to Thomas Pasch) * Can now work with third-party Java libraries * Minor bug fixes Haskell/Java VM Bridge allows Haskell programs access to the Java Virtual Machine. It comes in two parts: the 'Native' part, that abstracts away differences in the various Java VMs, and the 'Haskell' part that provides a Haskell API. The Native part is not Haskell-specific, and could potentially be used by other languages wishing to access the Java VM. Features include: * Calling of Java methods, access to fields, array-handling; * Integration of garbage collectors; * Reconciliation of exception models; * Reconciliation of thread models, including 'synchronized' monitor support and the ability to fork Haskell actions as Java threads; * Strong typing for Java classes and method argument lists (as tuples), and use of Haskell lists as arrays; * Creation of Java classes 'on the fly' (using DefineClass and the Java Class File Format) that can have Haskell callback methods; * Lifted monads which do all the necessary JNI class and method/field ID preloading and 'JNIEnv'-pointer variable handling for you -- these can be automatically generated via a tool (MakeJVMModule); * Layered design includes lower-level IO-based interface; * Automatic generation of modules for Java API classes; * All relevant imports, flags and libraries etc. handled by a single GHC package 'javavm'; * No 'unsafe' Haskell calls or pure function FFI anywhere; * Easy to port to new Java VMs. You will need: * An x86 machine running some form of Unix, or a Mac OS X machine, or a Windows machine with MinGW installed (see Building.win32 for notes on this); * GHC 6.2.1 or later; Earlier versions of GHC may work, but there's a bug in ghc-pkg in GHC 6.2 that causes package problems and may necessitate editing your package.conf by hand. Use 6.2.1 instead. * A Java VM. Haddock documentation is available by running "make doc". There are currently no annotations however. Some simple examples have been included such as a program that shows a Java Frame containing an instance of a Haskell-defined subclass of Canvas that has a Haskell 'paint' method that draws an oval. You should be able to figure out most of it from that. Haskell/JVM Bridge and source code is licensed under the GNU Lesser GPL. <http://sourceforge.net/projects/jvm-bridge/> Future plans: * use hierarchical module structure * separate out pure (non-FFI) Haskell into a separate package -- Ashley Yakeley, Seattle WA

1 0

ESSLLI 2004 - Deadline for Early Registration 1st of May
by Carlos Areces 17 Apr '04

17 Apr '04

======================================================================= ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 Deadline for Early Registration ******** 1 May 2004 ******** ESSLLI 2004 Nancy, France 9-20 August, 2004 ======================================================================= This is a reminder that the deadline for early registration for ESSLLI 2004, the 16th European Summer School in Logic, Language and Information is ******** 1 May 2004 ******** To qualify for the lower registration fee, you have to register before this date. To register go to: http://esslli2004.loria.fr click on the registration button, fill out the online form, print out the result, and fax (or surface-mail) it in. As well as registering, you can use the same form to reserve student accommodation and book lunch tickets (the lunch menu is available on the ESSLLI 2004 website). Once again, are happy to announce that the evening lecturers at ESSLLI 2004 will be: Elisabeth Andre Gerard Huet Karen Sparck Jones Vladimir Lifschitz In addition, the site now contains information about travel to Nancy, and tourist information about Nancy. Please note: we can only guarantee 360 student accommodation places, and these will be distributed on a first-come-first-served basis. We look forward to seeing you in Nancy this August! Carlos Areces, Patrick Blackburn (for the Organising committee) Helene Kirchner (Director of Loria) ======================================================================= ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 ESSLLI 2004 =======================================================================

1 0

Arrows and XML filters
by David Menendez 17 Apr '04

17 Apr '04

I don't know if this has come up before. If it has, I'd be interested in a link to the discussion. Last week, I noticed that filters used in the Haskell XML Toolbox (and elsewhere) are easily made into arrows. Specifically, for any filter f :: a -> [b] we can write Kleisli f :: Kleisli [] a b It then turns out that many of the filter combinators correspond exactly to arrow combinators. For example: Kleisli (g `o` f) === Kleisli f >>> Kleisli g Kleisli (f .> g) === Kleisli f >>> Kleisli g Kleisli (f +++ g) === Kleisli f <+> Kleisli g Kleisli this === returnA Kleisli none === zeroArrow Similarly, for the functions 'cat' and 'seqF', we can write > asum :: ArrowPlus a => [a b c] -> a b c > asum = foldr (<+>) zeroArrow > > seqA :: Arrow a => [a b b] -> a b b > seqA = foldr (>>>) returnA And so forth. The predicate combinators can't be made as general, but they still work in an arrow framework. > orElse :: Kleisli [] a b -> Kleisli [] a b -> Kleisli [] a b > orElse (Kleisli f) (Kleisli g) = > Kleisli (\t -> let res = f t in if null res then g t else res) The tree filters work similarly: > type TFilterA node = Kleisli [] (NTree node) (NTree node) > processChildren :: TFilterA node -> TFilterA node > processChildren (Kleisli f) = > Kleisli (\(NTree n cs) -> [NTree n (concatMap f cs)]) I don't know if this has any practical value. (Perhaps for future XML libraries?) If nothing else, it's given me some experience with and (I hope) a better understanding of arrows. -- David Menendez <zednenem(a)psualum.com> <http://www.eyrie.org/~zednenem/>

1 0