October 2010 - Haskell

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

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

[Haskell] ANNOUNCE: Sifflet visual programming language, release 1.2
by gdweber＠iue.edu 31 Oct '10

31 Oct '10

Sifflet and sifflet-lib 1.2 are now available on Hackage. Sifflet is a visual, functional programming language and support system for students learning about recursion. Sifflet programmers define functions by drawing diagrams, and the Sifflet interpreter uses diagrams to show how the function calls are evaluated. Sifflet-lib is the library containing many modules of the sifflet application. What's New ---------- - Compatible with and requires HXT version 9.0 - Sifflet(-lib) requires only the core of HXT. Due to the split of HXT into several packages, sifflet no longer indirectly requires curl. This should make it easier to install on Windows! However, I haven't been able to test installing it on Windows myself. Reports are welcome! About Sifflet ------------- Sifflet is a visual, functional programming language intended as an aid for learning about recursion. * A picture explains Sifflet better than words: please see the screenshot showing how to evaluate 3!: http://mypage.iu.edu/~gdweber/software/sifflet/home.html * Features: - Visual editor. - Visual tracer/debugger which shows how recursive and other function calls are evaluated. To support active learning and avoid screen clutter, Sifflet displays only as much of the computation as the user requests. - A carefully crafted tutorial with 31 pictures and about as many pages. - Number, string, and list data types. - A small collection of primitive functions. - Runnable examples of compound functions. - Sifflet functions can be "exported" to Scheme, Python 3, and Haskell. * Download: http://hackage.haskell.org/package/sifflet-lib http://hackage.haskell.org/package/sifflet * Home page: http://mypage.iu.edu/~gdweber/software/sifflet/home.html * Tutorial: http://mypage.iu.edu/~gdweber/software/sifflet/doc/tutorial.html -- ___ ___ __ _ / _ \ / _ \| | | | Gregory D. Weber, Associate Professor / /_\// / | | | /\ | | Indiana University East / /_\\/ /__| | |/ \| | http://mypage.iu.edu/~gdweber/ \____/\_____/\___/\__/ Tel. (765) 973-8420; FAX (765) 973-8550

1 0

Specification and prover for Haskell
by Romain Demeyer 31 Oct '10

31 Oct '10

Hello, I'm working on static verification in Haskell, and I search for existing works on specification of Haskell programs (such as pre/post conditions, for example) or any other functional language. It would be great if there exists a prover based on this kind of specifications. I already found the ESC/Haskell. Do you know some other works which could be interesting? Thanks, rde.

9 8

ANNOUNCE zeno 0.1.0
by Will Sonnex 31 Oct '10

31 Oct '10

Hi all, My masters project Zeno was recently mentioned on this mailing list so I thought I'd announce that I've just finished a major update to it, bringing it slightly closer to being something useful. Zeno is a fully automated inductive theorem proving tool for Haskell programs. You can express a property such as "takeWhile p xs ++ dropWhile p xs === xs" and it will prove it to be true for all values of p :: a -> Bool and xs :: [a], over all types a, using only the function definitions. Now that it's updated it can use polymorphic types/functions, and you express properties in Haskell itself (thanks to SPJ for the suggestion). It still can't use all of Haskell's syntax: you can't have internal functions (let/where can only assign values), and you can't use type-classed polymorphic variables in function definitions - you'll have to create a monomorphic instance of the function -but I hope to have these added reasonably soon. It's also still missing primitive-types/IO/imports so it still can't be used with any real-world Haskell code, it's more a bit of theorem proving "fun". You can try it out at http://www.doc.ic.ac.uk/~ws506/tryzeno, the code file given there has some provable properties about a few prelude functions among other things. Another feature is that it lists all the sub-properties it has proven within each proof. When it verifies insertion-sort "sorted (insertsort xs) === True" it also proves the antisymmetry of "<=" and that the "insert" function preserves the "sorted" property. Any suggestions or feedback would be greatly appreciated. Cheers, Will

1 0

ANNOUNCE: darcs 2.5
by Reinier Lamers 30 Oct '10

30 Oct '10

Hi all, The darcs team is proud to announce the release of darcs 2.5. Darcs 2.5 contains many improvements over the 2.4 series. Most notable are the performance improvements in record and pull and the --bisect option for trackdown. The easiest way to install darcs 2.5 is using the Haskell Platform [1]. If you have installed the Haskell Platform or cabal-install, you can install this beta release by doing: $ cabal update $ cabal install darcs Alternatively, you can download the tarball from http://darcs.net/releases/darcs-2.5.tar.gz and build it by hand as explained in the README file. What's New ---------- A list of important changes since darcs 2.4.4: * trackdown can now do binary search with the --bisect option * darcs always stores patch metadata encoded with UTF-8 * diff now supports the --index option * amend-record now supports the --ask-deps option * apply now supports the --match option * amend-record has a new --keep-date option * inventory-changing commands (like record and pull) now operate in constant time with respect to the number of patches in the repository * the push, pull, send and fetch commands no longer change the default repository address by default * the --edit-description option is now on by default for the send command Issues resolved since darcs 2.4.4: * 64: store metadata as UTF-8 * 121: add --ask-deps support to amend-record * 643: darcs send -o outputs remote repo email address * 1159: avoid bogus repository cache entries * 1176: caches interfere with --remote-repo flag * 1208: add trackdown --bisect * 1210: global cache gets recorded in _darcs/prefs/sources * 1232: darcs convert copies _darcs/prefs/prefs * 1250: check for newlines in setpref values * 1277: percolate repository format errors correctly * 1288: the main darcs code now compiles and runs with witnesses * 1290: support diff --index * 1337: don't show unrelated patches in darcs changes on untracked path * 1389: change predist pref to point people to use 'cabal sdist' * 1427: accept gzipped patch bundles in darcs apply * 1456: make dist write more portable archives * 1473: make annotate accept '.' as argument * 1503: prefer local caches to remote ones * 1713: shorter interactive prompts * 1716: allow mail header lines of all whitespace in test * 1719: do not back up files when no conflict markers are inserted * 1726: don't consider all files with _darcs prefix boring * 1739: make ColorPrinter handle characters > 255 * 1763: use correct filename encoding in conflictors * 1765: refuse to remove non-tracked directories recursively * 1769: add support for --match 'comment ...' * 1784: push and pull print remote address right away * 1815: work around Cabal sdist permissions issue * 1817: fix support for external merge tools * 1824: avoid PACKAGE_VERSION under Windows * 1825: do not omit important prims in unrecordedChanges w/ files * 1860: (un)applying move patches doesn't corrupt pristine * 1861: fix typo in --no-boring help * 1874: recognise network tests on cabal test command line * 1875: avoid accidentally setting default * 1879: notice unexpected commute failure on merge * 1887: add a missing newline to --list-options output * 1893: move fields of conditional builds within scope of condition * 1898: notify user when they can use set-default * 1913: sort changes in treeDiff Reporting bugs -------------- If you have an issue with darcs 2.5, you can report it via the web on http://bugs.darcs.net/ . You can also report bugs by email to bugs(a)darcs.net. Kind Regards, the darcs release manager, Reinier Lamers [1]: You can download the Haskell platform from http://hackage.haskell.org/platform/

1 0

Haskell Weekly News: Issue 156 - October 27, 2010
by Daniel Santa Cruz 28 Oct '10

28 Oct '10

Welcome to issue 156 of the HWN, a newsletter covering developments in the [1]Haskell community in the week of October 17 - 28. I did not manage to filter out good posts from Haskell-Cafe this week. If you see a thread in -cafe that you think would be good to share with the community, please do share it with me. I need to find a better way of keeping up with the mountain of posts to that list. There were a total of 34 new stories posted to the Haskell Reddit channel (+10), 47 new questions taged with Haskell in StackOverflow (+20), and 332 messages posted to Haskell-Cafe (-76). So, what was hot last week? Announcements John Hughes [2]announced that the Functional Programming group at Chalmers is recruiting a postdoctoral researcher for a two year position, starting as soon as possible. Wouter Swierstra [3]called for workshop and co-located event proposals for the ICFP 2011 in Tokyo, Japan. Zhong Shao [4]informed us that the Department of Computer Science at Yale University is seeking applicants for a PostDoc and PhD positions in the broad area of certified software. Josh Tripplett wrote in to tell us about Ore, a [5]packaging system for Ruby inspired by Haskell's Cabal! According to [6]this haskell community calendar, there are 2 events to take note happening next week: The Haskell Communities & Activities Report submission deadline on Nov 1, and BelHac (in Ghent, Belgium) on Nov 5 - 7. Top Reddit Stories * The Haskell Platform is now in Ubuntu Domain: packages.ubuntu.com Score: 58, Comments: 5 On Reddit: http://www.reddit.com/r/haskell/comments/dtffi/the_haskell_platform_is_now_… Original: http://packages.ubuntu.com/maverick/haskell-platform * ghcjs: Haskell to Javascript: now released Domain: github.com Score: 36, Comments: 4 On Reddit: http://www.reddit.com/r/haskell/comments/dujnb/ghcjs_haskell_to_javascript_… Original: http://github.com/sviperll/ghcjs#readme * GHC Blog: New directions for Template Haskell Domain: hackage.haskell.org Score: 32, Comments: 3 On Reddit: http://www.reddit.com/r/haskell/comments/dtav8/ghc_blog_new_directions_for_… Original: http://hackage.haskell.org/trac/ghc/blog/Template%20Haskell%20Proposal * A brief tale of faster equality Domain: serpentine.com Score: 27, Comments: 10 On Reddit: http://www.reddit.com/r/haskell/comments/dt76u/a_brief_tale_of_faster_equal… Original: http://www.serpentine.com/blog/2010/10/19/a-brief-tale-of-faster-equality/ * MTL 2.0 has been uploaded good bye old mtl, hello monads-fd! Domain: hackage.haskell.org Score: 25, Comments: 6 On Reddit: http://www.reddit.com/r/haskell/comments/dx8ml/mtl_20_has_been_uploaded_goo… Original: http://hackage.haskell.org/package/mtl-2.0.0.0 * Haskell Rapid Transit Domain: mtnviewmark.wordpress.com Score: 23, Comments: 4 On Reddit: http://www.reddit.com/r/haskell/comments/duqp0/haskell_rapid_transit/ Original: http://mtnviewmark.wordpress.com/2010/10/21/haskell-rapid-transit/ * mathblog: A program for creating and managing a static, mathematically-inclined weblog Domain: hackage.haskell.org Score: 20, Comments: 0 On Reddit: http://www.reddit.com/r/haskell/comments/duh1o/mathblog_a_program_for_creat… Original: http://hackage.haskell.org/package/mathblog-0.2 * Lazy Type-Level Programming: nice trick by Max Bolingbroke Domain: haskell.org Score: 20, Comments: 1 On Reddit: http://www.reddit.com/r/haskell/comments/duu54/lazy_typelevel_programming_n… Original: http://www.haskell.org/pipermail/haskell-cafe/2010-October/085307.html * Let's build a compiler (in Haskell): Part 12 - Introducing the State Monad Domain: alephnullplex.appspot.com Score: 19, Comments: 14 On Reddit: http://www.reddit.com/r/haskell/comments/du38c/lets_build_a_compiler_in_has… Original: http://alephnullplex.appspot.com/blog/view/2010/10/19/lbach-introducing-the… * What's the status of Haskell on the iPhone? Domain: self.haskell Score: 18, Comments: 5 On Reddit: http://www.reddit.com/r/haskell/comments/dsyij/whats_the_status_of_haskell_… Original: /r/haskell/comments/dsyij/whats_the_status_of_haskell_on_the_iphone/ Top StackOverflow Questions * Question (votes: 33, answers: 8): Best explanation for Languages without Null Read on SO: http://stackoverflow.com/questions/3989264/best-explanation-for-languages-w… * Question (votes: 16, answers: 6): Saving my running toplevel for later Read on SO: http://stackoverflow.com/questions/3966925/saving-my-running-toplevel-for-l… * Question (votes: 10, answers: 2): What's the difference between undefined in Haskell and null in Java? Read on SO: http://stackoverflow.com/questions/3962939/whats-the-difference-between-und… * Question (votes: 9, answers: 2): Is FC++ used by any open source projects? Read on SO: http://stackoverflow.com/questions/3995942/is-fc-used-by-any-open-source-pr… * Question (votes: 8, answers: 3): What is the difference between forall a. [a] and [forall a. a]? Read on SO: http://stackoverflow.com/questions/3961851/what-is-the-difference-between-f… * Question (votes: 6, answers: 5): In Haskell, is there any way to express that a type should be an instance of a typeclass in more than one way? Read on SO: http://stackoverflow.com/questions/3998732/in-haskell-is-there-any-way-to-e… * Question (votes: 5, answers: 3): Pure exceptions in Haskell Read on SO: http://stackoverflow.com/questions/3961536/pure-exceptions-in-haskell * Question (votes: 5, answers: 1): How to use fromInteger with no implicit prelude in Haskell? Read on SO: http://stackoverflow.com/questions/3969413/how-to-use-frominteger-with-no-i… * Question (votes: 5, answers: 7): Is this Fibonacci sequence function recursive? Read on SO: http://stackoverflow.com/questions/3980756/is-this-fibonacci-sequence-funct… * Question (votes: 5, answers: 1): Any Sparse Linear Algebra package in Haskell? Read on SO: http://stackoverflow.com/questions/3995323/any-sparse-linear-algebra-packag… Quotes of the Week If you'd like to have a quote you see in IRC here, use the following syntax: @remember WhoSaidIt Quote. I'm currently scrapping IRC logs to find this data, so don't worry if lambdabot doesn't cooperate. * chrisdone: Production of two-handed use langes Schwerts with long flambard blades and heavily category-theoretically decorated guards, katzbalgers, axes, mail and Macedonian quality defence pikes. Lambda Knights need to be prepared for the inevitable battle against success. HackageDB Updates Who contributed, and what got uploaded? * AlbertoRuiz: hmatrix-special * AlessandroVermeulen: lhs2TeX-hl * AlexanderSolla: Facts * AlexeyKhudyakov: histogram-fill, monoid-statistics, mwc-random-monad * AntonKholomiov: csound-expression, temporal-media * AristidBreitkreuz: monadLib-compose, xml-monad * AycanIrican: hweblib * BasVanDijk: concurrent-extra, dstring, explicit-iomodes, explicit-iomodes-bytestring, explicit-iomodes-text, repr, string-combinators, threads, usb, usb-enumerator * BryanOSullivan: text * ChrisKuklewicz: regex-tdfa, regex-tdfa-unittest * ClaudeHeilandAllen: gmndl, qd * DanielDiaz: HaTeX * DonaldStewart: plugins * EugeneKirpichov: splot * GregWeber: xss-sanitize * HenkJanVanTuyl: GeBoP * HolgerReinhardt: amqp * HugoPacheco: pointless-rewrite * JamesCook: priority-queue, queue * JeremyShaw: formlets-hsp * JoelCrisp: bindings-gts * JohanTibell: network * JohnMillikin: anansi, cpython, enumerator-fd, enumerator, enumerator-tf, yajl-enumerator, yajl * JonathanDaugherty: mathblog * JudeNagurney: augeas * KetilMalde: a50, flower * MagnusTherning: archlinux, archlinux-web, cabal2arch * MasatakeDaimon: bindings-audiofile, bindings-EsounD * MichaelIlseman: yaml-light * MichaelSnoyman: authenticate, convertible-text, data-object-json, data-object, data-object-yaml, hamlet, mime-mail, wai-handler-devel, wai-handler-webkit, web-encodings, yesod-auth, yesod * MichelBoucey: ip6addr * NeilMitchell: hlint * OlegBelozeorov: xmms2-client-glib, xmms2-client * OscarFinnsson: text-xml-qq * PeterSimons: vty * PetrRockai: darcs-fastconvert * RoelVanDijk: base-unicode-symbols, containers-unicode-symbols * RyanNewton: wordsetdiff * SimonMarlow: stm * StephenBlackheath: hexpat * StephenTetley: wumpus-basic, wumpus-microprint, wumpus-tree * ThomasDuBuisson: control-event, crypto-api, gps, hsXenCtrl, ipc * TomHawkins: fountain * ViktorDevecseri: bloxorz About the Haskell Weekly News New editions are posted to [7]the Haskell mailing list as well as to [8]the Haskell Sequence and [9]Planet Haskell. [10]RSS is also available, and headlines appear on [11]haskell.org. To help create new editions of this newsletter, please send stories to dstcruz * at * gmail * dot * com. The code used to produce this version of the newsletter is not yet publicly available, as it is a complete hack designed to get things started again. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.general/18252 3. http://article.gmane.org/gmane.comp.lang.haskell.general/18260 4. http://article.gmane.org/gmane.comp.lang.haskell.general/18261 5. http://postmodern.github.com/2010/10/25/mining-rubygems-from-ore.html 6. https://sites.google.com/site/haskellcommunitycalendar/ 7. http://www.haskell.org/mailman/listinfo/haskell 8. http://sequence.complete.org/ 9. http://planet.haskell.org/ 10. http://sequence.complete.org/node/feed 11. http://haskell.org/

1 0

ANN: mutable-iter
by John Lato 26 Oct '10

26 Oct '10

Dear all: I am pleased to announce the initial release of "mutable-iter"[1], an extension to the iteratee package which uses mutable buffers. This allows for iteratees to act upon a mutable buffer, which means that processing can occur without performing any extra allocations. This may be useful for applications in which garbage collections interfere with processing (e.g. real-time applications), or under severe memory pressure. This package is highly experimental and somewhat low-level; bug reports and suggestions are welcome! Thanks, John [1] http://hackage.haskell.org/package/mutable-iter

1 0

Call for Contributions - Haskell Communities and Activities Report, November 2010 edition
by Janis Voigtländer 26 Oct '10

26 Oct '10

Dear all, It is time to collect contributions for the 19th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/communities/ Submission deadline: 1 November 2010 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough -- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the May 2010 edition -- you will find interesting topics described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Janis (current editor) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/11-2010/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2010/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have received your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. If you have several entries to submit, it helps if you send them in separate emails. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. This corresponds to approximately one page, or 40 lines of text, with the above style and template. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. You can use it to write "wishlist" items for libraries and language features you would like to see implemented. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them.

1 1

CFP: Term and Graph Rewriting/TERMGRAPH 2011
by Rachid Echahed 25 Oct '10

25 Oct '10

Apologies for multiple copies ------------------------------------------------------------------------- CALL FOR PAPERS TERMGRAPH 2011 6th International Workshop on Computing with Terms and Graphs a Satellite Event of ETAPS 2011 Saarbrücken, Germany, April 2nd, 2011 http://termgraph2011.imag.fr http://www.termgraph.org.uk/ Full versions of best papers will be included in an issue of the international journal Mathematical Structures in Computer Science (MSCS) -------------------------------------------------------------------------- TERMGRAPH 2011 is a one-day satellite event of ETAPS 2011 <http://www.etaps.org/>, which will take place in Saarbrücken, Germany, from March 26 to April 3rd, 2011. Previous editions of the TERMGRAPH workshops series (http://www.termgraph.org.uk/) took place in Barcelona (2002), in Rome (2004), in Vienna (2006), in Braga (2007) and in York (2009). Aims and scope Research in term and graph rewriting ranges from theoretical questions to practical issues. Computing with graphs handles the sharing of common subexpressions in a natural and seamless way, and improves the efficiency of computations in space and time. Sharing is ubiquitous in several research areas, for instance : the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages: many implementations of functional, logic, object-oriented, concurrent and mobile calculi are based on term graphs. Term graphs are also used in automated theorem proving and symbolic computation systems working on shared structures. The aim of this workshop is to bring together researchers working in different domains on term and graph transformation and to foster their interaction, to provide a forum for presenting new ideas and work in progress, and to enable newcomers to learn about current activities in term graph rewriting. -------------------------------------------------------------------------- Topics of Interest Topics of interest are open and include all aspects of term graphs and sharing of common subexpressions in rewriting, programming, automated reasoning and symbolic computation. This includes (but is not limited to): term rewriting, graph transformation, programming languages, models of computation, graph-based languages, semantics and implementation of programming languages, compiler construction, pattern recognition, databases, bioinformatics, and system descriptions. -------------------------------------------------------------------------- Submissions and Publication Authors are invited to submit either regular papers (up to 15 pages), or position papers, system descriptions, work in progress, extended abstracts (5-7 pages), via the EasyChair system, at URL http://www.easychair.org/conferences/?conf=termgraph2011 Submissions should be in PostScript or PDF format, using the EPTCS style files (http://style.eptcs.org/) Preliminary proceedings will be distributed at the workshop. Selected authors will be invited to submit a full version of their papers after the workshop. These submissions will pass through a second round of reviewing and accepted contributions are to be published as a special issue of the international journal Mathematical Structures in Computer Science (MSCS). -------------------------------------------------------------------------- Important Dates December 8, 2010 Abstract submission December 15, 2010 Paper submission January 16, 2011 Notification of acceptance February 4, 2011 Pre-proceedings version due -------------------------------------------------------------------------- Programme Committee Paolo Baldan, University of Padova, Italy Andrea Corradini, University of Pisa, Italy Frank Drewes, Umea University, Sweden Rachid Echahed (chair), CNRS, LIG Laboratory, France Tetsuo Ida, University of Tsukuba, Japan Wolfram Kahl, McMaster University, Canada Ian Mackie, Ecole Polytechnique, France Detlef Plump, University of York, UK -------------------------------------------------------------------------- Contact Rachid Echahed, LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 0