November 2005 - Haskell

CFP: European Conference on Logics in AI [JELIA'06]
by Michael Fisher 10 Nov '05

10 Nov '05

+---------------------------------------------------------------+ | ***** CALL FOR PAPERS ***** | | ****** JELIA'06 ****** | | --------------------------- | | 10th European Conference on Logics in Artificial Intelligence | | Liverpool, U.K., September 13-15, 2006 | | http://www.csc.liv.ac.uk/~jelia | | | | ----> Submission deadline: 1st May 2006 <---- | +---------------------------------------------------------------+ JELIA'06 will bring together researchers interested in all aspects concerning the use of logics in AI to discuss current research, results, problems and applications of both a theoretical and practical nature. Authors are invited to submit papers presenting original and unpublished research in all areas related to the use of Logics in AI. Proceedings will be published by Springer-Verlag in the Lecture Notes on Artificial Intelligence series. All submissions must be received (in PS or PDF only) by 1st May, 2006, and should be submitted via the form available at the JELIA-06 web page. Papers should be written in English, and should be formatted according to the Springer LNCS style (with standard margins). There are two categories of submission: A. Regular papers. Submissions should not exceed 13 pages including figures, references, etc., and should contain original research, and sufficient detail to assess the merits and relevance of the contribution. B. Tool descriptions. Submissions should not exceed 4 pages, and should describe the implemented tool and its novel features. A demonstration is expected to accompany a tool presentation. IMPORTANT DATES Deadline for submission: 1st May, 2006 Notification of acceptance: 8th June, 2006 Camera Ready Copy: 26th June, 2006 For further details, including lists of Conference Officials and Programme Committee, see http://www.csc.liv.ac.uk/~jelia Send your questions and comments to jelia06(a)csc.liv.ac.uk -------------------------------------------------------------------- ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.

1 0

Haskell Weekly News: November 8, 2005
by John Goerzen 08 Nov '05

08 Nov '05

Haskell Weekly News: November 8, 2005 Greetings, and thanks for reading the 14th issue of HWN, a weekly newsletter for the Haskell community. Each Tuesday, new editions will be posted (as text) to [1]the Haskell mailing list and (as HTML) to [2]The Haskell Sequence. 1. http://www.haskell.org/mailman/listinfo/haskell 2. http://sequence.complete.org/ New Releases * Haskell-mode 2.1. Stefan Monnier recently [3]released version 2.1 of his haskell editing mode for Emacs. 3. http://article.gmane.org/gmane.comp.lang.haskell.general/12445 * Gtk2hs 0.9.10. Duncan Coutts announced that the latest version of the GTK bindings for Haskell is now [4]available. Major new features include the Cairo vector graphics library bindings, Pango text layout code, new Gtk+ 2.8 APIs, and a Windows installer. 4. http://article.gmane.org/gmane.comp.lang.haskell.general/12436 * Frown 0.6. Ralf Hinze [5]announced the first release of Frown, a LALR(k) parser generator for Haskell. Frown has a number of interesting features and is considered beta-quality at this time. 5. http://article.gmane.org/gmane.comp.lang.haskell.general/12403 * network-alt 0.3 and hsgnutls 0.2.1. Einar Karttunen [6]announced the availability of new versions of these two libraries. network-alt is an alternative networking library designed to have a nicer API and better performance. hsgnutls is a TLS/SSL layer atop the GNU TLS library, supporting both client and server applications. 6. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/3904 Calls for Participation Top 10 articles. Kenneth Hoste posted a [7]request for people to contribute articles about various Haskell subjects. Each article will list the 10 most famous or frequently used things about that particular subject, and will be posted through The Monad.Reader. 7. http://article.gmane.org/gmane.comp.lang.haskell.cafe/9050 Discussion Time libraries. Ashley Yakeley started a lively [8]thread about time libraries in Haskell. 8. http://thread.gmane.org/gmane.comp.lang.haskell.libraries/3882 Conferences Haskell Workshop Steering Committee. Johan Jeuring [9]announced that ACM SIGPLAN has approved a Haskell Workshop Steering Committee to offer help and advice to the organizers of the workshop. 9. http://article.gmane.org/gmane.comp.lang.haskell.cafe/8975 Darcs Corner Darcs 1.0.4rc2 is out. David Roundy [10]announced the release of Darcs 1.0.4rc2, the second and hopefully last candidate before the 1.0.4 release. 10. http://thread.gmane.org/gmane.comp.version-control.darcs.user/8620 About Haskell Weekly News Want to continue reading HWN? Please help us create new editions of this newsletter. Please see the [11]contributing information, or send stories to hwn -at- complete -dot- org. There is also a Darcs repository available. 11. http://sequence.complete.org/hwn-contrib

1 0

RTA'06: 1st Call for Papers
by Ralf Treinen 08 Nov '05

08 Nov '05

************************************ * * * RTA'06 FIRST CALL FOR PAPERS * * * ************************************ http://rta06.csl.sri.com/ Seattle, WA, USA August 12-14, 2006 Affiliated workshops Aug 11 & 15 The 17th International Conference on Rewriting Techniques and Applications (RTA'06) is organized as part of the Federated Logic Conference (FLoC), collocated with CAV, ICLP, IJCAR, LICS, SAT, and several affiliated workshops. IMPORTANT DATES: Feb 15, 2006: Deadline for electronic submission of title and abstract Feb 22, 2006: Deadline for electronic submission of papers May 01, 2006: Notification of acceptance of papers Jun 01, 2006: Deadline for final versions of accepted papers RTA is the major forum for the presentation of research on all aspects of rewriting. Typical areas of interest include (but are not limited to): * Applications: case studies; rule-based (functional and logic) programming; symbolic and algebraic computation; theorem proving; system synthesis and verification; proof checking; reasoning about programming languages and logics; * Foundations: matching and unification; narrowing; completion techniques; strategies; constraint solving; explicit substitutions; tree automata; termination; * Frameworks: string, term, graph, and proof rewriting; lambda-calculus and higher-order rewriting; proof nets; constrained rewriting/deduction; categorical and infinitary rewriting; * Implementation: compilation techniques; parallel execution; rewrite tools; termination checking; * Semantics: equational logic; rewriting logic. The following workshops are affiliated with RTA'06: * HOR'06: 3rd International Workshop on Higher-Order Rewriting * RULE'06: 7th International Workshop on Rule-Based Programming * UNIF'06: 20th International Workshop on Unification * WG1.6: Annual meeting of the IFIP Working Group 1.6 on Term Rewriting. * WRS'06: 6th International Workshop on Reduction Strategies in Rewriting and Programming * WST'06: 8th International Workshop on Termination Please refer to the RTA'06 web site for further information on the workshops. INVITED SPEAKERS: Randy Bryant will be the joint plenary speaker of LICS, RTA and SAT. More RTA invited speakers will be announced later. BEST PAPER AWARDS AND TRAVEL GRANTS: An award is given to the best paper or papers as decided by the program committee. A limited number of travel grants may be available for students who are (co-)authors of RTA-papers. To apply for grants, students should send an e-mail to the PC chair together with their submission. RTA'06 PROGRAM COMMITTEE CHAIR: * Frank Pfenning, Carnegie Mellon University RTA'06 PROGRAM COMMITTEE: * Zena Ariola, University of Oregon * Franz Baader, Technical University Dresden * Gilles Dowek, Ecole Polytechnique and INRIA * Guillem Godoy, Technical University of Catalonia * Deepak Kapur, University of New Mexico * Delia Kesner, University Paris 7 * Denis Lugiez, University of Provence * Claude Marche, University Paris-Sud * Jose Meseguer, University of Illinois at Urbana-Champaign * Frank Pfenning, Carnegie Mellon University (Chair) * Ashish Tiwari, SRI International * Yoshihito Toyama, Tohoku University * Eelco Visser, Utrecht University * Hans Zantema, Eindhoven University of Technology RTA'06 CONFERENCE CHAIR: * Ashish Tiwari, SRI International RTA'06 SUBMISSIONS: Submissions must be original and not submitted for publication elsewhere. Submission categories include regular research papers and system descriptions. Problem sets and submissions describing interesting applications of rewriting techniques are also welcome. The page limit for submissions is 15 pages in Springer Verlag LNCS style (10 pages for system descriptions). Please consult http://rta06.csl.sri.com/ for further instructions. LOCATION, TRAVEL, ACCOMMODATION, AND REGISTRATION: RTA'06 will be part of the 2006 Federated Logic Conference (FLoC 2006) which will be held August 10-22, 2006, at the Seattle Sheraton Hotel and Towers, in Seattle, Washington state, USA. Further information will be made available at the FLoC 2006 home page http://research.microsoft.com/floc06/index.htm.

1 0

Re: lambda calculus theory
by Marc A. Ziegert 07 Nov '05

07 Nov '05

(this duplicates that inquiry from glasgow-haskell-users@ to haskell@) Am Sonntag, 6. November 2005 15:53 schrieb Hans N Beck: > Hi, > > I'm searching for a good mathematical oriented introduction to the > theory of lambda calculus or other theoretical foundations of Lisp/ > Haskell, i.e. monads or such (of course in the web there are much > hints, but what is the best for mathematicans foreign to this field) > > Regards > > Hans > _______________________________________________ > Glasgow-haskell-users mailing list > Glasgow-haskell-users(a)haskell.org > http://www.haskell.org/mailman/listinfo/glasgow-haskell-users > > Hi Hans, i'm searching for such lectures/papers/scripts, too. well, untill there is a better answer, i send you some links, which i think could be interesting to you. the first real mathematical definition of "monad", i read, was in the paper "The essence of dataflow programming". i approve to not omit that paper, if you like both, haskell and that theory. beside that, i attended a german lecture about Algebraic Topology. one chapter was about cathegory theory. it was not that much, but interesting. lambda: <http://en.wikipedia.org/wiki/Lambda_calculus> (<http://de.wikipedia.org/wiki/Lambda-Kalk%C3%BCl>) very interesting is the "typed lambda calculus", which allows effective bug-prevention, which you do not have in most variants of lisp (or lisp's derivatives) but in haskell. functor: <http://haskell.org/hawiki/CategoryTheory_2fFunctor> monad: there is a mathematical definition in the paper "The essence of dataflow programming", see 'comonad:' below. cathegory theory: <http://haskell.org/hawiki/CategoryTheory> <http://haskell.org/hawiki/CategoryTheory_2fPapers> <http://en.wikipedia.org/wiki/List_of_category_theory_topics> <http://www.eyrie.org/~zednenem/2004/hsce/> arrow: <http://www.haskell.org/arrows/> <http://www.soi.city.ac.uk/~ross/papers/fop.html> comonad: <http://comments.gmane.org/gmane.comp.lang.haskell.general/12171> beside these links, do not abstain from reading parts of the haskell library. (Data.Maybe, Data.Monoid, Control.Monad, Data.FunctorM, Control.Arrow) <http://www.haskell.org/ghc/docs/latest/html/libraries/> - marc

4 3

Haskell-mode 2.1
by Stefan Monnier 07 Nov '05

07 Nov '05

Haskell-mode 2.0 is now almost a year old, so I thought it was time to make a new release. You can find it at http://www-perso.iro.umontreal.ca/~monnier/elisp/ This release has few visible changes. Most of the changes are in the haskell-indent module. Those changes have not been heavily tested, buyer beware: you get what you pay for.The intention is to make indentation work better, but it's not always easy to guarantee forward progress. Some of the changes have to do with making sure that the correct indentation is among the provided indentation points (e.g. the `let' without `in' in the `do' notation) while others try to trim the number of indentation points (e.g. `in' has only one possible indentation point), and yet others allow finer control (e.g. the haskell-indent-after-keywords variable which allows to indent each branch of a `case' (or `where') by some 2 spaces). Please report any unexpected behavior. See appended the NEWS file that describes some of the noteworthy changes. Stefan Changes since 2.0: * inf-haskell uses ghci if hugs is absent. * Fix up some binding conflicts (C-c C-o in haskell-doc) * Many (hopefully minor) changes to the indentation. * New symbols in haskell-font-lock-symbols-alist.

1 0

REMINDER: Proposals for workshops (ICFP '06) due this Friday!
by Matthias Blume 07 Nov '05

07 Nov '05

The deadline for workshop proposals is coming up on November 11, 2005. If you are planning to organize a workshop to be co-located with ICFP 2006, please, send us your proposal before the deadline expires! Many thanks, and kind regards, Matthias Blume ------------------------------------------------------------------------ ---- ICFP '06 CALL FOR WORKSHOP PROPOSALS The ICFP 2006 ACM SIGPLAN International Conference on Functional Programming will be held in Portland, Oregon from September 18 to September 20, 2006. Proposals for workshops are invited for consideration of ACM SIGPLAN sponsorship and affiliation with ICFP 2006. Affiliated workshops will be held on September 16 and 17 (as well as on September 21, if necessary). The purpose of these workshops is to provide a forum for presenting novel ideas in a less formal and possibly more focused way than at ICFP itself. They may also provide good opportunities for young researchers to present their work to, and to obtain feedback from, a specialized community. The format of each workshop is to be determined by its organizers, but it is expected that each workshop allows ample time for general discussion. The preference is for workshops which span only one day, but other schedules will also be considered. Researchers and practitioners are invited to submit workshop proposals to the ICFP 2006 Workshop Chairs, Matthias Blume and Patricia Johann, via e-mail (icfp06-workshops(a)cs.uchicago.edu) NO LATER THAN NOVEMBER 11, 2005. Submission may be made by e-mail (Postscript, PDF, or ASCII) with "ICFP06 Workshop Submission" in the subject header. Following ACM SIGPLAN's sponsorship procedures, proposals must include: 1. The name of the workshop. 2. A statement of goals for the workshop. 3. The names and addresses of the organizers. 4. The names of potential participants, such as program committee members. (It would be wise to inform your potential comittee members that they have been selected pending SIGPLAN approval.) 5. A description of plans for calls for participation (e.g., calls for papers). 6. The expected number of attendees and planned length of the workshop. 7. A description of plans for publicity. 8. An explanation of any plans for a published proceedings. 9. A description of past versions of the workshop, including dates, organizers, submission and acceptance counts, attendance, sites, registration fees and summary budget information. 10. The URL of the workshop web site. Note that should a proposal be accepted, a final report about the workshop, suitable for publication in SIGPLAN Notices, will be required. Notification of acceptance will be made by DECEMBER 15, 2005. Accepted workshops will be sponsored by SIGPLAN (see http://www.acm.org/sigplan/sigplan_workshop_proposal.htm for more information). A committee chaired by the ICFP 2006 Workshop Chairs and consisting of the ICFP Program and General Chairs and the SIGPLAN Executive Committee will evaluate all proposals. The workshop selection committee members are: * Matthias Blume, TTI-Chicago, Workshop co-Chair for ICFP 2006 * Patricia Johann, Rutgers University, Workshop co-Chair for ICFP 2006 * Julia Lawall, DIKU, Program Chair for ICFP 2006 * John Reppy, University of Chicago, General Chair for ICFP 2006 The maximum number of workshop proposals to be accepted is 6. Any further information needed for preparing a workshop proposal can be obtained by sending email to the workshop chairs (icfp06-workshops(a)cs.uchicago.edu) or consulting the ICFP 2006 web site at http://icfp06.cs.uchicago.edu/.

1 0

TYPES 06: Call for papers
by Wouter Swierstra 07 Nov '05

07 Nov '05

TYPES 2006 Main Conference of the Types Project Nottingham, UK, 18-24 April 2006 http://www.cs.nott.ac.uk/types06/ This is the latest meeting in a series that started 1992, the last conference was in December 2004 in Paris. The topic of the meeting is formal reasoning and computer programming based on Type Theory : languages and computerised tools for reasoning, and applications in several domains such as analysis of programming languages, certified software, formalisation of mathematics and mathematics education. TYPES 2006 is colocated with TFP 2006 (Trends in Functional Programming) and we plan to hold a joint session on Dependently Typed Programming. The conference takes place at Jubilee campus of the University of Nottingham, on-site accomodation will be available together with the registration. For more information see: http://www.cs.nott.ac.uk/types06/ We will open registration early next year. You will be able to submit your talk and abstract together with your registration. We will try to accomodate all talks which fit into the scope of the TYPES project. There will also be invited lectures. Please direct all emails related to TYPES 2006 to types06(a)cs.nott.ac.uk Cheers, The Organisation Comittee Thorsten Altenkirch, James Chapman, Conor McBride, Peter Morris and Wouter Swiestra This message has been checked for viruses but the contents of an attachment may still contain software viruses, which could damage your computer system: you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation.

1 0

why don't we have const Ptrs?
by David Roundy 06 Nov '05

06 Nov '05

Hello all, I was thinking this morning as I lay on the floor (where I sleep) about static typechecking, and how much more wonderful Haskell is than any other language, when it occurred to me that when working with pointers, Haskell actually has *less* static typechecking than C or C++. It was a very disturbing thought, so much so that I was almost compelled to arise early to place this question before this learned audience. Why is it that in C++ I can write void strcpy(char *dest, const char *src); but in Haskell I must import this function as > foreign import ccall unsafe "static string.h strcpy" > strcpy :: Ptr CChar -> Ptr CChar -> IO () and lose that wonderful information that the function doesn't modify the contents of its second argument? One could pretty easily create a ConstPtr type which one could peek into, but not poke to, but then you'd have to explicitely convert a Ptr into a ConstPtr when passing it as an argument. That feels a bit silly. One could get around this by introducing a class to get around this > class ReadablePtr p where > peek :: p a -> IO a > peekOff ... and then make both Ptr and ConstPtr instances of this class, but this still seems like a very hackish solution. Moreover, I'd like to be able to have const objects quite apart from Ptrs, such as a const Handle, which I can read from, but cannot write to, or a const IORef--and we wouldn't want to leave out const ForeignPtrs. Of course, even reading affects a Handle's internal state, so one would need to be explicit about what "const" indicates. But it seems to me that in the IO world there are a whole slew of "things that refer to other things" which could all be grouped together. And a "const" attribute ought to be derived, so that if I create a data type > data FooPtr = FooPtr String (Ptr Foo) one should ideally be able to automatically understand that a const FooPtr holds a const (Ptr Foo). One could go further, at least when dealing with Ptrs, and create a way of handling "restricted" pointers--which we could interpret as a const pointer to an object that cannot be changed by anyone else either. One could safely create restricted pointers with a function of the type > mallocRestrictedPtr :: (Ptr a -> IO ()) -> RestrictedPtr a which would allow one to ensure at the typechecking level that RestrictedPtrs point to memory that cannot be modified. There's still some unstafety involved, in that you could read out of bounds, but you would know that apart from that possibility the contents of a RestrictedPtr truly will never change. So my question is, how would one implement such an "annotation" extension? I'd like to be able to pass a (Ptr a) as a (Const (Ptr a)) without an explicit typecast, since the Const really isn't changing the type of the pointer, it's just marking it as one that can't be modified. A function that accepts a (Const (Ptr a)) should also accept a (Restricted (Ptr a))--but Restricted pointers are really just pudding, as they only differ from Const pointers in what optimizations are allowed. On the other hand, it's not just compiler optimizations that they would allow, but also user-code optimizations, which could be much more useful. They also have the advantage of making certain unsafe functions safe. The hard part seems to be the lack of a conversion. One could quite easily implement a > data Const a = Const a -- this constructor is *not exported* > toConst :: x -> Const x > unsafeAccessConst :: Const x -> x > peek :: Const (Ptr a) -> IO a > peekOff ... etc, and everything would work fine, except that you'd always need to explicitely convert from Ptr to Const Ptr. Perhaps one could make Const be a class as well as a data type: > class (Const a) x where > toConst :: x -> Const a > instance (Const x) x where > toConst = Const > instance (Const x) (Const x) where > toConst = id and then one could write code like > peek :: Const (cp a) => cp a -> IO a which would move the typecasting burden out of the calling function and into the function that accepts a const argument. Perhaps this would be sufficient, as many data types have only a limited number of "primitive const" functions, and all the other "const" functions wouldn't actually need to call toConst. What this doesn't allow is deriving of constness, so that a Const ForeignPtr would automatically hold a Const Ptr. This whole class+data type scheme seems like it might be useful, but is pretty ugly. Is there a better way this could be done? Might one be able to extend the language so that one could add "attribute" such as Const to data type without changing the the type itself (which would be analogous to what one does in C/C++)? -- David Roundy http://www.darcs.net

8 7

ANNOUNCE: Gtk2Hs version 0.9.10 released
by Duncan Coutts 05 Nov '05

05 Nov '05

Gtk2Hs - A GUI Library for Haskell based on Gtk+ Version 0.9.10 is now available from: http://haskell.org/gtk2hs/download/ An installer for Windows is available. A package is available for Gentoo. Packages for other platforms should become available soon (hopefully including Fedora Core, Debian, Darwin, FreeBSD and OpenBSD). Changes since 0.9.9: * New bindings for the cairo vector graphics library. This provides a easy-to-use vector graphics API (using a PDF-style drawing model) with high quality output for multiple backends (screen, print and image files). * Completion of Pango, the text layout and rendering engine of Gtk +. We now provide all functions that end users should ever need for rendering text, ranging from type-setting whole paragraphs down to breaking up attributed text into several runs. All offsets into Haskell strings are transparently translated into UTF-8 offsets used in Pango, thereby alleviating much of the grief of dealing with Unicode. * new Gtk+ 2.8 APIs are bound * many bugs fixed * various minor documentation improvements * an installer for Windows is available again * the mozembed HTML rendering component can now be built against the FireFox libraries if the appropriate developer files are present. Other news since the last release announcement: * Paolo Martini won a $4500 grant under the Google Summer of Code programme for a project to add bindings for the cairo vector graphics library to Gtk2Hs. * Gtk2Hs is being used as part of the practical element of Functional Programming courses at the University of Oxford in England and the University of Jyväskylä in Finland. Gtk2Hs feature highlights: * automatic memory management * Unicode support * nearly full coverage of Gtk+ 2.8 * bindings for the cairo vector graphics library * support for the Glade visual GUI builder * bindings for several Gnome modules: GConf, Gnome's system for storing app preferences SourceView, code editor widget with syntax highlighting the Mozilla browser rendering engine in a widget * extensive API reference documentation * multi-platform support with native look * LGPL licence Platforms and requirements: * builds from source on Linux, Windows, MacOS X, FreeBSD, OpenBSD and Solaris * builds with GHC 6.4.x, 6.2.x, 6.0.x and 5.04.x * works with Gtk+ version 2.0 through to 2.2, 2.4, 2.6 and 2.8 * optional cairo support requires cairo 1.0 or later, however using cairo in conjunction with Gtk+ requires Gtk+ 2.8.x or later * optional Gnome support requires Gnome 2.0 or better * optional Mozilla support requires Mozilla 1.4 or FireFox 1.0 or later with the appropriate development files. Goals for the 1.0 release: * a stable API for the 1.0.x series * greater coverage of the Gtk+ API (we're about 90% there now) * support for the OpenGL 3D rendering API * introductory and other tutorials * packages for all popular platforms Please report all problems to gtk2hs-devel(a)sourceforge.net Contributions and feedback are also most welcome. To lower the barrier to contributions, the development version of Gtk2Hs is now available via darcs: darcs get http://haskell.org/gtk2hs/darcs/gtk2hs Duncan (on behalf of the Gtk2Hs team)

1 0

POPL 2006 Call for Participation
by David Walker 04 Nov '05

04 Nov '05

********************************************************************* * ACM SIGPLAN-SIGACT Symposium * * on * * Principles of Programming Languages * * * * January 11-13, 2006 * * Charleston Place Hotel * * Charleston, South Carolina * * * * Call for Participation * * * * http://www.cs.princeton.edu/~dpw/popl/06/ * ********************************************************************* Important dates * Early Registration Deadline: December 10, 2005 * Hotel Reservation Deadline: December 10, 2005 * Conference: January 11-13, 2006 Scope 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. Invited Speakers * James McKinna, St Andrews University * Martin Odersky, Ecole Polytechnique Fédérale de Lausanne * Tim Sweeney, Epic Games Inc Conference Registration Registration is now open! To register, please go to our registration site at (http://www.regmaster.com/popl2006.html) Early registration for a reduced fee is available until December 10, 2005. Don't delay! Hotel Room Reservation We recommend staying at the Charleston Place Hotel, which is where the conference will be held. Our group rate for the hotel is $155/night. (This does not include the 12.5% state tax on hotels.) Please mention the group name "ACM POPL 2006 Conference" when reserving a room. You may reserve rooms by phone, fax or email, but not using the web. * phone: (800) 831-3490 -- Staffed Monday through Friday, 8:00 am to 6:00 pm * fax: (843) 724-7215 * email: groupres(a)charlestonplace.com The hotel website is http://www.charlestonplace.com/web/ocha/ocha_a1a_splash.jsp Student Attendees Students who have a paper accepted for the conference are offered student membership of SIGPLAN free for one year. As members of SIGPLAN they may apply for travel fellowships from the PAC fund. Conference Chair Greg Morrisett Harvard University 33 Oxford Street Cambridge, MA 02138 USA greg at eecs dot harvard dot edu Program Chair Simon Peyton Jones Microsoft Research Ltd, 7 JJ Thomson Ave, Cambridge CB3 0FB, UK simonpj(a)microsoft.com Program Committee * Giuseppe Castagna, CNRS, LIENS, ENS Paris * Manuel Chakravarty, University of New South Wales * Karl Crary, Carnegie Mellon University * Sophia Drossopoulou, Imperial College London * Paul Feautrier, ENS Lyon * Carl A Gunter, University of Illinois * Rajiv Gupta, University of Arizona * Fritz Henglein, DIKU, University of Copenhagen * Trevor Jim, AT&T * Shriram Krishnamurthi, Brown University * Gary T Leavens, Iowa State * Robert O'Callahan, Novell * Peter O'Hearn, Queen Mary, University of London * Andreas Podelski, Max Planck Institute, Saarbrücken * Andrei Sabelfeld, Chalmers University * Kostis Sagonas, Uppsala University * Davide Sangiorgi, University of Bologna * Philip Wadler, University of Edinburgh * Stephanie Weirich, University of Pennsylvania * Hongwei Xi, Boston University Affiliated Events * Foundations of Object Oriented Languages (FOOL) * January 14, 2006 * Partial Evaluation and Semantics-Based Program Manipulation (PEPM) * January 9-10, 2006 * Practical Applications of Declarative Languages (PADL) * January 9-10, 2006 * Programming Language Technologies for XML (PLAN-X) * January 14, 2006 * Semantics, Program Analysis and Computing Environments for Memory Management (SPACE 2006) * January 14, 2006 * Verification, Model Checking and Abstract Interpretation (VMCAI) * January 8-10, 2006 POPL 2006 Preliminary Program Wednesday January 11, 2006 08:30 Invited talk Martin Odersky Ecole Polytechnique Fédérale de Lausanne 10:00 Staged Allocation: A Compositional Technique for Specifying and Implementing Procedure Calling Conventions Reuben Olinsky, Christian Lindig and Norman Ramsey Harvard University 10:25 A Hierarchical Model of Data Locality Chengliang Zhang, Yutao Zhong, Mitsunori Ogihara, Chen Ding University of Rochester 10:50 Simplifying Reductions Gautam Gupta and Sanjay Rajopadhye Colorado State University 11:40 Formal certification of a compiler back-end, or: programming a compiler with a proof assistant Xavier Leroy INRIA Rocquencourt 12:05 Engineering with Logic: HOL Specification and Symbolic-Evaluation Testing for TCP Implementations Steve Bishop, Matthew Fairbairn, Michael Norrish, Peter Sewell, Michael Smith and Keith Wansbrough University of Cambridge 14:00 Decidability and Proof Systems for Language-Based Noninterference Relations Mads Dam KTH 14:25 On Flow-Sensitive Security Types Sebastian Hunt and David Sands City University 14:50 A Logic for Information Flow Analysis of Pointer Programs Torben Amtoft, Sruthi Bandhakavi and Anindya Banerjee Kansas State University 15:45 Polymorphic Regular Tree Types and Patterns Jérôme Vouillon CNRS and Université Paris 7 16:10 Verifying Properties of Well-Founded Linked Lists Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research 16:35 Environmental Analysis via Delta-CFA Matthew Might and Olin Shivers Georgia Institute of Technology 17:25 Small Bisimulations for Reasoning About Higher-Order Imperative Programs Vasileios Koutavas and Mitchell Wand Northeastern University 17:50 A Fixpoint Calculus for Local and Global Program Flows Rajeev Alur, Swarat Chaudhuri, and P. Madhusudan University of Pennsylvania Thursday January 12, 2006 08:30 Invited talk Tim Sweeney Epic Games Inc 10:00 Adventures in Time and Space James S. Royer Syracuse University 10:25 N-Synchronous Kahn Networks Albert Cohen, Christine Eisenbeis, Mard Duranton, Claire Pagetti, Florence Plateau, and Marc Pouzet INRIA Futurs 10:50 Compiler-Directed Channel Allocation for Saving Power in On-Chip Networks Guangyu Chen, Feihui Li, and Mahmut Kandemir Pennsylvania State University 11:40 Fast and Loose Reasoning is Morally Correct Nils Anders Danielsson, Jeremy Gibbons, John Hughes, and Patrik Jansson Chalmers University of Technology 12:05 Modular Set-Based Analysis from Contracts Philippe Meunier, Robert Bruce Findler, and Matthias Felleisen Northeastern University 14:00 Stratified type inference for generalized algebraic data types François Pottier and Yann Régis-Gianas INRIA 14:25 Hybrid Type Checking Cormac Flanagan UCSC 14:50 A Polymorphic Modal Type System for Lisp-like Multi-Staged Languages Ik-Soon Kim, Kwangkeun Yi and Cristiano Calcagno Seoul National University Friday January 13, 2006 08:30 Invited talk James McKinna St Andrews University 10:00 A Virtual Class Calculus Erik Ernst, Klaus Ostermann and William R. Cook University of Aarhus 10:25 Interruptible Iterators Jed Liu, Aaron Kimball and Andrew C. Myers Cornell University 10:50 Specifying C++ concepts Gabriel Dos Reis Bjarne Stroustrup Texas A&M University 11:40 Frame rules from answer types for code pointers Hayo Thielecke University of Birmingham 12:05 Certified Assembly Programming with Embedded Code Pointers Zhaozhong Ni and Zhong Shao Yale University 14:00 Associating Synchronization Constraints with Data in an Object-Oriented Language Mandana Vaziri, Frank Tip and Julian Dolby IBM Research 14:25 Autolocker: Synchronization Inference for Atomic Sections Bill McCloskey, Feng Zhou, David Gay and Eric Brewer UC Berkeley 14:50 Protecting Representation with Effect Encapsulation Yi Lu and John Potter UNSW 15:45 A Verifiable SSA Program Representation for Aggressive Compiler Optimization Vijay S Menon, Neal Glew, Brian R Murphy, Andrew McCreight, Tatiana Shpeisman, Ali-Reza Adl-Tabatabai and Leaf Petersen Intel Corporation 16:10 The Essence of Command Injection Attacks in Web Applications Zhendong Su and Gary Wassermann University of California, Davis 16:35 Harmless Advice Daniel Dantas and David Walker Princeton University 17:00 The Next 700 Data Description Languages Kathleen Fisher, Yitzhak Mandelbaum and David Walker AT&T Research and Princeton University

1 0