May 2004 - Haskell - Haskell.org

ANNOUNCE: hs-plugins-0.9.4
by dons＠cse.unsw.edu.au 28 May '04

28 May '04

A new version of the hs-plugins library has been released, v0.9.4 http://www.cse.unsw.edu.au/~dons/hs-plugins It features some nice improvements over the last few releases: * the library can now parse standard .hi files to work out a plugin's dependencies, so no more .dep files * when finding package dependencies, it now consults the system or user supplied package.conf files, rather than guessing where packages live, and what they depend on. Thanks to Sean Seefried for implementing this. * it comes with a 98 line haskell interpreter in the style of hmake, illustrating how to create an embedded Haskell interpreter via make() and load(). * many more examples Bug fixes as well. Enjoy, Don

1 0

ANNOUNCE: DrIFT 2.0.4
by John Meacham 28 May '04

28 May '04

I have not made an annoucement in a while, but there have been several DrIFT releases, So this will be a lump announcement for the last few. http://repetae.net/john/computer/haskell/DrIFT/ some highlights: a script is included to make ghc much easier to use. simply call ghc with the options "-F -pgmF drift-ghc" and everything will "just work". syntax fixes: infix constructors, strictness annotations, newtype record syntax. GhcBinary deriving rule to derive byte based ghc binary instances deriving 'update' gives much more useful functions now. for each label foo you get foo_u and foo_s to update and set the field respectivly, these can now be used on any data value of the appropriate type, passing through values that don't have the required field untouched. see http://repetae.net/john/computer/haskell/DrIFT/Changelog for the complete changelog. John -- John Meacham - ⑆repetae.net⑆john⑈

1 0

getting at performance metainfo
by John Meacham 26 May '04

26 May '04

I was playing with modifying QuickCheck to automatically benchmark the routines as well as testing them for validity and something I have wanted for a while now is a way to get at performance numbers from within a haskell program itself. something like data RunStats = RunStats { rsThunksCreated :: Integer, rsMemAlloced :: Integer, rsMemFreed :: Integer, rsCpuCycles :: Integer, rsClockTime :: Integer, rsEvals :: Integer, rsAlreadyWHNF :: Bool } and a function evaluateStats :: a -> IO (a,RunStats) which evaluates a to WHNF and returns the statistics of all resources used in doing so. Now, probably a lot of the info I gave above might not be available depending on the specifics of the runtime system, but some should be, perhays more if profiling is turned on when compiling. Any idea if this is plausable to implement? I think it could be very useful in 'real-world' programming and evaluating data structures and algorithms programatically. John -- John Meacham - ⑆repetae.net⑆john⑈

1 0

POPL 05 Call for Papers
by David Walker 26 May '04

26 May '04

POPL 2005 Call for Papers 32nd Annual ACM SIGPLAN - SIGACT Symposium on Principles of Programming Languages Long Beach, California January 12-14, 2005 http://www.cs.princeton.edu/~dpw/popl/05/ Important Dates --------------- Submission deadlines: titles and short abstracts: Friday, July 9, 2004, 17:00 UTC/GMT full papers: Friday, July 16, 2004, 17:00 UTC/GMT Notification of acceptance: Monday, September 20, 2004 Final papers due: Monday, November 1, 2004 Conference: January 12-14, 2005 Please note that the submission format is different this year. See below for submission guidelines and LaTeX style files. Scope of the Conference ----------------------- The annual Symposium on Principles of Programming Languages is a forum for the discussion of fundamental principles and important innovations in the design, definition, analysis, transformation, implementation and verification of programming languages, programming systems, and programming abstractions. Both experimental and theoretical papers on principles and innovations are welcome, ranging from formal frameworks to reports on practical experiences. Submissions on a diversity of topics are sought, particularly ones that identify new research directions. POPL 2005 is not limited to topics discussed in previous symposia. Authors concerned about the appropriateness of a topic may communicate by electronic mail with the program chair prior to submission. Submission Guidelines --------------------- Submissions should be full papers, similar in scope and size to what would appear in the proceedings of the symposium. Formatting requirements for submissions and other details are given below. Submissions will be judged on originality, significance, correctness, and clarity. A submitted paper should clearly express the contribution of the work, both in general and in technical terms. It is essential to identify what was accomplished, describe the significance of the work, and explain how the paper compares with, and improves upon, previous work. Authors should bear in mind that individual program-committee members will be asked to referee many submissions; while every effort will be made to assign submissions to an appropriate subset of the program committee, very few papers are likely to be reviewed solely by experts in a paper's topic area. A good rule of thumb is that an informed colleague (with expertise in programming languages) should be able to form an initial judgment of the technical content of a submission in 40 minutes. Some advice about how to prepare a good submission can be found at: http://www.acm.org/sigplan/conferences/author-info/ Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere (including journals and formal proceedings of conferences and workshops). See the SIGPLAN republication policy for more details. Authors will be notified of acceptance or rejection by September 20, 2004. The final version of accepted papers must be received in camera-ready form by November 1, 2004 for inclusion in the proceedings. Authors of accepted papers will be required to sign ACM copyright release forms. Proceedings will be published by ACM Press. Submission Details ------------------ Submissions, including text, figures, and bibliography must fit in 15 pages, on two columns, with 10 point font on 12 point baseline, columns 20pc (3.33in) wide and 54pc (9in) tall with a column gutter of 2pc (0.33in). Pages should be numbered. (Please note that this is not the standard ACM proceedings format: it is less compact, and the page limit is correspondingly higher.) We encourage the use of LaTeX class file (acmconfbig.cls) or LaTeX style file (acmconfbig.sty) located off the conference web site. Authors who feel it is absolutely necessary to include additional material may place it in a well-marked appendix after page 15, but committee members are under no obligation to review this material. Titles, abstracts, and full papers should be submitted via the Web. The POPL web site http://www.cs.princeton.edu/~dpw/popl/05/ will contain a link to the submission site. The full papers should be in PDF (preferably) or Postscript that is interpretable by Ghostscript and printable on US Letter and A4 size paper. The submission deadline for titles and short abstracts is Friday, July 9, 2004, 17:00 UTC/GMT. The submission deadline for the corresponding full papers is Friday, July 16, 2004, 17:00 UTC/GMT. Submissions deviating from these specifications and late submissions may not be considered. Program Chair: -------------- Martín Abadi University of California, Santa Cruz Computer Science Department Santa Cruz, CA 95064 E-mail: abadi(a)cs.ucsc.edu General Chair: -------------- Jens Palsberg University of California, Los Angeles Computer Science Dept, 4531K Boelter Hall, Los Angeles, CA 90095 Phone: 310-825-6320 Fax: 310-794-5057 E-mail: palsberg(a)ucla.edu Program Committee: ------------------ Martín Abadi, UC Santa Cruz (chair) Rastislav Bodik, UC Berkeley Perry Cheng, IBM (T.J. Watson Research Center) William Cook, UT Austin Michael Ernst, MIT Giorgio Ghelli, Università di Pisa Yossi Gil, Technion Ralf Hinze, Universität Bonn Martin Hofmann, Ludwig-Maximilians-Universität München Alan Jeffrey, DePaul University Andrew Kennedy, Microsoft Research (Cambridge) Naoki Kobayashi, Tokyo Institute of Technology Julia Lawall, University of Copenhagen Andrew Myers, Cornell University Gordon Plotkin, University of Edinburgh François Pottier, INRIA (Rocquencourt) Sriram Rajamani, Microsoft Research (Redmond) John Reppy, University of Chicago Zhong Shao, Yale University Henny Sipma, Stanford University

1 0

RE: [Haskell] ANNOUNCE: Haskell Communities & Activities Report (6th ed., May2004)
by Simon Peyton-Jones 25 May '04

25 May '04

| Just a bit more than half a year after the previous edition, I am | pleased to announce on behalf of the many contributers that the | | Haskell Communities and Activities Report | (6th edition, May 2004) I'd like to say a big thank-you to Arthur for doing this. The costs fall mainly on him, but we all get the benefits. The Haskell Communities and Activities report is a fantastic gob of glue that helps to give the Haskell community coherence and focus. There's always far more going on than I expect! Thanks Arthur. And a massive thank-you to ex-editor Claus too. Simon

1 0

[Haskell] ANNOUNCE: Haskell Communities & Activities Report (6th ed., May 2004)
by Arthur van Leeuwen 25 May '04

25 May '04

Just a bit more than half a year after the previous edition, I am pleased to announce on behalf of the many contributers that the Haskell Communities and Activities Report (6th edition, May 2004) http://www.haskell.org/communities/ is now available from the Haskell Communities home page in several formats: PDF, for screenreading as well as printing, HTML, for those of you who prefer not to deal with plugins or external viewers, and PostScript, for those of you who have nice quick printers that do not grok PDF. Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. I hope you will find it as interesting a read as we did. If you haven't encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and well in time for the actual deadline ;) ) to the call. The editor collects all the contributions into a single report and feeds that back to the community When we try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ---------------------------------------- End of October 2004: target deadline for contributions to the October 2004 edition of the HC&A Report ---------------------------------------- Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to `register' with the editor for a simple e-mail reminder in the middle of October (you could point us to them as well, and we can then politely ask if they want to contribute, but it might work better if you do the initial asking). Ofcourse, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Enjoy, communicate, and program! Arthur van Leeuwen -- /\ / | arthurvl%2Bhcar(a)cs.uu.nl | Work like you don't need the money /__\ / | A friend is someone with whom | Love like you have never been hurt / \/__ | you can dare to be yourself | Dance like there's nobody watching

1 0

haskell.org downtime
by John Peterson 25 May '04

25 May '04

We've been having hardware problems with haskell.org. We'll be offline for a while today while we swap in new hardware. Sorry for any inconvenience. John

1 0

AFP 2004 - Deadline Extension
by Varmo Vene 24 May '04

24 May '04

5th International Summer School on Advanced Functional Programming AFP 2004 Tartu, Estonia, 14-21 August 2004 http://www.cs.ut.ee/afp04 Call for Participation ******** EXTENDED DEADLINE ******** Early registration: June 11, 2004 Background and objectives AFP is a series of international summer schools which aims to bring computer scientist, in particular young researchers and programmers, up to date with the latest advances in practical functional programming. The main focus of the school is on the interface between results presented at programming conferences and the programming in the real world. This is the fifth event in the series organized by the Department of Computer Science of the Tartu University in conjuction with the Centre for Dependable Computing. The previous schools were held in Båstad (Sweden, 1995), Olympia (Washington, USA, 1996), Braga (Portugal, 1998) and Oxford (UK, 2002). Programme The scientific programme of AFP'04 consists of short courses by renowned experts of the field and a student session. The school offers eight main courses, each composed of lectures and accompanied by lab sessions. The course list is the following: John Hughes (Chalmers University of Technology): Arrows Conor McBride (University of Durham): Epigram: dependent types for practical programming Alberto Pardo (University de la Republica, Montevideo): Combining datatypes and effects Rinus Plasmeijer (University of Nijmegen): Generic programming techniques for the construction of graphical user interfaces A strongly typed functional operating system based on dynamics Bernie Pope (University of Melbourne): Declarative debugging with Buddha Doaitse Swierstra (Utrecht University) Oege de Moor (Oxford University): First-class aspects in Haskell Peter Thiemann (University of Freiburg): Server-side Web programming in WASH Simon Thompson (University of Kent): Refactoring Functional Programs In addition, there will be some introductory and intermediate functional programming courses serving as a preparation for the advanced courses. The purpose of the student session is to give students an opportunity to present their work and get feedback. Everyone intending to give a presentation should submit an extended abstract (max 10 pp) along with the registration form. Venue Tartu, with 100,000 inhabitants, is the second largest city in Estonia, situated 180 km south-east from Tallinn. Tartu University, founded 1632, is one of the oldest universities in Northern Europe. The school will be held in the new building of the Faculty of Mathematics and Computer Science. Tartu is accessible from Tallinn by coach. The coaches run very frequently (1-2 departures per hour) and the ride takes 2-2.5 hrs. Tallinn, with 400,000 inhabitants, is the capital city of Estonia, that used to be a member of the Hansa League. Tallinn's medieval Old Town is on the UNESCO World Heritage List. There are direct flights to Tallinn from London, Paris, Amsterdam, Frankfurt, Hamburg, Berlin, Prague, Warsaw, Moscow, Copenhagen, Oslo, Stockholm, Helsinki. Important dates June 11, 2004 Early registration deadline July 9, 2004 Late registration deadline Registration and cost The registration is done through internet http://www.cs.ut.ee/afp04. The deadline for registration is July 9, 2004 and the registration fee is 330 EUR. For early registrants, until May 14, there is a reduced registration fee 280 EUR. The registration fee includes course materials distributed during the school, revised lecture notes published by Springer after the school, lunches, refreshments for coffee breaks and conference dinner. Programme committee / organizing committee Varmo Vene (Tartu University) Tarmo Uustalu (Inst. of Cybernetics, Tallinn) Johan Jeuring (Utrecht University) Sponsors Centers of Excellence in Research Programme of Ministry of Education and Research of Estonia Further information Details on the submission of abstracts, registration procedure and cost are available from the school webpage, http://www.cs.ut.ee/afp04. Questions should be sent to afp04(a)cs.ut.ee.

1 0

ANNOUNCE: HOC (Haskell to Objective-C Binding) 0.7
by André Pang 19 May '04

19 May '04

About HOC ========= HOC is a Haskell to Objective-C binding. In a nutshell, it enables you to use Objective-C objects and frameworks from Haskell, and also enables you to write Objective-C objects in Haskell. You can write full-blown applications in HOC and use all of the Foundation, AppKit and Cocoa frameworks' classes (including all of the AppKit's GUI objects), combining Objective-C tools such as Mac OS X's Interface Builder to build the GUI graphically while writing controllers for the GUI in Haskell. You can even mix and match custom objects written in Objective-C with objects written in Haskell, depending on which language you find more suitable for the task. HOC comes some sample GUI programs: you can find screenshots of these HOC programs at <http://hoc.sourceforge.net/screenshots/>. The Haskell interfaces produced by HOC are strongly typed (Objective-C classes are mapped to Haskell's typed system), can be automatically generated from Objective-C header files, and are designed to integrate well with existing Haskell code, taking advantage of features such as type classes and partial application to make its Haskell API as easy to use and as "Haskell-like" as possible. HOC's primary platform is Mac OS X, although it has been lightly tested with the free GNUstep platform on Linux. HOC requires the Glasgow Haskell Compiler (GHC) 6.2 or later. Note: If you have heard of a Haskell to Objective-C binding named Mocha, HOC is effectively a working version of Mocha, which was never completed due to time constraints. A previous version of HOC (0.1) was mentioned briefly on the glasgow-haskell-users mailing list on January 2003, but is a very different beast to the current incarnation: HOC 0.1 was more of an experiment with Template Haskell than a serious implementation. Wolfgang Thaller, the primary author of HOC, has collaborated greatly with Andre Pang, who was the primary author of Mocha, to forge a new HOC that we hope you will find achieves all the ambitious goals that Mocha strived for, and more. Mocha is dead, long live HOC! More information on HOC (including where you can download it!) is available on its homepage, at: http://hoc.sourceforge.net/ Authors ======= Wolfgang Thaller <wolfgang.thaller(a)gmx.net> Andre Pang <ozone(a)algorithm.com.au> Enjoy! -- % Andre Pang : trust.in.love.to.save

1 0

CFP: CLIMA V - 5th International Workshop on Computational Logic in Multi-Agent Systems
by João Leite 19 May '04

19 May '04

========================================================================== FIRST CALL FOR PAPERS CLIMA V Fifth International Workshop on Computational Logic in Multi-Agent Systems September 29 and 30, 2004, Lisbon, Portugal http://centria.di.fct.unl.pt/~jleite/climaV/index.htm Submission Deadline: June 25th (abstracts due June 20th) Co-located with JELIA'04 =========================================================================== CALL FOR PAPERS Multi-agent systems are communities of problem-solving entities that can perceive and act upon their environments to achieve their individual goals as well as joint goals. The work on such systems integrates many technologies and concepts in artificial intelligence and other areas of computing. For this reason, over recent years, the agent paradigm gained popularity in many sub-fields of computer science. A full spectrum of multi-agent systems applications have been and are being developed; from search engines to educational aids to electronic commerce and trade, e-procurement, recommendation systems, simulation and routing, to cite only some. Although commonly implemented by means of imperative languages, mainly for reasons of efficiency, the agent concept has recently increased its influence in the research and development of computational logic based systems. Computational logic provides a well-defined, general, and rigorous framework for studying syntax, semantics and procedures, for attending implementations, environments, tools, and standards, and for linking together specification and verification of properties of computational systems. The purpose of this workshop is to discuss techniques, based on computational logic, for representing, programming and reasoning about multi-agent systems in a formal way. Following the workshop on Multi-Agent Systems in Logic Programming affiliated with ICLP'99, the first CLIMA workshop took place in London, UK, affiliated with CL'2000. The 2001 edition of CLIMA, took place in Paphos, Cyprus, affiliated with ICLP'01. CLIMA'02 took place in Copenhagen, Denmark, and was affiliated with ICLP'02 and part of FLOC'02. The fourth edition of the workshop, CLIMA IV, took place in Fort Lauderdale, USA, and was co-located with LPNMR-7 and SAIM'04. We solicit unpublished papers that address formal approaches to multi-agent systems. the approaches as well as being formal must make a significant contribution to the practice of multi-agent systems. relevant techniques include, but are not limited to, the following: * logical foundations of multi-agent systems * knowledge and belief representation and updates in multi-agent systems * agent and multi-agent hypothetical reasoning and learning * extensions of logic programming for multi-agent systems * nonmonotonic reasoning in multi-agent systems * theory and practice of argumentation for agent reasoning and interaction * operational semantics and execution agent models * model checking algorithms, tools, and applications for multi-agent logics * semantics of interaction and agent communication languages * distributed constraint satisfaction in multi-agent systems * temporal reasoning for multi-agent systems * modal logic approaches to multi-agent systems * logic based programming languages for multi-agent systems * distributed theorem proving for multi-agent systems * logic based implementations of multi-agent systems * decision theory for multi-agent systems * specification and verification of formal properties of agent systems SUBMISSION INSTRUCTIONS We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere. Please refer to the workshop web pages for further instructions concerning the submission procedures. IMPORTANT DATES * Submission of Abstracts: June 20th, 2004 * Submission of Papers: June 25th, 2004 * Notification of Acceptance: July 30th, 2004 * Final version due: September 6th, 2004 * CLIMA IV: September 29-30th, 2004 PROCEEDINGS The post-proceedings of the previous edition of CLIMA were published by Springer-Verlag as a volume of the Lecture Notes on Artificial Intelligence series. We are currently negotiating the publication of the post-proceedings of CLIMA V. Please watch the website for more information. PROGRAM COMMITTEE * José Alferes, New University of Lisbon, Portugal * Gerd Brewka, University of Leipzig, Germany * Jürgen Dix, Technical University of Clausthal, Germany * Klaus Fischer, DFKI, Germany * Michael Fisher, University of Liverpool, UK * James Harland, Royal Melbourne Institute of Technology, Australia * Katsumi Inoue, National Institute of Informatics, Japan * Sverker Janson, Swedish Institute of Computer Science, Sweden * João Leite, New University of Lisbon, Portugal * Yves Lespérance, York University, Canada * John Jules Ch. Meyer, University of Utrecht, The Netherlands * Leora Morgenstern, IBM, USA * Wojciech Penczek, Polish Academy of Sciences, Poland * Jeremy Pitt, Imperial College, UK * Enrico Pontelli, New Mexico State University, USA * Fariba Sadri, Imperial College, UK * Ken Satoh, National Institute of Informatics, Japan * Renate Schmidt, The University of Manchester, UK * Tran Cao Son, New Mexico State University, USA * Francesca Toni, Imperial College, UK * Paolo Torroni, University of Bologna, Italy * Wiebe Van Der Hoek, University of Liverpool, UK * Makoto Yokoo, Kyushu University, Japan * Cees Witteveen, Delft University of Technology, The Netherlands WORKSHOP ORGANIZERS: * João Leite, New University of Lisbon, Portugal (jleite(a)di.fct.unl.pt) * Paolo Torroni, University of Bologna, Italy (ptorroni(a)deis.unibo.it) INQUIRIES: Please send program suggestions and inquires to either of the organizers.

1 0