January 2010 - Haskell

Signature error because the order
by Luis Cabellos 14 Jan '10

14 Jan '10

Hi, I found than this piece of code causes an error in GHC ( * http://haskell.pastebin.com/m5e3f4a4c* ): data Tree a = Leaf a | Node (Tree a) (Tree a) --prettyShow :: (Show a, Num a) => Tree a -> String -- WORKS prettyShow :: (Num a, Show a) => Tree a -> String -- FAILS prettyShow (Leaf a) = show a prettyShow (Node a b) = (simple a) ++ (simple b) simple :: (Show a, Num a) => Tree a -> String simple (Leaf x) = prettyShow (Leaf x) simple x = "(" ++ prettyShow x ++ ")" With the error: test.lhs:14:0: Couldn't match expected type `Show a' against inferred type `Num a1' When matching the contexts of the signatures for prettyShow :: forall a. (Num a, Show a) => Tree a -> String simple :: forall a. (Show a, Num a) => Tree a -> String The signature contexts in a mutually recursive group should all be identical When generalising the type(s) for prettyShow, simple Failed, modules loaded: none. But if I change the order of *Show* and *Num* in the signature of * prettyShow* it works. It's a GHC problem? it's normal than signature is order-dependent? I use *GHC 6.10.3* Thanks, Luis Cabellos -- LC, ("There is no Dana, only Zuul." - Cazafantasmas [1984])

3 2

Two PhD positions in theoretical computer science
by Alexandra Silva 14 Jan '10

14 Jan '10

Vacancies for PhD positions in theoretical computer science =========================================================== Leiden Institute of Advanced Computer Science (LIACS) of Leiden University and Centrum Wiskunde & Informatica (CWI) in Amsterdam are looking for two PhD students for working in the NWO funded research project CoRE: Coinductive Calculi of Regular Expressions The purpose of the project is to use the theory of coalgebras and Kleene algebras for automatic reasoning and verification of quantitative and probabilistic systems, interactive systems and advanced functional programs. We are looking for excellent candidates with a background (Master degree) in mathematics, computer science or a related degree and who have strong interest in the mathematical foundations of computer science. Conditions of employment ------------------------ There are two PhD positions available. One candidate will be employed at LIACS in the Foundations of Software Technology (FAST) group. The other will be employed at CWI in the Coordination Languages group (SEN3) in the sub-group `Coalgebraic Models of Computation' led by Prof. Jan Rutten. Both groups provide a dynamic and productive work environment, are in close collaboration with each other and are involved in several national and international research projects. Both PhD candidates will be appointed for a period of four years and will receive salary based on a full-time employment. The salary and labour agreements are in accordance with the CAO for Dutch universities and research institutes. How to Apply? ------------- You are invited to send your application letter together with a curriculum vitae (including a list of master courses), an abstract of your master thesis or a list of publications, and the names and contact addresses of two potential referees. Please send your application before 1 March 2010 to: Marcello Bonsangue <marcello(a)liacs.nl> and Milad Niqui <M.Niqui(a)cwi.nl>

1 0

ANN: HaXml-1.20.1
by Malcolm Wallace 13 Jan '10

13 Jan '10

I am pleased to announce a new, stable, release of HaXml. (Actually, 1.20 has been available for some time, but I am just getting round to the announcement, and a fresh bugfix means a version bump to 1.20.1.) HaXml-1.20.1 ------------ http://haskell.org/HaXml http://hackage.haskell.org/package/HaXml If you have been using the previous stable version, 1.13.x, you are strongly encouraged to upgrade, as no further bugfixes will be back- propagated. (Ideally, Cabal and Hackage should also now cease to recommend 1.13.x as a preferred version, but I do not know how to change that. A simple "cabal install HaXml" will unfortunately still find 1.13.x, so please use "cabal install HaXml-1.20.1" with explicit version number.) There have been significant API changes since 1.13.x, and a brief migration guide is included on the website. In summary: * There is a SAX-like stream parser. * Ordinary parsing of XML documents can now also be lazy. * Some types have changed. * Some old classes have been re-arranged into a single new class. Regards, Malcolm

2 1

AST 2010 reminder--call for papers and presentations
by John Hughes 12 Jan '10

12 Jan '10

Just a reminder: the submission deadline for AST 2010 (Automation of Software Test 2010, associated with ICSE 2010 in Cape Town) is only a week away. If you're planning to submit a paper or a presentation for the workshop, then now's the time to be putting it together! http://www.cs.allegheny.edu/ast2010/ John Hughes

1 0

Job at Mylife
by Julien Verlaguet 12 Jan '10

12 Jan '10

Dear Haskell Programmers, Our company, MyLife, is continuing to seek OCaml programmers to expand our team in the Silicon Valley. We develop back-end people search technologies and the vast majority of our code is written in Objective Caml and runs on Linux. We love that as it provides us with an opportunity to tackle on big challenges with great productivity. We are now looking for talented and passionate people to share the fun in Mountain View, California. The primary requirements for the job are: - proficiency in a functional programming language and eventually OCaml - familiarity with Linux and shell scripting - proficiency in written English, as much of our team communications are written (brainstorms, bug reports, etc.) - ability to understand end-user requirements and translate them into robust software that gets the job done The ideal candidate will have a good nose for hunting bugs, diagnosing performance problems, and hacking his/her way through colleagues' code. Please contact us at ocaml-job(a)mylife.com if you are interested or might be interested in the future. Julien

1 0

Open Position (PhD student or Postdoc), U Tübingen, Germany
by Torsten Grust 11 Jan '10

11 Jan '10

[ Dear Haskellers! This job opening may sound a bit database-ish on a first read, but there is lots of Haskell and functional programming inside. Please contact me if you're in doubt. Best wishes, --Torsten ] Join us on the fringes between database and programming languages The Database Systems Research Group (Prof. Torsten Grust) at the Wilhelm-Schickard-Institute for Computer Science of Eberhard Karls Universität Tübingen, Germany, opens a position for a Research Assistant (PhD student or Postdoc level, three-year, full-time) in the Ferry research project[1]. Ferry explores how far we can push the idea of relational database engines that support the super-fast execution of programs written in a variety of programming languages. Our current focus is on LINQ, Ruby, and Philip Wadler's Links, but consider this list as open-ended. = DATABASE-SUPPORTED PROGRAM EXECUTION = We search for, design, and implement new compilation strategies that map data types and idioms prevalent in (functional) programming and scripting languages into efficient database queries. Ferry targets off-the-shelf SQL database systems as well as a number of off-beat database engines (e.g., X100, MonetDB, or kdb+). We build on technology developed in the context of our project Pathfinder[2]. Implementation languages are Haskell, O'Caml and C. This demo video[3] provides a flavor of the ideas behind Ferry. Ferry is supported by the DFG (German Research Foundation). = REQUIREMENTS = We are looking forward to grow our team and welcome applications of highly motivated candidates with an excellent university degree (Master in Computer Science or a closely related field) who are willing to develop and shape the future of Ferry. If you are a database person, that's great. If you are into (functional) programming languages, that's perfect. (Yes, we love SQL /and/ Haskell.) Last but not least, we hope that you like systems building as much as we do. The position has no teaching obligations -- if you would like to get involved with teaching nevertheless, please let us know. Good knowledge of English (research and publication) is a requirement, a reasonable command of German will be helpful. = JOB DETAILS AND APPLICATION = Successful candidates will sign a contract with the Universität Tübingen under the current regulations applicable to employees in Public Service (TV-L). This is a three-year full-time position. The exact start date in the time frame March till May 2010 is negotiable. You will be working in Tübingen, the traditional university town in the Neckar valley (Stuttgart region). Our group offers an informal, open, and fun working environment. Universität Tübingen aims at increasing the number of female employees and thus especially welcomes applications of female candidates. Applications of disabled candidates will be given priority, depending on their suitability. Please send your complete application in PDF format via e-mail to Prof. Torsten Grust (torsten.grust(a)uni-tuebingen.de) The deadline for applications is Feburary 19, 2010. Inquiries with respect to this position may be directed to Prof. Torsten Grust +49 7071 / 29 75477 torsten.grust(a)uni-tuebingen.de www-db.informatik.uni-tuebingen.de [1] http://www.ferry-lang.org/ [2] http://www.pathfinder-xquery.org/ [3] http://bit.ly/4GKEhQ (MP4, approx. 10MB), or http://www.youtube.com/watch?v=JRKmRiW_v4Q&fmt=18 (YouTube) -- | Prof. Dr. Torsten Grust torsten.grust(a)uni-tuebingen.de | | www-db.informatik.uni-tuebingen.de | | Database Systems - Universität Tübingen (Germany) |

1 0

ANNOUNCE: Palindromes 0.2
by Johan Jeuring 10 Jan '10

10 Jan '10

Palindromes 0.2 ============================================== Palindromes is a package for finding palindromes in files. Palindromes 0.2 is now available on hackage. Visit the homepage http://www.jeuring.net/Palindromes/ In version 0.2, the following features have been added: - Read from standard input, via the flag -i - More flexible flag handling - Read multiple files - Specify minimum length of palindromes returned, via the flag -m int For more information, consult the README file in the distribution. -- Johan Jeuring

1 0

Haskell Weekly News: Issue 145 - January 10, 2010
by jfredett＠gmail.com 10 Jan '10

10 Jan '10

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20100110 Issue 145 - January 10, 2010 --------------------------------------------------------------------------- Welcome to issue 145 of HWN, a newsletter covering developments in the [1]Haskell community. Welcome back Haskellers to the HWN! After a short hiatus we return with a megaedition covering the last three weeks of Haskell news and discussion. Needless to say, lots of new package and event announcements, as well as some really great discussions (the discussion about 'lawless' uninstances of Functors was particularly interesting) over the holiday break. Hopefully everyone had a safe and happy holiday season, and is back now steadily working off the winter-weight (in accordance with resolutions or no) by tapping steadily at the keyboard, producing wonderful new packages for me to place in this, your Haskell Weekly News! Announcements Last CfP for TGC 2010: EXTENDED deadline Jan. 20 2010. Emilio Tuosto [2]announced an extension to the TGC'10 call for papers. SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0. Ivan Lazar Miljenovic [3]announced new releases of the SourceGraph and Graphalyze packages. Streaming Component Combinators 0.4. Mario Blazevic [4]announced version 0.4 of Streaming Component Combinators (SCC). safer-file-handles-0.1. Bas van Dijk [5]announced a new member of the 'monadic regions' family -- safer-file-handles. This package provides safety features on top of System.IO for handling file handles and operations. HOR 2010 1st CALL FOR ABSTRACTS. Frederic Blanqui [6]1f4e gmane.comp.lang.haskell.general/17710 announced the first call for abstracts for the Fifth International Workshop on Higher-Order Rewriting. vty-4.2.1.0. Corey O'Connor [7]announced a new version of the vty package. stm-io-hooks-0.6.0. Peter Robinson [8]announced a new version of stm-io-hooks. This version includes major interface changes, including the elimation of the 'onRetry' combinator. hecc-0.2. Marcel Fourne [9]announced the second release of his elliptic curve cryptography package, hecc. This release includes a license change to the BSD3 license, speed improvements, and new algorithms for point multiplication, as well as other changes. ghc-6.12.1 binary package for OpenSolaris. Michael Lee [10]announced a binary package availability of ghc-6.12 for OpenSolaris. Final Call for Participation: TLDI'10. Andrew Kennedy [11]announced the final call for participation in TLDI'10, the Workshop on Types in Language Design and Implementation. Haskell Web News: Looking back on 2009. Don Stewart [12]announced The Haskell Web News, a monthly summary of the hottest news about the Haskell programming language. hakyll-0.4. Jasper Van der Jeugt [13]announced the release of hakyll, a static site generator library. system-uuid-1.2.0. Jason Dusek [14]announced a new release of system-uuid. New versions of ALL the monadic regions packages. Bas van Dijk [15]announced a new version of all of the monadic regions packages, explanation of what this means is best left to the original post, linked previously. tuntap-0.0.1. John Van Enk [16]announced a new package, extracted from his in-progress VPN project. This package provides access to the TUN/TAP device in Linux. CPython / libpython bindings. John Millikin [17]announced a package providing bindings to the C API for CPython/libpython. Discussion Typed Configuration Files. Sebastian Fischer [18]asked about whether there was an analogue to CmdArgs for config files. Review request for my permutations implementation. CK Kashyap [19]asked for a review of his implementation of a function for finding permutations -- in addition to a review he asked for earlier for code involving monads. The result is a nice pair of threads with introductory material about idiomatic, efficient Haskell code. lawless instances of Functor. Paul Brauner [20]asked about 'lawless' instances (Editor's Note: more so -- 'uninstances', since by definition, it cannot be a functor without satisfying the laws, even if it an instance can be written) of the `Functor` class. This is in an effort to better understand how Functors work in Haskell and in the wider theory. Blog noise [21]Haskell news from the [22]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Neil Mitchell: [23]Using .ghci files to run projects. * Tom Moertel: [24]A formal language for recipes: brain dump. * Mark Jason Dominus: [25]A monad for probability and provenance. * Alex Mason: [26]A small follow up. * Russell O'Connor: [27]Constructive Classical Completeness. * Galois, Inc: [28]GHC Nominated for Programming Language Award. * Neil Brown: [29]CHP vs CML, Forking and Picky Receivers. * Conal Elliott: [30]Is Haskell a purely functional language?. * Conal Elliott: [31]Can functional programming be liberated from the von Neumann paradigm?. * Real-World Haskell: [32]Real World Haskell in Japaneseâå®æŠã§åŠã¶é¢æ°åèšèªããã°ã©ãã³ã°. * Conal Elliott: [33]Garbage collecting the semantics of FRP. * Alex Mason: [34]Why I love Cereal. * Mark Jason Dominus: [35]A short bibliography of probability monads. * Conal Elliott: [36]Communication, curiosity, and personal style. * Epilogue for Epigram: [37]Bidirectional Basics. * Neil Mitchell: [38]Explaining Haskell IO without Monads. * Conal Elliott: [39]Is program proving viable and useful?. * Conal Elliott: [40]Why program with continuous time?. Quotes of the Week * fasta: Haskell is like an efficient version of Python and is used for the same things. * koeien37: there are the languages that everybody complains about, and the languages that nobody use * Pseudonym: Olegs can be warded off by adding a note claiming that it's impossible to implement in the type system. * elly: I leave for five minutes and godel numbering of endofunctors is invokved as a potential proof that the universe is simulated. Thanks, #haskell :P * kmc: a monad is like an invisible train filled with jello traveling backwards in time * conal: "Obviously" is one of those words that is most useful when it is least true * Jafet: Javascript is pretty much a DSL for making your web browser take up more CPU * copumpkin: limpac: in this channel we're all automata with no feelings, except for the occasional feeling of hate. * dmhouse: I'm not sure it's working correctly but it sure is fast... * Cale: We need a bunch of "Will it monad?" video clips, with "It monads!" at the end of each. * merijn: I run on HST (Hacker Standard Time) which is essentially current time zone -3 * ray: [about an anti-FP blog post] i came up with some contrived example, announced that it's impossible, and therefore FP sucks * hiredman: I used to think "dons" was a title, like people who were recognized as being really good at haskell were called dons About the Haskell Weekly News New editions are posted to [41]the Haskell mailing list as well as to [42]the Haskell Sequence and [43]Planet Haskell. [44]RSS is also available, and headlines appear on [45]haskell.org. To help create new editions of this newsletter, please see the information on [46]how to contribute. Send stories to jfredett . at . gmail . dot . com. The darcs repository is available at darcs get [47]http://patch-tag.com/r/jfredett/HWN2/pullrepo HWN2 . References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/17716 3. http://article.gmane.org/gmane.comp.lang.haskell.general/17714 4. http://article.gmane.org/gmane.comp.lang.haskell.general/17713 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17711 6. http://article.gmane.org/ 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17705 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17704 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17701 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17700 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17699 12. http://article.gmane.org/gmane.comp.lang.haskell.general/17698 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68864 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68857 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68827 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68807 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/68388 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68865 19. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68811 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/68711 21. http://planet.haskell.org/ 22. http://haskell.org/haskellwiki/Blog_articles 23. http://neilmitchell.blogspot.com/2010/01/using-ghci-files-to-run-projects.h… 24. http://blog.moertel.com/articles/2010/01/08/a-formal-language-for-recipes-b… 25. http://blog.plover.com/prog/haskell/probmonad.html 26. http://random.axman6.com/blog/?p=139 27. http://r6.ca/blog/20100107T035902Z.html 28. http://www.galois.com/blog/2010/01/06/ghc-nominated-for-programming-languag… 29. http://chplib.wordpress.com/2010/01/06/chp-vs-cml-forking-and-picky-receive… 30. http://conal.net/blog/posts/is-haskell-a-purely-functional-language/ 31. http://conal.net/blog/posts/can-functional-programming-be-liberated-from-th… 32. http://www.realworldhaskell.org/blog/2010/01/05/real-world-haskell%e2%80%94… 33. http://conal.net/blog/posts/garbage-collecting-the-semantics-of-frp/ 34. http://random.axman6.com/blog/?p=124 35. http://blog.plover.com/prog/haskell/probmonad-refs.html 36. http://conal.net/blog/posts/communication-curiosity-and-personal-style/ 37. http://www.e-pig.org/epilogue/?p=283 38. http://neilmitchell.blogspot.com/2010/01/haskell-io-without-monads.html 39. http://conal.net/blog/posts/is-program-proving-viable-and-useful/ 40. http://conal.net/blog/posts/why-program-with-continuous-time/ 41. http://www.haskell.org/mailman/listinfo/haskell 42. http://sequence.complete.org/ 43. http://planet.haskell.org/ 44. http://sequence.complete.org/node/feed 45. http://haskell.org/ 46. http://haskell.org/haskellwiki/HWN 47. http://patch-tag.com/r/jfredett/HWN2/pullrepo%20HWN2

1 0

ANNOUNCE: SourceGraph-0.6.0.0 and Graphalyze-0.9.0.0
by Ivan Lazar Miljenovic 10 Jan '10

10 Jan '10

I'm pleased to announce the latest releases of SourceGraph [1] and Graphalyze [2]. [1]: http://hackage.haskell.org/package/SourceGraph [2]: http://hackage.haskell.org/package/Graphalyze SourceGraph is a program that performs static code analysis on Haskell projects on the by applying graph theoretic techniques to the project's call graph. Graphalyze is a library for analysing discrete data using graph theory, and as such performs the heavy lifting for SourceGraph. Sample analysis reports generated by SourceGraph are available at http://code.haskell.org/~ivanm/Sample_SourceGraph/SampleReports.html . I will also be demoing SourceGraph at PEPM [3] in Madrid on 19 January. [3]: http://www.program-transformation.org/PEPM10/ Changes since the previous version include: * Now supports "implicitly exported" entities (as requested by Curt Sampson). This includes instantiated class methods from other modules and functions, etc. that start with an underscore (see http://www.haskell.org/ghc/docs/latest/html/users_guide/options-sanity.html for more information). * All inaccessible entities are now reported, not just those that were root nodes in the call graph. * Edges are now colour-coded based upon whether they are part of a clique, cycle or a chain. * Level-based analyses: visualise how deep an entity is from those exported entities. * A re-done TODO that lists in detail what is planned for SourceGraph. * Lots of under-the-hood changes that don't sound as interesting as the above :-( -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

2 4

Last CfP for TGC 2010: EXTENDED deadline Jan. 20 2010
by Emilio Tuosto 09 Jan '10

09 Jan '10

Due to several requests, the TGC'10 chairs have decided to extend the deadline for submsissions to January 20th ================================================================ Call for Papers TGC 2010 Fifth International Symposium on TRUSTWORTHY GLOBAL COMPUTING http://www.pst.ifi.lmu.de/tgc2010 LMU, Munich, February 26-26, 2010 ---------------------------------------------------------------- co-located with the review of FP6 GCII projects AEOLUS and SENSORIA ================================================================ IMPORTANT DATES --------------- Paper submissions: January 20, 2010 EXTENDED Final version (pre-proc.): February, 2010 Conference: February 24-26, 2010 Final version (post-proc.): March 22, 2010 SCOPE ------ The Symposium on Trustworthy Global Computing is an international annual venue dedicated to safe and reliable computation in global computers. It focuses on providing frameworks, tools, and protocols for constructing well-behaved applications and on reasoning rigorously about their behaviour and properties. The related models of computation incorporate code and data mobility over distributed networks with highly dynamic topologies and heterogeneous devices. We solicit papers in all areas of global computing, including (but not limited to): * theories, models and algorithms for global computing and service oriented computing * language concepts and abstraction mechanisms * security through verifiable evidence * resource usage and information flow policies * game-theoretic approaches to selfishness * verification of cryptographic protocols and their use * trust, access control and security enforcement mechanisms * sharing information and computation * efficient communication * self configuration, adaptation, and dynamic components management * software principles to support debugging and verification * test generators, symbolic interpreters, type checkers * model checkers, theorem provers, static analyzers * approximation algorithms, impossibility results, and structural properties * privacy, reliability and business integrity SUBMISSION DETAILS ------------------ Papers can be submitted online through the EASYCHAIR website http://www.easychair.org/conferences/?conf=tgc2010 Contributions must be in Postscript or PDF and consist of no more than 15 pages in the Springer LNCS style. Additional details and proofs omitted due to space limitations may be included in a clearly marked appendix. Submitted papers must describe work unpublished in refereed venues, and not submitted for publication elsewhere. PROCEEDINGS ----------- We plan to publish Springer LNCS post-proceedings shortly after the conference, to give the authors the opportunity to take into account discussions and suggestions at the conference. Pre-proceedings with the accepted papers will be made available at the conference. ORIGINS & PLANS --------------- In 2010, the symposium is co-located with the reviews of the following FP6 GCII projects: AEOLUS - Algorithmic Principles for Building Efficient Overlay Computers SENSORIA - Software Engineering for Service-Oriented Overlay Computers TGC 2008, the fourth Symposium on Trustworthy Global Computing, was held in Barcelona (Spain), on November 3 - 4, 2008. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2007 was held on November 5-6, 2007 in Sophia-Antipolis, France and it was followed by the Workshop on the Interplay of Programming Languages and Cryptography on November 7, 2007. The symposium was co-located with the reviews of the FP6 GCII projects AEOLUS, MOBIUS and SENSORIA. TGC 2006 was held in Lucca (Italy), on November 7 - 9, 2006 and it was co-located with the reviews of EU FET-IST FP6 Projects AEOLUS, MOBIUS, SENSORIA and CATNETS. The first TGC event took place in Edinburgh on April 7-9, 2005 with the co-sponsorship of IFIP TC-2, as part of ETAPS 2005. TGC 2005 was the evolution of the previous Global Computing I Workshops held in Rovereto in 2003 and 2004 (see e.g. LNCS 2874) and the workshops on Foundation of Global Computing held as satellite events of ICALP and Concur (see e.g. ENTCS Vol. 85). STEERING COMMITTE ----------------- Gilles Barthe (IMDEA Software, Madrid) Rocco De Nicola (University of Florence) Christos Kaklamanis (University of Patras) Ugo Montanari (University of Pisa) Davide Sangiorgi (University of Bologna) Don Sannella (University of Edinburgh) Vladimiro Sassone (University of Southampton) Martin Wirsing (University of Munich) PROGRAM CHAIRS -------------- Martin Hofmann - hofmann(a)tcs.ifi.lmu.de Institut fur Informatik, LMU Munich Martin Wirsing - wirsing(a)lmu.de Institut fur Informatik, LMU Munich PROGRAM COMMITTEE (to be invited!) ----------------- * Gilles Barthe (IMDEA Software, Madrid) * Roberto Bruni (University of Pisa) * Rocco De Nicola (University of Florence) * Howard Foster (Imperial College) * Samir Genaim (Universidad Complutense de Madrid) * Stefania Gnesi (ISTI, Pisa) * Martin Hofmann (LMU Munich) (co-chair) * Thomas Jensen (IRISA, Rennes) * Christos Kaklamanis (University of Patras) * Alberto Marchetti-Spaccamela (University of Roma "La Sapienza") * Paddy Nixon (University College Dublin) * Giuseppe Persiano (University of Salerno) * Geppino Pucci (University of Padova) * Paola Quaglia (University of Trento) * Don Sannella (University of Edinburgh) * Vladimiro Sassone (University of Southampton) * Maria J. Serna (Universitat Politècnica de Catalunya) * Carolyn Talcott (SRI International) * Emilio Tuosto (University of Leicester) * Nobuko Yoshida (Imperial College London) * Martin Wirsing (LMU Munich) (co-chair) * Franco Zambonelli (University of Modena) LOCAL ORGANIZATION ------------------ * Nora Koch (chair) * Axel Rauschmayer * Gefei Zhang -- *************************************************************** Emilio Tuosto Department of Computer Science University of Leicester Leicester, LE1 7RH United Kingdom Tel. +44 (0) 116 252 5392 Fax. +44 (0) 116 252 3915 homepage -> http://www.cs.le.ac.uk/people/et52 ***************************************************************

1 0