- Haskell - Haskell.org

Coordination 2005: Last call for papers
by Jean-Marie JACQUET 01 Dec '04

01 Dec '04

[ Our apologies for multiple copies. ] ====================================================================== Last Call for Papers COORDINATION 2005 7th International Conference on Coordination Models and Languages Namur, Belgium, 20-23 April 2005 http://www.coordination2005.org ====================================================================== IMPORTANT NEWS * Publication of the proceedings in the Lecture Notes of Computer Science of Springer-Verlag * Publication of selected work in Science in Computer Programming ====================================================================== IMPORTANT DATES * Submission of abstract: December 15, 2004 * Submission of papers: December 21, 2004 * Notification of acceptance: February 1, 2005 * Final version: February 15, 2005 * Conference: April 20-23, 2005 CONFERENCE GOALS Modern information systems rely increasingly on combining concurrent, distributed, mobile, reconfigurable and heterogenous components. New models, architectures, languages, verification techniques are necessary to cope with the complexity induced by the demands of today's software development. Coordination languages have emerged as a successful approach, in that they provide abstractions that cleanly separate behavior from communication, therefore increasing modularity, simplifying reasoning, and ultimately enhancing software development. Building on the success of the previous editions, this conference provides a well-established forum for the growing community of researchers interested in models, languages, architectures, and implementation techniques for coordination. PREVIOUS EDITIONS The previous editions of COORDINATION took place in Cesena (Italy), Berlin (Germany), Amsterdam (Netherlands), Limassol (Cyprus), York (UK), and Pisa (Italy). More details are available at http://music.dsi.unifi.it/coordination. TOPICS OF INTEREST They include but are not limited to: * Theoretical models and foundations for coordination: component composition, concurrency, mobility, dynamic aspects of coordination, emergent behavior. * Specification, refinement, and analysis of software architectures: patterns and styles, verification of functional and non-functional properties. * Coordination, architectural, and interface definition languages: implementation, interoperability, heterogeneity. * Multiagent systems and coordination: models, languages, infrastructures. * Dynamic software architectures: mobile code and agents, configuration, reconfiguration, self-organization. * Coordination and modern distributed computing: Web services, peer-to-peer networks, grid computing, context-awareness, ubiquitous computing. * Programming languages, middleware, tools, and environments for the development of coordinated applications * Industrial relevance of coordination and software architectures: programming in the large, domain-specific software architectures and coordination models, case studies. * Interdisciplinary aspects of coordination PROCEEDINGS The conference proceedings will be published by Springer, in the Lecture Notes in Computer Science (LNCS) series. Proceedings of the previous editions of this conference are also available in the LNCS series: volumes 1061, 1282, 1594, 1906, 2315, and 2949. A selection of the best papers will published in a special issue of the journal Science of Computer Programming. SUBMISSION INSTRUCTIONS Authors are invited to submit full papers electronically in PostScript or PDF using a two-phase online submission process. Registration of the paper information and abstract (max. 250 words) must be completed before December 15, 2004. Submission of the full paper is due no later than December 21, 2004. Submissions are handled through a conference management system, accessible from the conference web site: http://www.coordination2005.org. Submissions must be formatted according to the LNCS guidelines (see http://www.springer.de/comp/lncs/authors.html) and must not exceed 15 pages in length. Papers that are not in the requested format or significantly exceed the mandated length may be rejected without going through the review phase. Submissions should explicitly state their contribution and their relevance to the theme of the conference. Other criteria for selection will be originality, significance, correctness, and clarity. Simultaneous or similar submissions to other conferences or journals are not allowed. CONFERENCE LOCATION The conference will be hosted by the Institute of Informatics at the University of Namur, Belgium. Capital of the Walloon Region, Namur is a beautiful city of 80.000 inhabitants. Its position at the confluent of two rivers gave it military and economic appeal, exploited by the Roman Empire and by many others since then. Much evidence of Namur's past can be visited nowadays, including the citadel, one of the greatest in Europe. Close to Brussels (60 km) and at the intersection of European railways and highways, Namur can be easily reached by road, train, and plane. PROGRAM COMMITTEE Co-Chairs Jean-Marie Jacquet University of Namur, Belgium jmj(a)info.fundp.ac.be www.info.fundp.ac.be/~jmj/ Gian Pietro Picco Politecnico di Milano, Italy picco(a)elet.polimi.it www.elet.polimi.it/upload/picco Members Farhad Arbab CWI, The Netherlands Luca Cardelli Microsoft Research, United Kingdom Gianluigi Ferrari University of Pisa, Italy Paola Inverardi University of l'Aquila, Italy Toby Lehman IBM Almaden Research Center, USA Ronaldo Menezes Florida Institute of Technology, USA Amy Murphy University of Lugano, Switzerland Andrea Omicini University of Bologna, Italy George Papadopoulos University of Cyprus, Cyprus Ernesto Pimentel University of Malaga, Spain Rosario Pugliese University of Firenze, Italy Antonio Porto New University of Lisbon, Portugal Carolyn Talcott SRI International, USA Sebastian Uchitel Imperial College, United Kingdom Jan Vitek Purdue University, USA Michel Wermelinger New University of Lisbon, Portugal The Open University, UK Herbert Wiklicky Imperial College, United Kingdom Alexander Wolf University of Colorado, USA Alan Wood University of York, United Kingdom Gianluigi Zavattaro University of Bologna, Italy

1 0

CLIMA VI :: First Call for Papers
by clima VI <clima-vi＠deis.unibo.it> 01 Dec '04

01 Dec '04

Apologies for cross-postings. Please send to interested colleagues and students ============================ First Call for Papers ============================ CLIMA VI Sixth International Workshop on Computational Logic in Multi-Agent Systems City University, London, UK June 27-29, 2005 http://clima.deis.unibo.it/ =============================================================================== Aims and scope -------------- 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 as well as other disciplines. Over recent years, the agent paradigm gained popularity, due to its applicability a full spectrum of domains, 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, agent-related concepts have recently increased their 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 various tasks by individual agents, as well as interaction amongst agents in multi-agent systems, for attending implementations, environments, tools, and standards, and for linking together specification and verification of properties of individual agents and multi-agent systems. The purpose of this workshop is to discuss techniques, based on Computational Logic, for representing, programming and reasoning about Agents and Multi-Agent Systems in a formal way. We solicit unpublished papers that present formal approaches to multi-agent systems based upon or relating to computational logic. The approaches must make a significant contribution to the practice of multi-agent systems. Topics ------ Relevant topics 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 * non-monotonic 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 Submissions ----------- We welcome and encourage the submission of high quality, original papers, which are not simultaneously submitted for publication elsewhere. Papers should be written in English, formatted according to the Springer LNCS style, which can be obtained from http://www.springeronline.com, and not exceed 16 pages including figures, references, etc. Important Dates --------------- * Submission: April 7, 2005 * Notification: May 6, 2005 * Camera-Ready: May 27, 2005 * CLIMA VI: June 27-29, 2005 Proceedings and post-workshop publications ------------------------------------------ A printed volume with the proceedings will be available at the workshop. Past editions of CLIMA have been published in journal special issues (Electronic Notes in Theoretical Computer Science vol. 70(5) of 2002, Annals of Mathematics and Artificial Intelligence vol. 37(1-2) of 2003 and vol. 42(1-3) of 2004), and book series such as the recent vol. 3259 of Springer-Verlag Lecture Notes in Artificial Intelligence (CLIMA IV) and the forthcoming issue of the same series, featuring the post-proceedings of CLIMA V. Organising committee -------------------- Workshop Chairs * Francesca Toni, Department of Computing, Imperial College London, UK * Paolo Torroni, DEIS, University of Bologna, Italy Local Organisation Chair * Kostas Stathis, Department of Computing, City University London, UK Web Support * Federico Chesani, DEIS, University of Bologna, Italy * Fabio Bucciarelli, DEIS, University of Bologna, Italy Programme committee ------------------- * José Júlio Alfers, New University of Lisbon, Portugal * Rafael H. Bordini, University of Durham, UK * Gerhard Brewka, University of Leipzig, Germany * Jürgen Dix, Technical University of Clausthal, Germany * Thomas Eiter, Vienna University of Technology, Austria * Klaus Fischer, DFKI, Germany * Michael Fisher, University of Manchester, UK * James Harland, RMIT, Australia * Katsumi Inoue, National Institute of Informatics, Japan * Antonis Kakas, University of Cyprus * Evelina Lamma, University of Ferrara, Italy * João Leite, New University of Lisbon, Portugal * Paolo Mancarella, University of Pisa, Italy * Paola Mello, University of Bologna, Italy * John Jules Ch. Meyer, Utrecht University, The Netherlands * Leora Morgenstern, IBM T.J. Watson Research Center, USA * Wojciech Penczek, Polish Academy of Sciences, Poland * Jeremy Pitt, Imperial College London, UK * Enrico Pontelli, New Mexico State University, USA * Fariba Sadri, Imperial College London, UK * Ken Satoh, National Institute of Informatics, Japan * Renate Schmidt, University of Manchester, UK * Trao Can Son, New Mexico State University, USA * Kostas Stathis, City University London, UK * Wiebe van der Hoek, University of Manchester, UK * Cees Witteveen, Delft University of Technology, The Netherlands

1 0

ANNOUNCE: DrIFT 2.1.0
by John Meacham 01 Dec '04

01 Dec '04

DrIFT 2.1.0 is out! http://repetae.net/john/computer/haskell/DrIFT/ Here are the recent changes: * added 'get' utility which creates foo_g for each label which returns its value in a failing monad rather than raising an error. * added 'from' utility which creates fromFoo for each constructors * no longer an error for DERIVEPATH to not be set * added -i to ignore directives in file. useful with -g and -r for testing * added 'Query' which creates from, get, has, and is functions, but in a class with an instance for the data type. useful for extensible data types * added deriving rule for 'Monoid' * added deriving rule for 'FunctorM' * added deriving rule for 'RmapM' * added code subdirectory with support code and perhaps more importantly, DrIFT is now in a darcs repository! the repository is at: http://repetae.net/john/repos/DrIFT/ and it may be browsed here: http://repetae.net/cgi-bin/darcs.cgi/DrIFT/ Several people have sent me patches recently, and unfortunatly I lost some of my email, so if you sent me a patch and your code didn't make it into this release, please resend it, or better yet use darcs to send a patch. The half-minute tutorial for sending me a patch if you don't know darcs is ;darcs get http://repetae.net/john/repos/DrIFT/ ;cd DrIFT edit code ;darcs record ;darcs send more info on darcs can be gotten from http://abridgegame.org/darcs/ John -- John Meacham - ⑆repetae.net⑆john⑈

1 0

Better Exception Handling
by John Goerzen 30 Nov '04

30 Nov '04

Hi everyone, I've been using Haskell for 1-2 months now, and feel fairly comfortable with the language. However, my #1 gripe is the difficulty of working with exceptions. I have two main complaints: difficulty of defining custom exceptions, and difficulty of handling exceptions. I've been working on a library of various bits of Haskell code. There are several things that could raise exceptions within that library. There's no real easy way to do it, and make it easy for people using the library to trap only my exceptions. I could just use error("foo: bar") and tell them to look for a string that starts with "foo:". It works, but it's clumsy, and unreliable too ("foo:" is a valid filename, for instance, and could be used in other exceptions.) My other choice is to use Dynamic for my exceptions, but that makes it even more difficulty to catch and handle, and requires the programmer to be ready to deal with a fairly esoteric part of Haskell. In OCaml, there is an exception keyword, that is essentially the same as a data keyword. It defines a new exception, and can use the same constructors, etc. that any other type can. It's very useful. In Python, the situation is even better. There, an object can be thrown as an exception. Moreover, when catching exceptions, you can match an exception by a particular object *or any of its parents*. That means that I can easily extend someone else's work, adding my own exceptions as child objects of the existing ones. When I want to catch exceptions, I can be as specific or as general as I want, and any code designed to catch the more general exceptions will keep working. Java also works this way. Now, on to catching errors. OCaml makes this easy: try (whatever) with End_of_file -> foo | My_custom_error x -> bar x Here, "whatever", "foo", and "bar x" must all be of the same type. If there is no error, whatever is returned. If there is an error that we catch, the given value is returned. Otherwise, the exception is passed on up. Python can work that way, but also adds another feature: try: blah moreblah finally: foo The code "foo" will be executed whenever an exception occurs in the try block, or whenever the block ends normally. In other words, it is *always* executed. This is useful for doing cleanup actions like closing network connections. Haskell's exception catching doesn't really have less functionality than OCaml (some might argue it has more), but it takes a lot more effort to compose, needing to provide a function that returns a function in many cases. The other annoying thing is forcing it to run in the IO monad. I don't really understand this restriction. If we're not dealing with IO code to start with, we have deterministic behavior (if something raises an exception on a given value once, it will do that every time). So why do we have: catchJust :: (Exception -> Maybe b) -> IO a -> (b -> IO a) -> IO a instead of: catchJust :: (Exception -> Maybe b) -> (c -> a) -> c -> (b -> a) -> a This would let us run an arbitrary function (so long as it takes one parameter) and handle the exception completely outside of the IO monad. I can't think of a theoretical reason that this wouldn't work, though I suppose I may be missing something. Thoughts? Flames? :-) -- John

12 29

Network.CGI: <INPUT TYPE="file">?
by Johannes Waldmann 30 Nov '04

30 Nov '04

I am using Network.CGI (with ghc-6.2) How can I use an <INPUT TYPE="file"> element? I guess I know how to produce one: Text.Html.input ! [ Text.Html.name tag , Text.Html.thetype "file" , Text.Html.intAttr "maxlength" 10000 , Text.Html.strAttr "accept" "text/*" ] But to get to the file contents, it seems I should add Text.Html.strAttr "enctype" "multipart/form-data" to the <FORM> element, where I already have Text.Html.method "POST" but then I can't ready any values out of the environment that is provided by Network.CGI.wrapper. The environment then contains , ( "QUERY_STRING", "" ), ( "CONTENT_LENGTH", "1590" ) , ( "CONTENT_TYPE" , "multipart/form-data; boundary=---------------------------1409895718904..." ) Am I doing something wrong, HTML-wise (is it allowed to mix TYPE="file" input with other input elements in one FORM?) or is this a problem with the library? Any help appreciated. -- -- Johannes Waldmann, Tel/Fax: (0341) 3076 6479 / 6480 -- ------ http://www.imn.htwk-leipzig.de/~waldmann/ ---------

3 3

Re: Parameterized Show
by George Russell 30 Nov '04

30 Nov '04

Graham Klyne wrote (snipped): > I like the principle of parameterizing Show to allow for different encoding > environments (indeed, I had wondered as I was writing my earlier message if > the two cases were really sufficient). Indeed, in the application area > that interests me (Semantic Web) it could be beneficial to have different > encoding options corresponding to different serializations of RDF (e.g. > RDF/XML and Notation3). I like the idea too, not just for Show but for any instances. It seems to me that in general you should be able to combine the convenience of the Haskell type system with the power of Standard ML's structures and functors. Something along these lines was done by Kahl & Scheffczyk ("Named Instances for Haskell Type Classes", Haskell Workshop 2001). In general I suspect you can do this without even having to extend the existing Haskell typesystem very far. The following language extensions seem sufficient. (1) for a class declaration, a way of declaring that a certain type represents a dictionary of functions for that class, for example class Show a (ShowDict,appFn) where ... would define the new class "Show" but also the new type (ShowDict a) representing dictionaries for that class. It also declares a value appFn which I shall explain in a moment. (2) for an instance declaration, a way of "naming" the corresponding dictionary. instance Show Int (intShowDict) where would create a value "intShowDict :: ShowDict Int" (3) a way of using the dictionary. For this we need (appFn), declaraed by the type declaration. appFn has the unorthodox type appFn :: ShowDict a -> (forall a . Show a => b) -> b

19 73

Problems with using the memo-function
by Tom Hofte 30 Nov '04

30 Nov '04

Dear all, I have a problem when I use the memo-function to implement a dynamic programming algorithm to traverse a graph. I use the memo-function in the code below: dynamicPropagationUpAlg cname graph = let mh n = memo h n h n = let annotsuccs = (nub (concat (map (memo h) (succs n)))) in -- When the annotation set of the -- current node is empty, then we have to -- perform a if (length (myannots n) == 0) && ((length annotsuccs) > 1)then {- if length (succs n) > 1 then error ("<<Annotation failure>> Interface has to be annotated. "++(show n)) else -} case (trace ("Analyzing in component "++cname++"..\n"++"Before renaming successors annotations\n"++"Check for cycles in: \n"++"Comp: "++(getCompname n)++" Intf: "++(getIntfname n)++" Inst: "++(getFunname n)) (hasCycleInAnnots annotsuccs)) of Nothing -> map (replaceFunname (getCompname n)(getFunname n)) annotsuccs jMessage@(Just a) -> error (fromJust jMessage) else let mergeannots = mergeAnnotSets (annotsuccs++(myannots n)) (myannots n) in case (trace ("Analyzing in component "++cname++"..\n"++"After merging successors annotations\n"++"Check for cycles in: \n"++"Comp: "++(getCompname n)++" Intf: "++(getIntfname n)++" Inst: "++(getFunname n)) (hasCycleInAnnots mergeannots)) of Nothing -> mergeannots jMessage@(Just a) -> error (fromJust jMessage) g n@(InterfaceNode (annots, bo ,tp) names) = (InterfaceNode ((memo h n), bo, tp) names) succs n = (getSuccsOfNode n graph) myannots (InterfaceNode (annots,b,tp) names) = annots nodes = listNodes graph getFunname (InterfaceNode (annots, bo ,tp) (c,t,i)) = i getCompname (InterfaceNode (annots, bo ,tp) (c,t,i)) = c getIntfname (InterfaceNode (annots, bo ,tp) (c,t,i)) = t in map (g) nodes The idea is that the every node in the graph is visited only once, moreover that the function "h" is computed only once for every node. My implementation is not working properly. I don't know the cause for my problem, so can anyone hint me one the right use of the memo-function? Thanks in advance.. Kind regards, Tom

1 0

HaXml
by Dominic Steinitz 28 Nov '04

28 Nov '04

I'd be grateful for some help on using HaXml. 1. I can parse a String into a Document but it's not clear how you operate on it as the combinators all operate on Content. The only function I could find that operated on a Document was "document" in Pretty. 2. I can construct a CFilter but it's not clear how you operate on it. How do I calculate the number of components of an Element? What I would like to do is accept "vname" (with 3 elements) and reject "iname" (with 4 elements). I'd also like to check that the characters in givenName, initial and familyName are in a given range (for example upper case or between ' ' and '~'). Thanks, Dominic. import Text.XML.HaXml import Text.XML.HaXml.Pretty xmlName = "<Name><givenName>John</givenName>" ++ "<initial>P</initial>" ++ "<familyName>Smith</familyName>" ++ "</Name>" d = document $ xmlParse "tmp" xmlName gn = mkElemAttr "givenName" [] [literal "John"] i = mkElemAttr "initial" [] [literal "P"] fn = mkElemAttr "familyName" [] [literal "Smith"] validName = mkElemAttr "Name" [] [gn,i,fn] invalidName = mkElemAttr "Name" [] [gn,i,i,fn] vname = processXmlWith validName iname = processXmlWith invalidName *Main> d <Name ><givenName >John</givenName ><initial >P</initial ><familyName >Smith</familyName></Name> *Main> *Main> vname <?xml version='1.0'?> <Name ><givenName >John</givenName ><initial >P</initial ><familyName >Smith</familyName></Name> *Main>

2 1

RE: ANNOUNCE: Haskell support for Visual Studio .NET 2003 and Assignment Manager tools
by Morris Sim 27 Nov '04

27 Nov '04

Congratulations! Shan and Rogerio, please get in contact with Andre. I would love to see a demo of this. Thanks Morris ________________________________ From: Andre W B Furtado [mailto:andrewilsonfurtado@yahoo.com.br] Sent: Wed 11/24/2004 22:37 To: haskell(a)haskell.org Cc: visualhaskell(a)haskell.org; Morris Sim Subject: ANNOUNCE: Haskell support for Visual Studio .NET 2003 and Assignment Manager tools We are pleased to announce an alpha/preview version of VHS (Visual Haskell), which integrates the Haskell functional language with the Microsoft Visual Studio .NET 2003 IDE, and VHS-AM, which allows the use of VHS with the Microsoft Assignment Manager tools. This preview version supports: - Syntax coloring - Brace matching through CTRL+] (including "module/where", "let/in", etc.)* - Brace highlighting (including "module/where", "let/in", etc.)* - Brace matching text indicated in the status bar - "TODO" comments in code are added to the task list and can be reached by double-clicking it - Quick-info* - Word-completion* - Method tip* - Member-list popup* - Haskell Console Application creation - Haskell Console Application compilation (integrated with GHC) - Haskell Console Application execution - The presence of parse errors is indicated on-the-fly in the task list (specific errors are still not specified) - Error source location can be reached by double-clicking the task list - Haskell Assignment Manager exercise creation and advertisement - Haskell Assignment Manager exercise answering and submission - Compilation checking (via GHC) and output checking of Haskell exercises by Assignment Manager server Please note that this first release of VHS has some known bugs: - A VS.NET session can become unstable if you open a .hs file or create a Haskell Console Application project. - After opening a .hs file, the devenv.exe process is not being killed when VS.NET exits. - The above features marked with * sometimes do not work 100% as expected, mainly if the haskell module under development has errors. - Some features do not work in a "inter-module fashion". - The Visual Haskell logo does not disappear from VS.NET splash screen after uninstall. Note: development of a Visual Studio plugin for Haskell has been proceeding on two fronts. Simon Marlow & Krasimir Angelov have been working on adding complete editor support and a project framework integrated with Cabal, whereas this release is based on a fork of the codebase several months ago, and has a different feature set. We hope to combine these versions and make further releases in the future. Downloads, documentation and screenshots can be found in: http://www.cin.ufpe.br/~haskell/vhs-am/ http://www.cin.ufpe.br/~haskell/vhs/ The VHS/VHS-AM team is: - Simon Marlow - Krasimir Angelov - Andre Santos - Andre Furtado - Mauro La-Salette - Marden Costa This project was partially supported by a MS grant for extending the Assignment Manager tool.

1 0

Symposium on Principles of Programming Languages 2005: Call for Participation
by David Walker 26 Nov '04

26 Nov '04

POPL 2005 Call for Participation 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/ 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. Important Dates * Hotel reservation deadline: December 21, 2004 * Reduced fees deadline: December 30, 2004 (11:59 PM, EST USA) - Register at http://www.regmaster.com/popl2005.html * Main conference: January 12-14, 2005. * Affiliated events: January 10-11 and January 15, 2005 Invited Speakers * Pat Hanrahan (Stanford University) * Rob Pike (Google): Interpreting the Data * Peter Selinger (University of Ottawa): Programming Languages for Quantum Computing Location & Hotel The POPL 2005 conference site is Hyatt Regency Long Beach, 200 South Pine Avenue, Long Beach, CA. Complete information concerning how to book rooms and travel to Long Beach may be found at the conference web site (http://www.cs.princeton.edu/~dpw/popl/05/) The Hyatt Regency is right next to a variety of entertainment areas, including the Shoreline Village, the Rainbow Harbor, and the Shoreline Marina, which offer sport fishing, boat rentals, personal boat rentals, shopping, great food and other diversions. For those wishing to take in some sun this January, one can walk east from the hotel, about a 1/4 mile, along the Shoreline Marina, to a large, sandy, public beach. In addition, the remarkable Aquarium of the Pacific, which houses more than 12,500 animals and offers the possibility of coming face-to-face or even touching the world's greatest predators, is only a 1/4 mile west. On Thursday January 13th, we will be having a tour and banquet on the Queen Mary ocean liner. Be sure to reserve your room by December 21st, 2004 and register for the conference by December 30th, 2004. Program Wednesday, Jan 12 8:30AM -- 9:30AM: Invited talk: Interpreting the Data, Rob Pike (Google) 10AM Session: * Associated Types with Class - Manuel Chakravarty, Gabriele Keller, Simon Peyton-Jones, Simon Marlow * Environmental Acquisition Revisited - Richard Cobbe, Matthias Felleisen * Polymorphic Bytecode: Compositional Compilation for Java-like Languages - Davide Ancona, Ferrucio Damiani, Sophia Drossopoulou, Elena Zucca * A Simple Typed Intermediate Language for Object-Oriented Languages - Juan Chen, David Tarditi 1:30PM Session: * Parametric Polymorphism for XML - Haruo Hosoya, Alain Frisch, Giuseppe Castagna * A Bisimulation for Type Abstraction and Recursion - Eijiro Sumii, Benjamin Pierce * A Syntactic Approach to Eta Equality in Type Theory - Healfdene Goguen * Slot Games: A Quantitative Model of Computation - Dan Ghica 4PM Session: * Synthesis of Interface Specifications for Java Classes - Rajeev Alur, Pavol Cerny, P. Madhusudan, Wonhong Nam * Dynamic Partial-Order Reduction for Model Checking Software - Cormac Flanagan, Patrice Godefroid * Proof-Guided Underapproximation-Widening for Multi-Process Systems - Orna Grumberg, Flavio Lerda, Ofer Strichman, Michael Theobald * Transition Predicate Abstraction and Fair Termination - Andreas Podelski, Andrey Rybalchenko 6PM: Business meeting / PC report Thursday, Jan 13 8:30AM: Invited talk: Programming Languages for Quantum Computing, Peter Selinger (University of Ottawa) 10AM Session: * Communicating Quantum Processes - Simon Gay, Rajagopal Nagarajan * Downgrading Policies and Relaxed Noninterference - Peng Li, Steve Zdancewic * A Probabilistic Language Based Upon Sampling Functions - Sungwoo Park, Frank Pfenning, Sebastian Thrun * Mutatis Mutandis: Safe and Predictable Dynamic Software Updating - Gareth Stoyle, Michael Hicks, Gavin Bierman, Peter Sewell, Iulian Neamtiu 1:30PM Session: * Transactors: A Programming Model for Maintaining Globally Consistent Distributed State in Unreliable Environments - John Field, Carlos Varela * Theoretical Foundations for Compensations in Flow Composition Languages - Roberto Bruni, Hernan Melgratti, Ugo Montanari * From Sequential Programs to Multi-Tier Applications by Program Transformation - Matthias Neubauer, Peter Thiemann * Combinators for Bi-Directional Tree Transformations: A Linguistic Approach to the View Update Problem - Nathan Foster, Michael Greenwald, Jonathan Moore, Benjamin Pierce, Alan Schmitt 4:30PM: Tour and conference dinner on the Queen Mary ocean liner Friday, Jan 14 8:30AM: Invited talk, Pat Hanrahan (Stanford University) 10AM Session: * Separation Logic and Abstraction - Matthew Parkinson, Gavin Bierman * Permission Accounting in Separation Logic - Richard Bornat, Cristiano Calcagno, Peter O'Hearn, Matthew Parkinson * Context Logic and Tree Update - Cristiano Calcagno, Philippa Gardner, Uri Zarfaty * Connecting Effects and Uniqueness with Adoption - John Tang Boyland, William Retert 1:30PM Session: * A Semantics for Procedure-Local Heaps and its Abstractions - Noam Rinetzky, Jörg Bauer, Thomas Reps, Mooly Sagiv, Reinhard Wilhelm * Region-Based Shape Analysis with Tracked Locations - Brian Hackett, Radu Rugina * Precise Interprocedural Analysis using Random Interpretation - Sumit Gulwani, George Necula * Numeric Analysis of Array Operations - Denis Gopan, Thomas Reps, Mooly Sagiv 4PM Session: * Scalable Error Detection using Boolean Satisfiability - Yichen Xie, Alex Aiken * Automated Soundness Proofs for Dataflow Analyses and Transformations via Local Rules - Sorin Lerner, Todd Millstein, Erika Rice, Craig Chambers * The Java Memory Model - Jeremy Manson, William Pugh, Sarita Adve 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, Bell Labs, Lucent / DePaul University Andrew Kennedy, Microsoft Research (Cambridge) Naoki Kobayashi, Tohoku University 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 Treasurer: Manuel Fähndrich Publicity: David Walker

1 0