May 2006 - Haskell - Haskell.org

GHC Hackathon
by Simon Peyton-Jones 23 May '06

23 May '06

Friends, A couple of weeks ago Simon M advertised the possibility that he and I might run a "GHC Hackathon", in Portland, later this year prior to ICFP (Sept 14-16 or thereabouts). The idea is that we'd give an extended tutorial about GHC's glorious innards. Then we'd have some hacking time in which you can pick something which you think GHC could do better, and implement it, with Simon and me wandering causing trouble. (E.g. look at GHC's list of tasks http://hackage.haskell.org/trac/ghc/report/2, but don't limit yourself to those.) We're trying to find out whether anyone would come if we ran it. At the Haskell workshop in Tallinn, around 30 people put up their hand to say they were interested. So far, though, only 11 people responded on the Wiki page. That's on the borderline of whether it's worth doing the preparation and setup it'd need. So if you are the kind of person who's interesting in working on GHC (and the mailing list activity suggests that your numbers have increased sharply over the last 12 months), this message is to encourage you to go to the Wiki page: http://hackage.haskell.org/trac/ghc/wiki/Hackathon Please vote in the little (2-question!) survey, to indicate your interest, and add any comments and suggestions of you own. Excerpts below. Could be fun. Simon ============================ The 2006 GHC hackathon At the 2005 Haskell workshop we were asked to consider running a "GHC hackathon" around ICFP 2006. A surprisingly large number of people in the room indicated that they'd be interested in coming to such a thing. This Wiki page says what we have in mind, and asks you to indicate whether you'd be likely to come, and what sort of meeting you'd like. What we do will depend on what you say. Purpose GHC is used by lots of people, but its implementation is rather over-centralised, even though GHC is a BSD-licensed, open-source project. The biggest obstacle to more people getting involved is that GHC is a big, and hence intimidating, system. The purpose of the GHC hackathon is to give a tutorial in GHC's innards, plus time to work on some projects in a context where there are plenty of people around to help. The objective is to substantially broaden (more numbers) and deepen (more confidence) the community of people who feel they know enough to fix and enhance GHC. We'll suggest some projects, but you're welcome to come along with your own wacky ideas or itches that you want to scratch, and work on them in an environment with a high-bandwidth connection to developers who really know the innards of GHC. You could work on something individual, or in small groups. We anticipate all being in one room, or in a tight group of rooms, so there'd be lots of informal interaction. Also there's a good chance it'll be fun :-) Venue Galois has very kindly agreed to host the meeting. Cost Zero. But you'll have to feed yourself. And you may have to bring a laptop (capable of building GHC). Programme We had in mind the following. One full day of tutorial from Simon & Simon about GHC's glorious innards. Then one or two days of hacking on projects. Timing: The Haskell workshop is on Sunday 17 Sept; ICFP starts the next day. On Saturday is the ML and Erlang workshops. We propose to run the GHC hackathon something like Thurs-Sat 14-16 Sept, so that people who want to go to the ML workshop still can; but those who don't won't have a blank day.

4 3

Haskell Weekly News: May 22, 2006
by dons＠cse.unsw.edu.au 22 May '06

22 May '06

Haskell Weekly News: May 22, 2006 Welcome to issue 36 of HWN, a weekly newsletter covering developments in the Haskell community. Each Monday, new editions are posted to [1]the Haskell mailing list as well as to [2]the Haskell Sequence and [3]Planet Haskell. [4]RSS is also available, and headlines appear on [5]haskell.org. 1. http://www.haskell.org/mailman/listinfo/haskell 2. http://sequence.complete.org/ 3. http://planet.haskell.org/ 4. http://sequence.complete.org/node/feed 5. http://haskell.org/ Another busy and exciting week for the Haskell community. Announcements * Hugs 2006. Ross Paterson [6]announced a new major release of Hugs, including an installer for Windows and a new WinHugs interface. It is available from [7]the Hugs page. 6. http://article.gmane.org/gmane.comp.lang.haskell.general/13688 7. http://www.haskell.org/hugs/ * Linspire Chooses Haskell for Core OS Development. Clifford Beshers [8]announced that the OS team at Linspire, Inc. is standardizing on Haskell as their preferred language for core OS development. Much of the infrastructure is being written in Haskell, including the Debian package builder (aka autobuilder). Other tools such as ISO builders, package dependency checkers are in progress. The goal is to make a tight, simple set of tools that will let developers contribute to Freespire, based on Debian tools whenever possible. 8. http://article.gmane.org/gmane.comp.lang.haskell.cafe/12662 * lambdaFeed. Manuel Chakravarty [9]released lambdaFeed -- lambdas for all! lambdaFeed is an RSS 2.0 feed generator. It reads news items - in a non-XML, human-friendly format - distributed over multiple channels and renders them into the RSS 2.0 XML format understood by most news aggregators as well as into HTML for inclusion into web pages. Source is available in darcs. [10]Check it out. 9. http://article.gmane.org/gmane.comp.lang.haskell.general/13649 10. http://www.cse.unsw.edu.au/~chak/haskell/lambdaFeed/ * Milfoh, an image to texture loading library. Maurizio Monge [11]announced he has put together a very small library, using SDL_image (and a bare minimun of SDL), to load image files as opengl textures. More information [12]here. 11. http://article.gmane.org/gmane.comp.lang.haskell.general/13653 12. http://linuz.sns.it/~monge/wiki/index.php/Milfoh * Haskell Charting Library. Tim Docker [13]released his Haskell 2D charting library. It's still at quite an early stage, but already it has: + Line charts, points charts, fills, and combinations. + Automatic layout sizing and adjustment. + Auto scaling of axis ranges + Extensible to support new plot types + Uses the cairo graphics library for output and more. [14]Further information and a darcs repo. 13. http://article.gmane.org/gmane.comp.lang.haskell.general/13678 14. http://dockerz.net/software/chart.html * Edison 1.2RC4. Robert Dockins [15]announced the 4th release candidate for Edison 1.2. Edison is a library of efficient data structures for Haskell. 15. http://article.gmane.org/gmane.comp.lang.haskell.libraries/4718 * Colletions pre-release. Jean-Philippe Bernardy [16]announced an alpha release of the new collections package he (and others) have been working on. It's still far from perfect, but I hope it's already a good choice for many use cases of collection data structures. 16. http://article.gmane.org/gmane.comp.lang.haskell.libraries/4719 * Haskell Graph Automorphism Library. In a busy week, Jean-Philippe also [17]released HGAL 1.2 (Haskell Graph Automorphism Library), a Haskell implementation of Brendan McKay's algorithm for graph canonic labeling and automorphism group. (aka Nauty). Improvements over the previous release include a faster algorithm implementation and the library is now cabalised. 17. http://article.gmane.org/gmane.comp.lang.haskell.libraries/4739 * Darcs 1.0.7. Tommy Pettersson [18]announced the release of darcs 1.0.7, containing a few bug fixes, and some new features. 18. http://article.gmane.org/gmane.comp.version-control.darcs.user/9896 Haskell' This section covers activity on [19]Haskell' standardisation process. * Class system status ([20]parts 1, and [21]2) 19. http://hackage.haskell.org/trac/haskell-prime 20. http://thread.gmane.org/gmane.comp.lang.haskell.prime/1527/focus=1527 21. http://thread.gmane.org/gmane.comp.lang.haskell.prime/1554/focus=1554 Discussion * GHC Hackathon. Simon Peyton-Jones [22]posted more information on the proposed GHC Hackathon, in Portland, later this year prior to ICFP. The idea is that to give an extended tutorial about GHC's glorious innards. Then have some hacking time in which you can pick something which you think GHC could do better, and implement it, with the two Simons wandering causing trouble. If you're interested, then complete [23]the small survey indicating your preferences. 22. http://article.gmane.org/gmane.comp.lang.haskell.general/13674 23. http://hackage.haskell.org/trac/ghc/wiki/Hackathon * QuickCheck Fun with Phantom Types. Dominic Steinitz [24]posted on an interesting puzzle involving phantom types and quickcheck, and pondered how to generate random types as well as random values in those types. 24. http://article.gmane.org/gmane.comp.lang.haskell.cafe/12659 * Gigabytes and terabytes in Haskell. Don Stewart made some measurements ([25]here, [26]here, and [27]here) of the new lazy bytestring extension to [28]Data.ByteString, showing performance often within a few percent of C for gigabyte and terabyte data sizes. 25. http://article.gmane.org/gmane.comp.lang.haskell.libraries/4712 26. http://article.gmane.org/gmane.comp.lang.haskell.libraries/4717 27. http://article.gmane.org/gmane.comp.lang.haskell.libraries/4720 Contributing to HWN You can help us create new editions of this newsletter. Please see the [29]contributing information, send stories to dons -at- cse.unsw.edu.au. The darcs repository is available at darcs get http://www.cse.unsw.edu.au/~dons/code/hwn 28. http://www.cse.unsw.edu.au/~dons/fps.html 29. http://haskell.org/haskellwiki/HWN

1 0

Ambiguous type variable when using Data.Generic
by Bas van Dijk 21 May '06

21 May '06

Hello, I'm writing a function 'preProcess' that simplifies the AST that comes out of Language.Haskell.Parser.parseModule. Simplifying means rewriting infix applications to normal prefix applications (in both patterns and expressions), removing parentheses, rewriting guards to if-then-else expressions, etc.. At the moment I use Data.Generic to traverse the AST and apply simplification functions to the different values. Like this: ----------------------------------------------------------------------------------------------------------------------- preProcess :: HsModule -> HsModule preProcess = em simplifyRhs . em simplifyPat . em simplifyExp where em f = everywhere (mkT f) simplifyExp :: HsExp -> HsExp simplifyExp (HsInfixApp e1 op e2) = HsApp (HsApp (opToExp op) e1) e2 simplifyExp (HsLeftSection e op)= HsApp (opToExp op) e simplifyExp (HsRightSection op e) = HsApp (opToExp op) e simplifyExp (HsParen e) = e simplifyExp e = e opToExp (HsQVarOp name) = HsVar name opToExp (HsQConOp name) = HsCon name simplifyPat :: HsPat -> HsPat simplifyPat (HsPInfixApp p1 consName p2) = HsPApp consName [p1, p2] simplifyPat (HsPParen p) = p simplifyPat p = p simplifyRhs :: HsRhs -> HsRhs simplifyRhs (HsGuardedRhss rhss) = HsUnGuardedRhs $ makeIf rhss where makeIf :: [HsGuardedRhs] -> HsExp makeIf [] = nonExhaustivePatternError makeIf (HsGuardedRhs _ con exp : rhss) = HsIf con exp $ makeIf rhss nonExhaustivePatternError = HsApp (HsVar (UnQual (HsIdent "error"))) (HsLit (HsString "Non-exhaustive patterns")) simplifyRhs rhs = rhs ----------------------------------------------------------------------------------------------------------------------- This works, however I would like to have a single function 'simplify' that can be applied to different values in the AST. This calls for a class Simplify with instances for expressions, patterns, etc.: ----------------------------------------------------------------------------------------------------------------------- preProcess :: HsModule -> HsModule preProcess = everywhere (mkT simplify) class Simplify a where simplify :: a -> a instance Simplify HsExp where simplify (HsInfixApp e1 op e2) = HsApp (HsApp (opToExp op) e1) e2 simplify (HsLeftSection e op)= HsApp (opToExp op) e simplify (HsRightSection op e) = HsApp (opToExp op) e simplify (HsParen e) = e simplify e = e instance Simplify HsPat where simplify (HsPInfixApp p1 consName p2) = HsPApp consName [p1, p2] simplify (HsPParen p) = p simplify p = p instance Simplify HsRhs where simplify (HsGuardedRhss rhss) = HsUnGuardedRhs $ makeIf rhss where makeIf :: [HsGuardedRhs] -> HsExp makeIf [] = nonExhaustivePatternError makeIf (HsGuardedRhs _ con exp : rhss) = HsIf con exp $ makeIf rhss nonExhaustivePatternError = HsApp (HsVar (UnQual (HsIdent "error"))) (HsLit (HsString "Non-exhaustive patterns")) simplify rhs = rhs opToExp (HsQVarOp name) = HsVar name opToExp (HsQConOp name) = HsCon name ----------------------------------------------------------------------------------------------------------------------- However, compiling the above gives the following type error: Ambiguous type variable `b' in the constraints: `Typeable b' arising from use of `mkT' at Special.hs:145:25-27 `Simplify b' arising from use of `simplify' at Special.hs:145:29-36 Probable fix: add a type signature that fixes these type variable(s) How can I make this work? Greetings, Bas van Dijk

4 4

Registration open for IFL 2006, Budapest, Sep 4-6, 2006
by HORVATH Zoltan 20 May '06

20 May '06

SECOND ANNOUNCEMENT and CALL FOR PAPERS !!! REGISTRATION IS NOW OPEN !!! The registration site: http://www.inf.elte.hu/rendezvenyek/ifl/registration.htm ************************************************************** * 18th International Symposium on * * Implementation and Application of Functional Languages * * IFL 2006 * * * * September 4-6, 2006 * * Budapest, Hungary * * http://plc.inf.elte.hu/ifl2006 * * * * Hosted by the * * Department of Programming Languages and Compilers of * * the Faculty of Informatics at Eotvos Lorand University * ************************************************************** --------- IMPORTANT DATES --------- * July 30th 2006 Registration deadline * Aug 4th 2006 Submission deadline for draft proceedings * Oct 24th 2006 Submission deadline for post-refereeing process * Dec 8th 2006 Notification of acceptance/rejection * Jan 31th 2007 Camera-ready papers ---------------------------------------------------------------- Scope and Topics The IFL workshops form a tradition that has lasted for nearly two decades. The aim of these workshops is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. They provide an open forum for researchers who wish to present and discuss new ideas and concepts, work in progress, preliminary results, etc. related primarily but not exclusively to the implementation and application of functional languages. IFL becomes symposium from 2006. Topics of interest include, but are not limited to: * language concepts * concurrent/parallel programming * type checking * concurrent/parallel program execution * compilation techniques * heap management * generic programming techniques * runtime profiling * (abstract) interpretation * performance measurements * automatic program generation * debugging and tracing * (abstract) machine architectures * verification * formal aspects * tools and programming techniques * array processing * demos of well working, useable tools and applications in functional languages Papers on applications demonstrating the suitability of novel ideas in any of the above areas and contributions on related theoretical work are also welcomed. The change of the workshop name adding the term "application", introduced in 2004, is to reflect the broader scope IFL has gained over recent years. Prospective authors are encouraged to submit papers to be published in the draft proceedings and to give presentations at the workshop. All contributions must be written in English, conform to the Springer-Verlag LNCS series format. Attendees at IFL'06 will have an opportunity to submit a revised version of their paper for post-workshop reviewing. Selected papers will be published by Springer Verlag in the well-known Lecture Notes in Computer Science (LNCS) Series, as has been a long-standing tradition for the IFL. Programme Committee Matthias Blume Toyota Technological Institute, Chicago, USA Zoran Budimac University of Novi Sad, Serbia Andrew Butterfield Trinity College Dublin, Ireland Ralf Hinze University of Bonn, Germany Zoltan Horvath Eotvos Lorand University, Budapest, Hungary (Chair) Tamas Kozsik Eotvos Lorand University, Budapest, Hungary Hans-Wolfgang Loidl Ludwig-Maximilians-University Munich, Germany Rita Loogen Philipps-University Marburg, Germany Frederic Loulergue University of Orleans, France Simon Marlow Microsoft Research, Cambridge, UK Marco Morazan Seton Hall University, New Jersey, USA Yolanda Ortega-Mallen University Complutense of Madrid, Spain Rinus Plasmeijer Radboud University Nijmegen, The Netherlands Jaroslav Poruban Technical University of Kosice, Slovakia Anna Soos Babes-Bolyai University, Cluj-Napoca, Romania Doaitse Swierstra Utrecht University, The Netherlands Peter Thiemann University of Freiburg, Germany German Vidal Technical University of Valencia, Spain Symposium Organization Zoltan Horvath, Viktoria Zsok Department of Programming Languages and Compilers Faculty of Informatics Eotvos Lorand University, Budapest, Hungary Further information Web-site: http://www.inf.elte.hu/rendezvenyek/ifl/ E-mail: ifl2006(a)inf.elte.hu

1 0

simplex method?
by Johannes Waldmann 17 May '06

17 May '06

Dear all, I could use a simple implementation of the simplex method for linear programming. I found this: http://haskelldsp.sourceforge.net/doc/Matrix.Simplex.html but I'm not exactly sure how to use it. In the source http://haskelldsp.sourceforge.net/Matrix/Simplex.hs there's a function "solution", does it really give me a solution vector? Thanks, -- -- Johannes Waldmann -- Tel/Fax (0341) 3076 6479/80 -- ---- http://www.imn.htwk-leipzig.de/~waldmann/ -------

1 0

ANNOUNCE: new release of Hugs
by Ross Paterson 16 May '06

16 May '06

We are pleased to announce a new major release of Hugs, including an installer for Windows and a new WinHugs interface (both contributed by Neil Mitchell). It is available from the Hugs page: http://www.haskell.org/hugs/ At present two sizes of the Windows distribution and two sizes of source distribution are available for download. Distributions for other platforms will be linked to when they are provided by third parties. Packagers can choose between an omnibus package and a more modular arrangement. ------------------------------------------------------------------------------ The Hugs 98 system is Copyright (c) Mark P Jones, Alastair Reid, the Yale Haskell Group, and the OGI School of Science & Engineering at OHSU, 1994-2005, All rights reserved. It is distributed as free software under the license in the file "License", which is included in the distribution. ------------------------------------------------------------------------------

3 4

Workshop on (logic-based) programming environments - DEADLINE EXTENSION
by Wim Vanhoof 16 May '06

16 May '06

[apologies for mutliple copies] ----------------------------------------------------------- Deadline extension for the WLPE'06 workshop. New deadline is in two weeks: May 28 ! ----------------------------------------------------------- WLPE' 06 - DEADLINE EXTENSION Workshop on Logic-based Methods in Programming Environments (satellite workshop of ICLP’06) August 16, 2006 Seattle (Washington), USA http://lml.ls.fi.upm.es/~susana/Conferences/WLPE06/ ----------------------------------------------------------- Aim and Scope ------------- The 16th Workshop on Logic-based methods in Programming Environments will take place in Seattle (Washington), USA, as a satellite workshop of ICLP'06, the 22th International Conference on Logic Programming. This workshop will continue the series of successful international workshops on logic programming environments held in Ohio, USA (1989), Eilat, Israel (1990), Paris, France (1991), Washington, USA (1992), Vancouver, Canada (1993), Santa Margherita Ligure, Italy (1994), Portland, USA (1995), Leuven, Belgium and Port Jefferson, USA (1997), Las Cruces, USA (1999), Paphos, Cyprus (2001), Copenhagen, Denmark (2002), Mumbai, India (2003), Saint Malo, France (2004) and Sitges, Spain (2005). The workshop aims at providing an informal meeting for the researchers working on logic-based tools for development and analysis of programs. This year we want to emphasize two aspects: on one hand we want to discuss the presentation, pragmatics and experiences of such tools; on the other one, we want to shift the traditional focus on environment tools for logic programming to logic-based environmental tools for programming in general. Specific topic areas relevant to the workshop include, but are not limited to: * tools for debugging and testing * tools for static and dynamic analysis * systems for program verification and validation * code generation from specifications * termination and non-termination analyzers * reasoners on occurs-check freeness and determinacy * profilers and performance analyzers * systems for types and modes analyzes * module systems * optimization tools. In addition to papers describing more conceptual work on environmental tools, we solicit papers describing the implementation of and experimentation with such tools. Submission guidelines --------------------- Length of papers can range from 2 to 17 pages, preferably in LNCS format. Authors are requested to submit their paper using the submission webpage at http://vampire.cs.man.ac.uk/WLPE-06/ Alternatively, authors can send a copy of their paper (in pdf or ps format) to the workshop coordinator (wva(a)info.fundp.ac.be) An informal proceedings will be published as a technical report of the University of Namur and distributed at the workshop. After the workshop, the proceedings will be publicly available on-line in the Computing Research Repository (CoRR). Important dates --------------- Submission: May 28, 2006 Notification: June 15, 2006 Camera-ready: July 10, 2006 Workshop: August 16, 2006 Workshop organizers ------------------- Susana Muñoz-Hernández (Universidad Politécnica de Madrid, Spain) Wim Vanhoof (coordinator) (Univeristy of Namur, Belgium) Program Committee ----------------- María Alpuente (Universidad Politécnica de Valencia, Spain) Mireille Ducassé (INSA/IRISA, Rennes, France) John Gallager (Roskilde University, Denmark) María García de la Banda (Monash University, Australia) José Manuel Gómez-Pérez (ISOCO Madrid, Spain) Gopal Gupta (University of Texas at Dallas, U.S.A) Moreno Falaschi (Università di Udine, Italy) Pat Hill (University of Leeds, U.K.) Michael Leuschel (Heinrich-Heine-Universitat Düsseldorf, Germany) Fred Mesnard (Université de La Réunion, France) Susana Muñoz-Hernández (Universidad Politécnica de Madrid, Spain) Kostis Sagonas (Uppsala University, Sweden) Alexander Serebrenik (Technische Universiteit Eindhoven, The Netherlands) Zoltan Somogyi (University of Melbourne, Australia) Wim Vanhoof (University of Namur, Belgium)

1 0

Strange behaviour of forkIO threads
by Maurizio Monge 15 May '06

15 May '06

Hi, i used forkIO to write a 'por' (parallel or) implementation (just a proof of concept), arguments are evaluated in different threads and as soon as one of the threads returns true the other thread is killed and true is returned. If both threads return false the result of the computation is false. I have been doing a few tests and looks like that in some cases the function that do not terminate (that i used to test the por correctness) seam not be preempted, and thus the program do not terminate. The very strange thing is that the program (that i am attaching) works as expected if it is compiled with -O, but hangs if compiled without optimization! Any idea? Thanks -- Ciao Maurizio "Well we all shine on Like the moon and the stars and the sun" (John Lennon)

3 3

My brain just exploded
by Dominic Steinitz 15 May '06

15 May '06

What a great error message: qcgadt.hs:115:7: My brain just exploded. I can't handle pattern bindings for existentially-quantified constructors. In the binding group (Rep x) = uncompressRep s In the definition of `uncompressRep': uncompressRep (0 : 1 : 0 : s) = let (Rep x) = uncompressRep s in Rep (RList x) Failed, modules loaded: none. Here's the offending line: uncompressRep (0:1:1:s) = let (Rep x) = uncompressRep s in Rep (RList x) But this works: uncompressRep (0:1:0:s) = let x = uncompressRep s in case x of (Rep y) -> Rep (RList y) Can someone explain this? Thanks, Dominic.

2 1

FORMAL METHODS 2006: Call for Participation
by Simon Marlow 15 May '06

15 May '06

[posting on behalf of Jeffery Zucker <zucker(a)cas.mcmaster.ca>] FM'06: 14TH INTERNATIONAL SYMPOSIUM ON FORMAL METHODS August 21 - 27, 2006 McMaster University, Hamilton, Ontario, Canada http://fm06.mcmaster.ca/ CALL FOR PARTICIPATION NOTE: REGISTRATION INFORMATION IS AVAILABLE AT http://fm06.mcmaster.ca/symposium_reg.htm NOTE: THE CALLS FOR POSTERS AND TOOL DEMONSTRATIONS, AND FOR THE DOCTORAL SYMPOSIUM, ARE STILL OPEN. Deadline May 26. See http://fm06.mcmaster.ca/call_research_exhibition.htm http://fm06.mcmaster.ca/doctoral_symposium.htm FM'06 is the fourteenth in a series of symposia organized by Formal Methods Europe, http://www.fmeurope.org, an independent association whose aim is to stimulate the use of, and research on, formal methods for software development. The symposia have been notably successful in bringing together innovators and practitioners in precise mathematical methods for software development, industrial users as well as researchers. INVITED SPEAKERS There are 5 distinguished invited speakers: * Ernie Cohen, Microsoft: "Validating the Microsoft Hypervisor" * Nicholas Griffin, Director, Bertrand Russell Research Centre, McMaster: "Bertrand Russell: A Philosophy for Formal Methods and a Formal Method for Philosophy" * Thomas A. Henzinger, Professor of Computer and Communication Sciences, EPFL, Switzerland: "Software Design Automation" * Peter Lindsay, Boeing Chair in Systems Engineering, University of Queensland: "Distributed Control in Network-Based Systems" * George Necula, Associate Professor in Computer Science, UC Berkeley: "Data Structure Specifications via Local Equality Axioms" TECHNICAL SYMPOSIUM: August 23 - 25 There are 36 speakers. See http://fm06.mcmaster.ca/technical_program.htm WORKSHOPS There are 4 workshops: * Formal Methods Education Workshop Saturday, August 26, 2006 * International Workshop on Formal Aspects in Security and Trust Saturday August 26 - Sunday August 27, 2006S * Workshop on Software Certification Saturday August 26 - Sunday August 27, 2006 * The Second Overture Workshop Sunday August 27, 2006 For more information, go to http://fm06.mcmaster.ca/workshops.htm TUTORIALS There are 9 full-day and half-day tutorials. See http://fm06.mcmaster.ca/tutorials.htm ORGANIZATION General Chair: Emil Sekerinski (McMaster) Program Chairs: Jayadev Misra (U. Texas, Austin), Tobias Nipkow (TU Munich) Workshop Chair: Tom Maibaum (McMaster) Tutorial Chair: Jin Song Dong (NUS) Tools and Poster Exhibition Chair: Marsha Chechik (U. Toronto) Industry Day Chairs: Volkmar Lotz (SAP France), Asuman Suenbuel (SAP US) Doctoral Symposium Chair: Augusto Sampaio (U. Pernambuco) Sponsorship Chair: Juergen Dingel (Queens U.) PROGRAM COMMITTEE Jean-Raymond Abrial (ETH Zurich) Alex Aiken (Stanford U.) Keijiro Araki (Kyushu U.) Ralph Back (Abo Akademi) Gilles Barthe (INRIA) David Basin (ETH Zurich) Ed Brinksma (U. Twente) Michael Butler (U. Southampton) Rance Cleaveland (U. Stony Brook) Jorge Cuellar (Siemens) Werner Damm (U. Oldenburg) Frank de Boer (U. Utrecht) Javier Esparza (U. Stuttgart) Jose Fiadeiro (U. Leicester) Susanne Graf (VERIMAG) Ian Hayes (U. Queensland) Gerard Holzmann (JPL) Cliff Jones (U. Newcastle) Gary T. Leavens (Iowa State U.) Rustan Leino (Microsoft) Xavier Leroy (INRIA) Dominique Mery (LORIA) Carroll Morgan (UNSW) David Naumann (Stevens) E.-R. Olderog (U. Oldenburg) Paritosh Pandya (TIFR) Sriram Rajamani (Microsoft) John Rushby (SRI) Steve Schneider (U. Surrey) Vitaly Shmatikov (U. Texas, Austin) Bernhard Steffen (U. Dortmund) P.S. Thiagarajan (NUS) Axel van Lamsweerde (U. Louvain) Martin Wirsing (LMU Munich) Pierre Wolper (U. Liege) LOCAL ORGANIZATION Publicity: Wolfram Kahl, Alan Wassyng, Jeff Zucker Tools, Posters, Book Exhibition: Spencer Smith Social Events: Ridha Khedri Local Arrangements:: William Farmer, Mark Lawford Events Co-ordinator: Ryszard Janicki

1 0