May 2005 - Haskell - Haskell.org

ICLP 2005: Extended Deadlines
by ICLP 2005 03 May '05

03 May '05

Call for Papers ------------------------------------------------------------ Twenty first International Conference on Logic Programming ICLP'05 2-5 October, 2005 Sitges (Barcelona) Spain Co-located with the International Conference on Principles and Practice of Constraint Programming (CP'05) ------------------------------------------------------------ http://www.iiia.csic.es/iclp2005/ New abstract submission deadline: May 8th, 2005 New paper submission deadline: May 11th, 2005 [* Please note that ICLP'05 has a doctoral consortium for the first time as well as a special industrial paper session (details below). * Note that ICLP05's dates intersect with a solar eclipse visible in Barcelona ]. The Conference -------------- The 21st International Conference on Logic Programming will be held near Barcelona (Spain) from October 2nd to October 5th, 2005. ICLP'05 will be colocated with the International Conference on Principles and Practice of Constraint Programming (CP'05). Conference scope ---------------- Since the first conference held in Marseilles in 1982, ICLP has been the premier international conference for presenting research in logic programming. Contributions (papers and posters) are sought in all areas of logic programming including but not restricted to: Theory Implementation Semantic Foundations Compilation Formalisms Memory Management Nonmonotonic Reasoning Virtual Machines Knowledge Representation Parallelism Environments Alternative Paradigms Program Analysis Constraint Logic Programming Program Transformation Abductive Logic Programming Validation and Verification Inductive Logic Programming Debugging, Profiling Answer Set Programming Language Issues Applications Concurrency Semantic Web Objects Software Engineering Coordination Web Tools Mobility Internet Agents Higher Order Artificial Intelligence Types Deductive Databases Modes Natural Language Programming Techniques Specific attention will be given to work providing novel integrations of these different areas, and to new applications of logic programming in general. Contributions on applications will be assessed with an emphasis on their impact and synergy with other areas, as opposed to technical maturity. Applications of logic programming to the Semantic Web are especially encouraged. The technical program will include several invited talks and advanced tutorials, in addition to the presentations of the accepted papers and posters. A special session on industrial applications of logic programming is also planned and several workshops will be held in parallel with the conference. For the first time, a doctoral student consortium will be organized as part of ICLP. Invited Speakers ---------------- This year, ICLP will have the following invited speakers: Ian Horrocks, University of Manchester, UK Francesca Rossi, University of Padova, Italy Peter Stuckey, University of Melbourne, Australia Papers ------- Papers must describe original, previously unpublished research, and must not be simultaneously submitted for publication elsewhere. They must be written in English and not exceed 15 pages in Springer LNCS format. The authors are encouraged, although not obliged, to submit their papers already in Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS/LNAI home page (http://www.springer.de/comp/lncs/index.html) Papers should express their contribution clearly, both in general and technical terms. It is essential to identify what was accomplished, describe its significance, and explain how the paper compares with and advances previous work. Authors should make every effort to make the technical content understandable to a broad audience. The primary means of submission will be electronic, in pdf format. If electronic submission is not possible, five hard copies should be sent to one of the program co-chairs. More information on the submission procedure will be available at http://www.easychair.org/ICLP2005/submit/ Industrial Papers ----------------- A special session on industrial applications of logic programming is also planned during the conference. Papers accepted in this session will describe innovative applications of logic programming to industrial problems. The application's innovativeness and industrial impact will be the main criteria used for judging the paper. Papers accepted for this session will be published in the proceedings as shorter, (up to) 10 pages papers. Posters ------- Posters provide a forum for presenting work in an informal and interactive setting. They are ideal for discussing current work not yet ready for publication, for PhD thesis summaries and research project overviews. Accepted posters will also get a 10 minute slot for presentation during the conference. Extended abstract (2 pages) of each accepted poster will be published in the proceedings. Posters must be submitted electronically. More information on the submission procedure will be available at http://www.easychair.org/ICLP2005/submit/ Doctoral Student Consortium --------------------------- The Doctoral Consortium will provide an opportunity for students pursuing their doctoral thesis in logic programming and related areas to explore their research interests under the guidance of a panel of distinguished experts in the field. The Doctoral Consortium will also offer invited speakers and discussion groups. The Consortium will allow participants to interact with established researchers and with other students, through presentations, question-answer sessions, panel discussions, and invited presentations. A separate call-for-participation will be issued for the doctoral consortium. About 6 to 8 students will be selected for the consortium. Selected students will also present their research in the poster session. The abstract of the poster will be published in the conference proceedings. Financial support for selected students may be available. Publication ----------- The proceedings of the conference will be published by Springer-Verlag in the LNCS series. The proceedings will include the accepted papers and the abstracts of accepted posters. Sponsoring and prizes --------------------- The conference is sponsored by the Association for Logic Programming. The ALP has funds to assist financially disadvantaged participants. The ALP is planning to sponsor two prizes for ICLP'05: for the best technical paper and for the best application paper. Important dates --------------- POSTERS PAPERS Abstract submission deadline: 8 May Submission deadline: 1 June 11 May Notification of authors: 1 July 24 June Camera-ready copy due: 15 July 15 July Organization ------------ Conference Co-Chairs: Pedro Meseguer (IIIA-CSIC, Spain) Javier Larrosa (Technical University of Catalonia, Spain) Program Co-Chairs: Maurizio Gabbrielli (University of Bologna, Italy) Gopal Gupta (University of Texas at Dallas, USA) Workshop Chair: Hai-Feng Guo (University of Nebraska at Omaha, USA) Doctoral Consortium Chair: Enrico Pontelli (New Mexico State University, USA) Publicity Chair: Felip Manya (IIIA-CSIC, Spain) Program Committee: Roberto Bagnara University of Parma, Italy Maurice Bruynooghe KU Leuven, Belgium Giorgio Delzanno University of Genova, Italy Stefan Decker Digital Enterprise Research Institute, Ireland Thom Fruehwirth University of Ulm, Germany Maurizio Gabbrielli University of Bologna, Italy (Program Co-Chair) Gopal Gupta University of Texas at Dallas, USA (Program Co-Chair) Patricia Hill University of Leeds, UK Joxan Jaffar University of Singapore, Singapore Bharat Jayaraman SUNY Buffalo, USA Javier Larrosa Technical University of Catalonia, Spain (Conference Co-Chair) Michael Leuschel University of Dusseldorf, Germany Massimo Marchiori University of Venice, Italy and W3C, MIT, USA Pedro Meseguer IIIA-CSIC, Spain (Conference Co-Chair) Juan J. Moreno Navarro Technical University of Madrid, Spain Gopalan Nadathur University of Minnesota, USA Ilkka Niemela Helsinki U. of Tech. Finland Catuscia Palamidessi INRIA, France Enrico Pontelli New Mexico State Univeristy, USA I.V. Ramakrishnan SUNY Stony Brook, USA Vitor Santos Costa Federal U. of Rio de Janeiro, Brazil Harald Sondergaard University of Melbourne, Australia Peter Stuckey University of Melbourne, Australia Frank Valencia University of Uppsala, Sweden Contact addresses ----------------- Conference Chairs: Pedro Meseguer Javier Larrosa IIIA-CSIC Dep. LSI, UPC Campus UAB Jordi Girona 1-3 08193 Bellaterra, Spain 08034 Barcelona, Spain Program Co-chairs: iclp05-chairs(a)cs.unibo.it Maurizio Gabbrielli Gopal Gupta Department of Computer Science Department of Computer Sciences MS EC31 University of Bologna The University of Texas at Dallas Mura A. Zamboni 7 2601 N. Floyd Rd 40127 Bologna, Italy Richardson, TX 78050, USA

1 0

The Monad.Reader - http://www.haskell.org/tmrwiki/IssueTwo
by Shae Matijs Erisson 03 May '05

03 May '05

For issue two, the subjects are Template Haskell, better module compatibility, exploring dark corners of GHC, domain specific languages, and the Foreign Function Interface. We've also switched to an experimental wikipublishing format, in hopes of removing the bottlenecks that showed up in the first issue, and encouraging more peer review. We'd like to hear your feedback! http://www.haskell.org/tmrwiki/IssueTwo -- It seems I've been living two lives. One life is a self-employed web developer In the other life, I'm shapr, functional programmer. | www.ScannedInAvian.com One of these lives has futures (and subcontinuations!)| --Shae Matijs Erisson

7 7

Data.Array.ST, polymorphism, and escaping type variables
by Samuel J.J.Bronson 02 May '05

02 May '05

I was trying to implement quicksort using Data.Array.ST. I can't find a typing for qsortIndices in the following module: <file name="STUArraySort.hs"> {-# OPTIONS_GHC -fglasgow-exts #-} module STUArraySort where import Control.Monad.ST import Data.Array.IArray import Data.Array.MArray import Data.Array.ST import Data.Array.Unboxed mkIndices (arr) = (newListArray (bounds arr) (indices arr)) qsortIndices :: (Ord e, IArray a e, MArray (STUArray s) i (ST s)) => a i e -> UArray i i qsortIndices arr = runSTUArray $ do mkIndices arr </file> When I try to load this in GHCi, I get a nasty type error -- I even get this if I take out the type signature. I noticed a comment in Data.Array.ST that looks quite related: -- INTERESTING... this is the type we'd like to give to runSTUArray: -- -- runSTUArray :: (Ix i, IArray UArray e, -- forall s. MArray (STUArray s) e (ST s)) -- => (forall s . ST s (STUArray s i e)) -- -> UArray i e -- -- Note the quantified constraint. We dodged the problem by using -- unsafeFreezeSTUArray directly in the defn of runSTUArray above, but -- this essentially constrains us to a single unsafeFreeze for all STUArrays -- (in theory we might have a different one for certain element types). In a similar vain, I think that the signature I want would be: qsortIndices :: (Ord e, IArray a e, forall s. MArray (STUArray s) i (ST s)) => a i e -> UArray i i Unfortunately, this is not even syntactically valid... -- Thanks, Sam

1 0

rekursive array problem
by Andreas Fuertig 02 May '05

02 May '05

Hi @ all! I have a big problem. i have a list of variables and now i need something like this fillArray ["a"] should be something like this: [[("a",True)],[("a",False)]] fillArray ["a","b"] [[("a",True),("b",True)],[("a",False),("b",True)],[("a",True),("b",False)], [("a",False),("b",False)]] and so on. i tried many things, and i dont know how to solve this. allthesame vars = [(alltrue [] vars)] ++ [(allfalse [] vars)] alltrue liste [] = liste alltrue liste (x:xs) = alltrue (liste ++ [(x,True)]) xs allfalse liste [] = liste allfalse liste (x:xs) = allfalse (liste ++ [(x,False)]) xs this works, but whats with the rest :) it would be very nice, if somebody could help me. thank you Andreas

3 2

Haskell workshop 2005: second call for papers.
by Daan Leijen 01 May '05

01 May '05

[I apologize for cross-postings. Please forward to interested colleagues] 2005 Haskell Workshop Tallinn, Estonia, 30 September, 2005 http://www.cs.uu.nl/~daan/hw2005 Second Call for papers -- Important Dates --------------------------------------------------- Submission deadline : June 10 Acceptance notification: July 5 Final version due : July 19 Haskell workshop : September 30 -- The Haskell Workshop ---------------------------------------------- The Haskell Workshop 2005 is an ACM SIGPLAN sponsored workshop affiliated with the 2005 International Conference on Functional Programming (ICFP). Previous Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), and Snowbird (2004). -- Scope ------------------------------------------------------------- The purpose of the Haskell Workshop is to discuss experience with Haskell, and future developments for the language. The scope of the workshop includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to, the following: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, in the form of a formal treatment of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, and so forth; * Applications, Practice, and Experience, with Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth as well as general experience with Haskell in education and industry; * Functional Pearls, being elegant, instructive examples of using Haskell. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! If there is sufficient demand, we will try to organise a time slot for system or tool demonstrations. If you are interested in demonstrating a Haskell related tool or application, please send a brief demo proposal to the program chair (daan(a)cs.uu.nl) -- Submissions ------------------------------------------------------- Authors should submit papers in postscript or portable document format (pdf), formatted for A4 paper, to Daan Leijen (daan(a)cs.uu.nl) The length should be restricted to 12 pages in standard ACM SIG proceedings format. In particular, LaTeX users should use the most recent sigplan proceedings style available from the Haskell workshop web-site. Furthermore, the "abbrv" style should be used for the bibliography. Accepted papers are published by the ACM and appear in the ACM digital library. Each paper should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. Authors should strive to make the technical content of their papers understandable to a broad audience. -- Program committee ------------------------------------------------- Martin Erwig Oregon State University John Hughes Chalmers University of Technology Mark Jones OGI School of Science and Engineering at OHSU Ralf Lämmel Microsoft Corp. Daan Leijen Universiteit Utrecht (Program Chair) Andres Löh Universiteit Utrecht Andrew Moran Galois Connections Inc. Simon Thompson University of Kent Malcolm Wallace University of York

1 0