November 2009 - Haskell

Announcing Djinn, version 2004-12-11, a coding wizard
by Lennart Augustsson 07 Apr '11

07 Apr '11

Howdy, y'all! I've written a small program that takes a (Haskell) type and gives you back a function of that type if one exists. It's kind of fun, so I thought I'd share it. It's probably best explained with a sample session. calvin% djinn Welcome to Djinn version 2005-12-11. Type :h to get help. # Djinn is interactive if not given any arguments. # Let's see if it can find the identity function. Djinn> f ? a->a f :: a -> a f x1 = x1 # Yes, that was easy. Let's try some tuple munging. Djinn> sel ? ((a,b),(c,d)) -> (b,c) sel :: ((a, b), (c, d)) -> (b, c) sel ((_, v5), (v6, _)) = (v5, v6) # We can ask for the impossible, but then we get what we # deserve. Djinn> cast ? a->b -- cast cannot be realized. # OK, let's be bold and try some functions that are tricky to write: # return, bind, and callCC in the continuation monad Djinn> type C a = (a -> r) -> r Djinn> returnC ? a -> C a returnC :: a -> C a returnC x1 x2 = x2 x1 Djinn> bindC ? C a -> (a -> C b) -> C b bindC :: C a -> (a -> C b) -> C b bindC x1 x2 x3 = x1 (\ c15 -> x2 c15 (\ c17 -> x3 c17)) Djinn> callCC ? ((a -> C b) -> C a) -> C a callCC :: ((a -> C b) -> C a) -> C a callCC x1 x2 = x1 (\ c15 _ -> x2 c15) (\ c11 -> x2 c11) # Well, poor Djinn has a sweaty brow after deducing the code # for callCC so we had better quit. Djinn> :q Bye. To play with Djinn do a darcs get http://darcs.augustsson.net/Darcs/Djinn or get http://darcs.augustsson.net/Darcs/Djinn/Djinn.tar.gz Then just type make. (You need a Haskell 98 implementation and some libraries.) And then start djinn. For the curious, Djinn uses a decision procedure for intuitionistic propositional calculus due to Roy Dyckhoff. It's a variation of Gentzen's LJ system. This means that (in theory) Djinn will always find a function if one exists, and if one doesn't exist Djinn will terminate telling you so. This is the very first version, so expect bugs. :) Share and enjoy. -- Lennart

8 13

Interesting experiences of test automation in Haskell? Automation of Software Test 2010
by John Hughes 03 Dec '09

03 Dec '09

This is a "heads up" about a workshop on test automation that I just joined the programme committee of. Automation of Software Test will be co-located with ICSE in Cape Town in May--the workshop home page is here: http://www.cs.allegheny.edu/ast2010/ Tools like QuickCheck, SmallCheck and HUnit fit the call for papers perfectly. So if you're doing some interesting automated testing in Haskell, why not submit a paper about it, and show a new audience what the Haskell community is up to? Both research papers and case studies are welcome, and the latter can even be in the form of a presentation of up to 15 slides--so there's no excuse for not putting something together! So how about it? It would be great to see some Haskell papers at the workshop! Deadline 20 January. John Hughes PS Check out the ICSE web site for information on the location: http://www.sbs.co.za/ICSE2010/

2 1

ANNOUNCE: graphviz-2999.7.0.0
by Ivan Lazar Miljenovic 30 Nov '09

30 Nov '09

I'm pleased to announce the latest version of my Haskell bindings to the Graphviz [1] suite of tools for visualising graphs. As usual, it is available from Hackage [2]. [1] http://graphviz.org/ [2] http://hackage.haskell.org/package/graphviz Changes in this release include: * Updated and extended functions to interact with the Graphviz tools. This now includes: - a better listing of available output types; - distinguishing file outputs from canvas outputs; - ability to automatically add the correct file extension to file outputs - Return any errors if calling Graphviz failed rather than just printing them to stderr * Improved Color support: - fixed ColorScheme values - explicitly named X11 colors - conversion to/from values from the colour library * Removed OrientationGraph; problems with distinguishing it when parsing from node-based Orientation values; its functionality is duplicated by Rotate. * By default, the generated Dot code is now no longer indented; you can now use the prettyPrint functions in Data.GraphViz to produce readable Dot code. * Added a testsuite; this is buildable by building with --flags=test. Numerous printing and parsing bugs were picked up with this. Plans for the next release: * Determine how to deal with encodings, since Graphviz uses UTF-8 by default; the hSetEncoding function in GHC-6.12 would be ideal, but backwards-incompatible. * Add a generic version of the types in Data.GraphViz.Types that would let people have more fine-grained control over the layout of their graphs by removing the ordering restriction used. Note that this will _not_ be the default, just an option for those that want it. -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com IvanMiljenovic.wordpress.com

1 0

Haskell Weekly News: Issue 141 - November 29, 2009
by jfredett＠gmail.com 30 Nov '09

30 Nov '09

--------------------------------------------------------------------------- Haskell Weekly News http://sequence.complete.org/hwn/20091129 Issue 141 - November 29, 2009 --------------------------------------------------------------------------- Welcome to issue 141 of HWN, a newsletter covering developments in the [1]Haskell community. Firstly, sorry for the late HWN, a turkey coma is equal parts gift and curse. This week, we have some very exciting news, a new Haskell standard -- Haskell 2010 -- was announced, including several small changes. Also, we have lots of new packages, a possible Boston-area Hackathon coming up soon, and some great discussion. I won't hold you back from skipping all that and just reading the funny quotes! Haskellers, your (belated) Haskell Weekly News! Announcements Haskell 2010. Simon Marlow [2]announced the new revision of Haskell, Haskell 2010. Part of the new, less monolithic Haskell Prime process, Haskell 2010 includes several changes to the Haskell Language, including support for nonstandard if-then-else syntax (particularly wrt `do` notation and indentation), pattern guards, and several other changes. See the post for details. Clutterhs 0.1. Matt Arsenault [3]announced Clutterhs, version 0.1. A set of bindings for Clutter, a GObject based library for creating 2.5D interfaces using OpenGL. Interesting experiences of test automation in Haskell? Automation of Software Test 2010. John Hughes [4]announced a 'heads up' for the Automation af Software Test 2010 workshop NoSlow - Microbenchmarks for array libraries. Roman Leshchinskiy [5]announced his benchmark suite for various array and list libraries. CMCS 2010: First call for papers. Alexandra Silva [6]announced a first call for papers for the Tenth International Workshop on Coalgebraic Methods in Computer Science, taking place 26-28 March 2010, in Paphos, Cyprus. GPCE'10 First Call for Papers. Bruno Oliveira [7]announced a first call for papers for the Ninth International Conference on Generative Programming and Component Engineering. GPCE 2010 October 10-13, in Eindhoven, The Netherlands. Call for Participation: TLDI'10. Andrew Kennedy [8]announced a call for participation in the 2010 ACM SIGPLAN Workshop on Types in Language Design and Implementation Deadline Extension: JSC Special Issue on Automated Specification and Verification of Web Systems. demis [9]announced an extension to the paper deadline for the JSC Special Issue on Automated Specification and Verification of Web Systems. VSTTE 2010: Verified Software -- Second Call for Papers. Gudmund Grov [10]announced the second call for papers for the Third International Conference on Verified Software: Theories, Tools, and Experiments GPipe-1.1.0 with greatly improved performance. Tobias Bexelius [11]announced a new version of the GPipe package, now with greatly improved performance. wumpus-core. Stephen T [12]announced a new version of the wumpus-core package, a library for drawing 2D vector pictures, supporting output to SVG and postscript. package-vt-0.1.3.3, Haskell Package Versioning Tool. Krzysztof Skrzetnicki [13]announced the first release of his automatic version tracking tool, package-vt. Elerea 1.1. Patai Gergely [14]announced a new version of Elerea, a simple pull-based FRP library. Elerea (and FRP in general) allow for stream oriented programming, typically done in a applicative style. mecha-0.0.4. Tom Hawkins [15]announced a new version of Mecha, a little constructive solid modeling language intended for doing 3D CAD. atom-0.1.2. Tom Hawkins [16]announced a new release of Atom, a DSL for designing hard realtime embedded software with Haskell. This release adds guarded division operations, a new scheduling constraint, and a new rule scheduling algorithm. Managing Cabal Dependencies using Nix and Hack-nix. Marc Weber [17]announced a package for dealing with Cabal dependencies on the Nix OS platform. Discussion haskell in online contests. vishnu [18]asked about using Haskell in online contests, and particularly dealing with the SPOJ tool for judging programs. Namespaces for values, types, and classes. Sebastian Fischer [19]suggested allowing a namespace separation between class-names and other language elements. I miss OO. Michael Mossey [20]lamented his desire for Object-oriented features in Haskell, this led to a interesting discussion about name punning and typeclasses. Haskell Hackathon in Boston January 29th-31st? Ravi Nanavati [21]proposed a potential Hackathon in this editor's favorite city, to be held the 29th to the 31st. Blog noise [22]Haskell news from the [23]blogosphere. Blog posts from people new to the Haskell community are marked with >>>, be sure to welcome them! * Dan Piponi (sigfpe): [24]Programming with impossible functions, or how to get along without monads.. * Neil Brown: [25]Graph Layout with Software Transactional Memory and Barriers (plus video!). * Ivan Lazar Miljenovic: [26]If wishes were tests, code would be perfect. * Adam Jones: [27]Lambda Calculus compiler, Part II: Wading in with arithmetic. * FP Lunch: [28]Implementing a Correct Type-Checker for the Simply Typed Lambda Calculus. * Manuel M T Chakravarty: [29]Haskell 2010. * Holumbus: [30]hayoo.info. * Paul Chiusano: [31]Perfect strictness analysis (Part 2). * Paul Chiusano: [32]Perfect strictness analysis (Part 1). * Paul Chiusano: [33]Optional laziness doesn't quite cut it. * Neil Brown: [34]Force-Directed Graph Layout with Barriers and Shared Channels. * Neil Mitchell: [35]Reviewing View Patterns. * JP Moresmau: [36]EclipseFP 1.109.0 is out!. * CS Design Lab, University of Kansas: [37]Special LAMBDA meeting. * Joachim Breitner: [38]arbtt now in Debian. * Neil Mitchell: [39]Haskell DLL's on Windows. * Conal Elliott: [40]Thoughts on semantics for 3D graphics. Quotes of the Week * command: lambdabot will say 'it is forever etched into my memory' and then forget the quote by tomorrow. * copumpkin: orbitz makes [##C++] especially brutal to make people appreciate #haskell more * mtnviewmark: [on the State monad] "If I had a sta-ate, I'd compute it in the morning.... I'd compute it in the evening.... All over this la-and!" * monochrom: dynamic type is poor man's dependent type, they are so poor they can't buy a theorem prover. * Veinor: just remember: you can't spell fundeps without fun. * Botje: i think it's too early to be sticking things into other things .. * Berengal: Haskell is made of sugar and spice and everything nice, plus the mysterious compound X * sproingie: sproingie enables IncoherentInstances and ends up with Sarah Palin in his living room 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/17638 3. http://article.gmane.org/gmane.comp.lang.haskell.general/17652 4. http://article.gmane.org/gmane.comp.lang.haskell.general/17649 5. http://article.gmane.org/gmane.comp.lang.haskell.general/17647 6. http://article.gmane.org/gmane.comp.lang.haskell.general/17646 7. http://article.gmane.org/gmane.comp.lang.haskell.general/17645 8. http://article.gmane.org/gmane.comp.lang.haskell.general/17644 9. http://article.gmane.org/gmane.comp.lang.haskell.general/17637 10. http://article.gmane.org/gmane.comp.lang.haskell.general/17636 11. http://article.gmane.org/gmane.comp.lang.haskell.general/17635 12. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66796 13. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66770 14. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66751 15. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66726 16. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66722 17. http://article.gmane.org/gmane.comp.lang.haskell.cafe/66693 18. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66810 19. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66777 20. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66723 21. http://thread.gmane.org/gmane.comp.lang.haskell.cafe/66616 22. http://planet.haskell.org/ 23. http://haskell.org/haskellwiki/Blog_articles 24. http://blog.sigfpe.com/2009/11/programming-with-impossible-functions.html 25. http://chplib.wordpress.com/2009/11/26/graph-layout-with-software-transacti… 26. http://ivanmiljenovic.wordpress.com/2009/11/26/if-wishes-were-tests-code-wo… 27. http://blog.finiteimprobability.com/2009/11/25/lambda-calculus-compiler-par… 28. http://sneezy.cs.nott.ac.uk/fplunch/weblog/?p=291 29. http://justtesting.org/post/256283708 30. http://holumbus.fh-wedel.de/blog/?p=27 31. http://pchiusano.blogspot.com/2009/06/perfect-strictness-analysis-part-2.ht… 32. http://pchiusano.blogspot.com/2009/06/perfect-strictness-analysis-part-1.ht… 33. http://pchiusano.blogspot.com/2009/05/optional-laziness-doesnt-quite-cut-it… 34. http://chplib.wordpress.com/2009/11/24/force-directed-graph-layout-with-bar… 35. http://neilmitchell.blogspot.com/2009/11/reviewing-view-patterns.html 36. http://jpmoresmau.blogspot.com/2009/11/eclipsefp-11090-is-out.html 37. http://www.ittc.ku.edu/csdlblog/?p=20 38. https://www.joachim-breitner.de/blog/archives/352-arbtt-now-in-Debian.html 39. http://neilmitchell.blogspot.com/2009/11/haskell-dlls-on-windows.html 40. http://conal.net/blog/posts/thoughts-on-semantics-for-3d-graphics/ 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: Hubris 0.0.2, the Ruby-Haskell bridge
by Mark Wotton 30 Nov '09

30 Nov '09

The first vaguely usable version of Hubris is out on Hackage now. New stuff * now capable of building dynamic libs so that you don't need to have GHC installed on the production server. * extensible marshalling through a pair of typeclasses * automatically generated interface to Haskell from Ruby rather than the hacked-up manual packing/unpacking solution the first version had. For example: strings.rb: ---------------------- require 'hubris' class HsString hubris :module => 'Data.ByteString', :packages => ['bytestring'] end HsString.new.reverse("abcd") => "dcba" ------------------------ It requires the ghc 6.12 release candidate, and if you're on Mac, you'll need to apply the cabal patch at http://hackage.haskell.org/trac/hackage/ticket/591 and the ghc patch at http://hackage.haskell.org/trac/ghc/ticket/3550 You'll need to follow the installation instructions at http://github.com/mwotton/Hubris , as it needs a little extra info about ruby headers etc. Let me know if it works, if it breaks, if I've missed an obvious better way, if it's at all useful to you... Cheers Mark

1 0

ANNOUNCE: Clutterhs 0.1
by Matt Arsenault 29 Nov '09

29 Nov '09

Clutterhs 0.1 This is a very early announcement for an initial release of bindings for Clutter 1.0, now on Hackage,http://hackage.haskell.org/package/clutterhs What is Clutter? ------------------ See http://www.clutter-project.org/ Clutter is a GObject based library for creating 2.5D interfaces using OpenGL. It's currently being used in projects such as Intel's Moblin platform and GNOME Shell. Clutterhs ---------------- It uses c2hs, and depends on gtk2hs from darcs for the glib/gobject bindings. Overall, its usage should be similar to gtk2hs. Most of the core Clutter components are mostly bound. Currently missing are relatively low level pieces, and some backend specific stuff, ClutterListModel, ClutterUnits, and a few random pieces scattered around. There is some documentation, but that is also currently incomplete. More examples and a tutorial are planned. Right now for examples, I suggest people look at the simple demos in the git repository. The best example to look at for usage would be http://jayne.hortont.com/git/cgit.cgi/clutterhs.git/tree/clutter/demo/Clutt… This is my first Haskell project, and suggestions on the API, bug reports, etc. are appreciated. Special thanks to Sean O'Sullivan and Rensselaer Center for Open Source for their generous support. Related: Clutter: http://www.clutter-project.org/ gtk2hs: http://www.haskell.org/gtk2hs/ - Matt Arsenault

1 0

HWN This week
by Joe Fredette 28 Nov '09

28 Nov '09

Hey folks, I'm at home this weekend, and the internet is somewhat dodgey, so I'm going to delay the special Thanksgiving episode of the HWN till sunday afternoon... I suppose the Turkey-coma isn't helping either, but I'll never admit it... /Joe

1 0

ANN: package-vt-0.1.3.3, Haskell Package Versioning Tool
by Krzysztof Skrzętnicki 28 Nov '09

28 Nov '09

Hi! I'm pleased to announce the first release of my program package-vt. It's role is to detect changes between two versions of package that should cause version bump. Recommended versioning policy for Haskell packages is on the wiki [1]. The ultimate goal is to get as good approximation of the algorithm specified there as possible. Currently the tool is far from being complete: it only detects changes to exports in .cabal and module files, but doesn't take any types into consideration, not to mention other possible heuristics. This tool is not meant as a replacement for developer's own brain. It can only detect a subset of changes, and there will always be some important changes it won't catch, like adding such line: head (_:y:_) = y However, it can be used for some quality checks. Thing that needs improving is user interface. No options are currently accepted. This, and a lot more, will change in future versions. You can find a Git repo here [2]. The repo contains 'tests' directory with two useful scripts. You can use them to run package-vt on anything from Hackage. Here are a few random usage examples: 1) Detect small change within module package-vt packages/HCL/1.1/HCL-1.1/HCL.cabal packages/HCL/1.2/HCL-1.2/HCL.cabal Single changes: ChangeABC : Entity added to module ModuleName "HCL" --- EVar (UnQual (Ident "prompt1")) --- Biggest change comes from: ChangeABC : Entity added to module ModuleName "HCL" --- EVar (UnQual (Ident "prompt1")) 2) Detect new module added to .cabal package-vt 0.2.0/AERN-Net-0.2.0/AERN-Net.cabal 0.2.1/AERN-Net-0.2.1/AERN-Net.cabal Single changes: ChangeABC : Entity added to module ModuleName "Control.ERNet.Foundations.Process" --- EThingAll (UnQual (Ident "ERProcessAction")) ---ChangeABC : Module(s) added.(Consider AB change if new modules are likely to cause name collisions) --- "Control/ERNet/Blocks/Real/LFT" --- Biggest change comes from: ChangeABC : Module(s) added.(Consider AB change if new modules are likely to cause name collisions) --- "Control/ERNet/Blocks/Real/LFT" --- 3) Using testing script: package-vt correctly detects that AERN-RnToRM-0.4.9 should rather be 0.5.0 because the module Data.Number.ER.RnToRm.UnitDom.ChebyshevBase.Polynom.Field has been removed. ./test-on-package.lhs AERN-RnToRm --cut-- >>> Testing package-vt on AERN-RnToRm-0.4.2 and AERN-RnToRm-0.4.9 Parse error: VarSym "#" : SrcLoc {srcFilename = "0.4.2/AERN-RnToRm-0.4.2/src/Data/Number/ER/RnToRm/Approx/DomTransl.hs", srcLine = 174, srcColumn = 1} Single changes: ChangeABC : Entity added to module ModuleName "Data.Number.ER.RnToRm.Approx" --- EVar (UnQual (Ident "keyPointsConsistencyCheck")) EVar (UnQual (Ident "keyPointsPointwiseConsistencyCheck")) ---ChangeABC : Entity added to module ModuleName "Data.Number.ER.RnToRm.UnitDom.Approx" --- EVar (UnQual (Ident "keyPointsConsistencyCheck")) EVar (UnQual (Ident "keyPointsPointwiseConsistencyCheck")) ---ChangeAB : Module(s) removed/renamed. --- "Data/Number/ER/RnToRm/UnitDom/ChebyshevBase/Polynom/Field" --- Biggest change comes from: ChangeAB : Module(s) removed/renamed. --- "Data/Number/ER/RnToRm/UnitDom/ChebyshevBase/Polynom/Field" --- ExitSuccess --cut-- In case of any trouble please email me or report an issue here [3]. In the near future I'll post more specific plans about development on my blog [4]. I hope you will find it useful. Best regards, Krzysztof Skrzętnicki [1] http://www.haskell.org/haskellwiki/Package_versioning_policy [2] http://github.com/Tener/haskell-package-vt [3] http://github.com/Tener/haskell-package-vt/issues [4] http://mostlycode.wordpress.com

2 1

ANN: NoSlow - Microbenchmarks for array libraries
by Roman Leshchinskiy 26 Nov '09

26 Nov '09

I'm pleased to announce NoSlow, a nascent benchmark suite for various array (and list) libraries with particular emphasis on finding out how well they fuse things. At the moment, it knows about * standard lists * primitive DPH arrays (dph-prim-seq) * uvector * vector * storablevector It compiles and runs (using Brian's criterion) a fairly random collection of very small loop kernels for each of those and produces a lot of data which it then uses to generate ugly HTML tables. In the future, it will have more benchmarks, more complex benchmarks and much prettier tables. You can get more information (including the ugly tables) from my blog http://unlines.wordpress.com/2009/11/27/noslow and NoSlow itself from Hackage http://hackage.haskell.org/package/NoSlow Any help would be highly appreciated as I don't have a lot of time to work on it. Roman

1 0

CMCS 2010: First call for papers
by Alexandra Silva 26 Nov '09

26 Nov '09

------------------------------------------------------------------------------ CMCS 2010 First call for papers ------------------------------------------------------------------------------ The Tenth International Workshop on Coalgebraic Methods in Computer Science 26-28 March 2010, Paphos, Cyprus (co-located with ETAPS 2010) http://event.cwi.nl/cmcs10/ Aims and scope ------------------ The aim of the workshop is to bring together researchers with a common interest in the theory of coalgebras and its applications. Over the last two decades, coalgebra has developed into a field of its own, presenting a mathematical foundation for various kinds of dynamical systems, infinite data structures, and logics. Coalgebra has an ever growing range of applications in and interactions with other fields such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The topics of the workshop include, but are not limited to: * the theory of coalgebras (including set theoretic and categorical approaches); * coalgebras as computational and semantical models (for programming languages, dynamical systems, etc.); * coalgebras in (functional, object-oriented, concurrent) programming; * coalgebras and data types; * (coinductive) definition and proof principles for coalgebras (with bisimulations or invariants); * coalgebras and algebras; * coalgebraic specification and verification; * coalgebras and (modal) logic; * coalgebra and control theory (notably of discrete event and hybrid systems). An anniversary: the 10th CMCS ---------------------------------------- CMCS took place for the first time when ETAPS started, in 1998. Since then, it has always been collocated with ETAPS, becoming bi-annual since the start of CALCO (Conference on Algebra and Coalgebra) in 2005. In 2010, we will celebrate the 10th edition of CMCS, by inviting a number of specialists in the field to present overviews of both obtained results and future challenges. Invited Speakers --------------------- At this tenth meeting the following invited speakers will present overviews of important subareas. * Venanzio Capretta: Coalgebra in functional programming and type theory * Bartek Klin: Operational semantics coalgebraically * Dirk Pattinson: Logic and coalgebra * Ana Sokolova: Probabilistic systems coalgebraically Submissions -------------- There are two types of submissions possible: (a) Papers to be evaluated by the PC for publication in the proceedings: They must have a length no greater than 20 pages. They must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Accepted papers will appear in ENTCS (style files can be found in http://www.entcs.org/) The web-based system EasyChair will be used for submission (http://www.easychair.org/conferences/?conf=cmcs10) After the event, a special journal issue of selected papers will be considered. (b) Short contributions: These will not be published in the proceedings but will be bundled in a CWI technical report. They should be no more than two pages and may describe work in progress, summarise work submitted to a conference or workshop elsewhere, or in some other way appeal to the CMCS audience. For short submissions, the style file easychair.cls should be used (http://www.easychair.org/coolnews.cgi) The submission (pdf file) is via email: cmcs10(a)cwi.nl. Important dates ------------------- * 8 January 2010: strict submission deadline regular papers * 13 February 2010: notification regular papers * 15 February 2010: deadline early registration * 20 February 2010: final version * 27 February 2010: strict submission deadline short contributions * 6 March 2010: notification short contributions * 26-28 March 2010: the workshop Programme Committee ------------------------ Jiri Adamek (Braunschweig) Alexandru Baltag (Oxford) Luis Barbosa (Braga) Marcello Bonsangue (Leiden) Corina Cirstea (Southampton) Robin Cockett (Calgary) Andrea Corradini (Pisa) Neil Ghani (Glasgow) Peter Gumm (Marburg) Furio Honsell (Udine) Bart Jacobs (Nijmegen, co-chair) Bartek Klin (Cambridge) Clemens Kupke (London) Alexander Kurz (Leicester) Marina Lenisa (Udine) Stefan Milius (Braunschweig) Ugo Montanari (Pisa) Larry Moss (Bloomington) Milad Niqui (Amsterdam) Dirk Pattinson (London) Dusko Pavlovic (Oxford) John Power (Edinburgh) Horst Reichel (Dresden) Grigore Rosu (Urbana) Jan Rutten (Amsterdam, co-chair) Davide Sangiorgi (Bologna) Lutz Schroeder (Bremen) Alexandra Silva (Amsterdam) Hendrik Tews (Nijmegen) Tarmo Uustalu (Tallinn) Yde Venema (Amsterdam) Hiroshi Watanabe (Osaka) James Worrell (Oxford) Organising Committee -------------------------- Bart Jacobs, Milad Niqui (co-chair, CWI), Jan Rutten, Alexandra Silva (co-chair, CWI). Contact ---------- cmcs10(a)cwi.nl .

1 0