- Haskell - Haskell.org

ANNOUNCE: genprog-0.1
by Jan Snajder 08 Dec '10

08 Dec '10

Dear Haskellers, I am pleased to announce the release of genprog-0.1, a genetic programming library. Genetic programming is an evolutionary technique, inspired by biological evolution, to evolve programs for solving specific problems. A genetic program is represented by a value of an algebraic datatype and associated with a custom-defined fitness value indicating the quality of the solution. Starting from a randomly generated initial population of genetic programs, the genetic operators of selection, crossover, and mutation are used to evolve programs of increasingly better quality. genprog-0.1 is available from Hackage at: http://hackage.haskell.org/package/genprog An example of how to use the library is included in the documentation. Cheers, Jan

2 1

ANN: hledger 0.13
by Simon Michael 07 Dec '10

07 Dec '10

I've released hledger 0.13, with readline editing and tab completion from Judah Jacobson, more ledger compatibility, a more robust and installable web interface, bugfixes, and a much-deliberated package split. Docs and mac and 64-bit linux binaries are at http://hledger.org , and of course you can cabal update and cabal install hledger, cabal install hledger-web and so on. I didn't manage to build new windows or linux 32-bit binaries today, but they'll appear when I do. Let it be noted that maintaining a non-trivial cross-platform haskell app is currently quite hard. Release notes: * move web, vty, chart commands into separate hledger-web, hledger- vty, hledger-chart packages. This both simplifies (no more build flags) and complicates (more room for dependency hassles), but I hope overall it will be easier and more scalable. * all packages but chart are now marked "beta", ie "not finished but suitable for everyday use" * parsing: ledger compatibility: support D default commodity directive * parsing: ledger compatibility: ignore metadata tags on transactions and postings * parsing: ledger compatibility: ignore cleared flags at the start of postings * parsing: ledger compatibility: ignore C commodity conversion directives * parsing: price precisions no longer affect commodities' display precisions * add: readline-style editing * add: tab-completion for account names * add: add the default commodity, if any, to commodity-less amounts (#26) * add: misc. commodity/precision/defaults-related bugfixes * chart: give a meaningful error message for empty journals * chart: update for current Chart lib (0.14) * web: support files now live in ./.hledger/web/ and will be auto- created at startup * web: page layout is more robust with wide content * web: allow editing of included files * web: handle multiple filter patterns correctly * web: allow single- or double-quoted filter patterns containing spaces * web: update for current yesod lib (0.6.*) * transaction balancing is now based on display precision (#23) * briefer, more informative usage error messages Stats: 91 days and 117 commits since last release, now at 5997 lines of code with 151 tests. hledger is at a point where real-world user and developer input is needed to focus it; participants welcome. Best, -Simon

1 0

ANNOUNCE: GHC version 7.0.1
by Ian Lynagh 07 Dec '10

07 Dec '10

============================================================= The (Interactive) Glasgow Haskell Compiler -- version 7.0.1 ============================================================= The GHC Team is pleased to announce a new major release of GHC. Since the 6.12 branch we are delighted that more than 60 people have contributed patches to GHC or the accompanying libraries and utilities. There have been a number of significant changes since the last major release, including: * GHC now defaults to the Haskell 2010 language standard * -fglasgow-exts is now deprecated, in favour of the individual extension flags * On POSIX platforms, there is a new I/O manager based on epoll/kqueue/poll, which allows multithreaded I/O code to scale to a much larger number (100k+) of threads * GHC now includes an LLVM code generator which, for certain code, can bring some nice performance improvements * The type checker has been overhauled, which means it is now able to correctly handle interactions between the type systemextensions * The inliner has been overhauled, which should in general give better performance while reducing unnecessary code-size explosion * Large parts of the runtime system have been overhauled, including fixing several instances of pathological performance when there are large numbers of threads * Due to changes in the runtime system, if you are using Control.Parallel.Strategies from the parallel package, please upgrade to at least version 2 (preferably version 3) * The full Haskell import syntax can now been used to bring modules into scope in GHCi * GHC now comes with a more recent mingw bundled on Windows, which includes a fix for windres on Windows 7 * There is a new -fno-ghci-sandbox flag, which stops GHCi running computations in a separate thread; in particular, this works around an issue running GLUT from GHCi on OS X The full release notes are here: http://new-www.haskell.org/ghc/docs/7.0.1/html/users_guide/release-7-0-1.ht… How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language; the current language version is Haskell 98, agreed in December 1998 and revised December 2002. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

2 1

Link to Gentle Tutoral broken
by Eileen Head 06 Dec '10

06 Dec '10

Is "A Gentle Tutoral" still available @haskell.org?

1 0

Memory management job
by Simon Peyton-Jones 06 Dec '10

06 Dec '10

Dear Haskellers and Camlers I'm posting this job ad on behalf of Richard Brooksby at Ravenbrook. They do cool stuff, and I thought some of you might be interested. Simon Ravenbrook is seeking a developer to work with us on the Memory Pool System (MPS), a mature, open source, high reliability, high performance memory management system with a unique and innovative architecture. You can read an overview here <http://www.ravenbrook.com/project/mps/doc/2002-01-30/ismm2002-paper/ismm200…>. The MPS is a highly engineered "Swiss watch" of a system with an extremely low bug rate. We're looking for someone who can support our commercial clients with customisations, but also develop the MPS for new opportunities. It could be a half-time position (or subcontract), paying about £35k pro rata. This could grow if you are successful in developing new commercial opportunities for the MPS. We have several other options for work structure and payment that we can discuss with you. There can be a great deal of flexibility and a higher rate of pay depending on what kind of risk/reward tradeoff you need. Ask! This is an excellent opportunity for someone interested in memory management and garbage collection research. We are keen to promote research, and the flexible nature of this work would allow time for it. It's also an excellent opportunity for someone interested in developing commercial applications for memory management and garbage collection. There would also be an opportunity to get involved with our other consulting work, or even video game development. Essential requirements: * you will mostly need to work at our office in Cambridge, UK * you will need to start early in 2011 * highly professional attitude to quality, reliability, and commercial relationships * able to self-start, plan, and manage yourself * excellent verbal and written technical communication skills * excellent knowledge of ISO/IEC 9899:1990 and ISO/IEC 9899:1999. (Oh OK then, I mean C.) * good understanding of operating systems and memory management * understanding of processor architectures and assembly language Also very useful: * some compiler and language run-time development experience * good understanding of threads, concurrency, and race/hazard issues * some low level systems and embedded systems experience * low-level Unix (including Mac) and Windows programming * some experience in soft real-time systems * keen interest in programming languages, compilers, provability Address in sig. Do get in touch. PLEASE NOTE: Generic CVs and resumes as Word document attachments will be trashed. Explain why you might be good for us, in plain text or on the phone. Thanks! --- Richard Brooksby <rb(a)ravenbrook.com<mailto:rb@ravenbrook.com>> Director Ravenbrook Limited <http://www.ravenbrook.com/> PO Box 205, Cambridge CB2 1AN, United Kingdom Voice: +44 777 9996245 Fax: +44 1223 750036

1 0

International Workshop on Intermediate Representations (WIR 2011)
by Simon Peyton-Jones 06 Dec '10

06 Dec '10

Dear functional friends Here's the Call for Papers for a new Workshop on Intermediate Representations. I expect it to get a lot of papers about the JVM and program dependence graphs, but the Chair explicitly wants papers about intermediate representations for functional programs, both typed and untyped. So, do me a favour :-) and submit your paper, lest I get landed with a mountain of SSA papers to review. (Yes, SSA is just CPS in disguise. But the disguise is heavy.) The deadline is rather short: Jan 21. Happy Christmas! Simon ============================== Call for Papers International Workshop on Intermediate Representations (WIR 2011) Co-located with CGO 2011, April 2/3 2011 in Chamonix, France http://researchr.org/conference/wir-2011 Description =========== The intermediate representation is the core of any program transformation tool. Its design has a significant impact on the simplicity, efficiency, and effectiveness of program transformations. The developments in concurrent programming, integrated development environments, and domain-specific languages pose new requirements on intermediate representations. This workshop provides a forum to discuss current trends and experiences in the design, implementation, and application of intermediate representations. Topics of Interest ================== The list of topics includes, but is not limited to: * intermediate representations for o parallelism and concurrency o instrumentation o JIT compilation o compiler verification o domain-specific languages o refactoring o integrated development environments * functional intermediate representations for imperative programs * translation to, and code generation from an IR * modeling low-level machine details in IRs * impact of IR on the precision of static analyzers * representing static analysis results in an IR * origin tracking Submission ========== We solicit submission of original papers on topics relevant to intermediate representations. Papers should be formatted in SIGPLAN Proceedings Format, 9 point font, and be at most 8 pages in length. * http://www.acm.org/sigs/sigplan/authorInformation.htm Selected papers will be published in the ACM digital library (to be confirmed). Papers should be submitted electronically with easychair: * http://www.easychair.org/conferences/?conf=wir2011 Important Dates =============== * Submission: January 21, 2011 * Notification: February 25, 2011 * Camera-ready: March 18, 2011 * Workshop: April 2/3, 2011 Organizers ========== * Florent Bouchez * Sebastian Hack * Eelco Visser Program Committee ================= * Florent Bouchez (chair) * Martin Bravenboer * Albert Cohen * François de Ferrière * Robert Fuhrer * Sebastian Hack (chair) * Andrew Kennedy * Sorin Lerner * Nathaniel Nystrom * Simon Peyton Jones * Tijs van der Storm * Eelco Visser (chair)

1 0

ANNOUNCE: Sifflet visual programming language, release 1.2.2
by gdweber＠iue.edu 03 Dec '10

03 Dec '10

Sifflet and sifflet-lib 1.2.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 ---------- - December 3, 2010: Version 1.2.2 provides a little safety for users who close the main (Workspace) window. The application now offers to save a file, if there are changes, and quits. - November 19, 2010: Version 1.2.1 (previously unannounced) provides compatibility with the latest Haskell GTK packages (gtk and friends version 0.12). 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

Biohaskell Weekly News (was: Notes from "Haskell takes over the world" BoF at ICFP)
by Ketil Malde 02 Dec '10

02 Dec '10

A long, long time ago, on a mailing list far away, Don Stewart <dons(a)galois.com> wrote: > Here are the notes transcribed from the Future of Haskell BoF held > after the Haskell Symposium last week. > * Need to encourage special interest groups (SIGs) to form around > particular domain areas in the libraries. AI, BioInf, Networking, > etc. ^^^^^^ Recently, there seems to have been an increased interest in bioinformatics and Haskell, and I thought it would be a good idea to try to organize the community a bit. After discussing it a bit, we now have: 1) A DNS domain: biohaskell.org 2) A mailing list: http://biohaskell.org/cgi-bin/mailman/listinfo/biohaskell 3) A gitit wiki: http://biohaskell.org If you are interested in bioinformatics and the Haskell programming language, please subscribe to the mailing list and add your voice on the wiki. -k (Also announced at http://blog.malde.org/index.php/2010/11/28/towards-a-biohaskell-community/ but I guess not everybody subscribes to the RSS feed :-) -- If I haven't seen further, it is by standing in the footprints of giants

1 0

[haskell] EXTENDED DEADLINE : ICECCS 2011
by Isabelle Perseil 02 Dec '10

02 Dec '10

********************************************************************** CALL FOR PAPERS: ICECCS 2011 http://www.iceccs.org/2011 16th Annual IEEE International Conference on the Engineering of Complex Computer Systems (ICECCS) sponsored by the IEEE Technical Committee on Complexity in Computing (TCCX) April 27th-29th, 2011 Las Vegas, NV, USA ************************************************************************ Extended Submission deadline: December 15th, 2010 -------------------------------------------------- The success of key human activities ranging from research and business to everyday services relies on the use of ever more sophisticated, feature-rich and complex computer systems. These complex computer systems are regularly required to accomplish more, faster and on a broader scale, to adapt dynamically to changing workloads, scenarios and objectives, and to achieve guaranteed levels of performance and dependability. Satisfying such demanding requirements in the presence of the variability, heterogeneity and non-linear behaviour that characterise complex computer systems poses numerous challenges to both their developers and their users. The aim of the conference is to bring together researchers, practitioners and leading experts from academia and industry, to advance the state of the art in the specification, development, validation and verification, and management of complex computer systems. Scope and topics: ================ Authors are invited to submit papers describing original, unpublished research results, case studies and tools. Additionally, submissions of poster papers are sought for two separate poster sessions: an "ongoing research" poster session, and a "PhD research" poster session. Topics of interest include but are not limited to the following aspects of complex computer systems: - Requirement specification and analysis - Verification and validation - Model-driven development - Reverse engineering and refactoring - Design by contract - Agile methods - Safety-critical & fault-tolerant architectures - Adaptive, self-managing and multi-agent systems - Real-time, hybrid and embedded systems - Systems of systems - Tools and tool integration - Industrial case studies Different kinds of contributions are sought, including novel research, lessons learned, experience reports, and discussions of practical problems faced by industry and user domains. The ultimate goal is to build a rich and comprehensive conference program that can fit the interests and needs of different classes of attendees: professionals, researchers, managers, and students. A program goal is to organize several sessions that include both academic and industrial papers on a given topic, and culminate with panels to discuss relationships between industrial and academic research. Full papers are divided into two categories: Technical Papers and Experience Reports. The papers submitted to both categories will be reviewed by program committee members, and papers accepted in either category will be published in the conference proceedings. Technical papers should describe original research, and experience reports should present practical projects carried out in industry, and reflect on the lessons learnt from them. Poster paper submissions should specify in their abstract whether they describe ongoing or PhD research. Both types of poster papers will be reviewed by program committee members, and accepted posters will be published in the conference proceedin Submission of Papers: ==================== Submitted manuscripts should be in English and formatted in the style of the IEEE Computer Society Proceedings Format. Papers should not exceed 10 pages for full papers and 2 pages for poster papers, including figures, references, and appendices. All submissions should be in PDF format. Submissions not adhering to the specified format and length may be rejected immediately, without review. See the submission guidelines on the conference web site. Important Dates: ================ Submission of titles and abstracts ASAP Submission of all papers 15 December, 2010 Notification of acceptance 10 January, 2011 Camera-ready material for publication 31 January, 2011 Registration deadline for authors 10 February, 2011 Early registration deadline for non-authors 22 February, 2011 General Chair: ============== Roy Sterritt, University of Ulster, Northern Ireland Program Chairs: =============== Karin Breitman, Pontificia Universidade Catolica do Rio de Janeiro, Brazil Isabelle Perseil, Inserm, France Program Committee: ================== Mithun Acharya, ABB Corporate Research, United States Marc Aiguier, Ecole Centrale Paris, France Yamine AitAmeur, LISI/ENSMA, France Luis Almeida, Fac. de Eng. da Universidade do Porto, Portugal Keijiro Araki, Kyushu University, Japan Luciano Baresi, DEI - Politecnico di Milano, Italy Yolande Berbers, Katholieke Universiteit Leuven, Belgium Gilles Bernot, University of Nice Sophia Antipolis, France Jürgen Börstler, Blekinge Institute of Technology, Sweden Jonathan P. Bowen, London South Bank University, United Kingdom Karin Breitman, PUC-Rio, Brazil Phil Brooke, University of Teesside, United Kingdom Jean-Michel Bruel, IRIT, France Michael Butler, University of Southampton, United Kingdom Jordi Cabot, INRIA-École des Mines de Nantes, France Radu Calinescu, Aston University, United Kingdom Antonio Cerone, International Institute for Software Technology United Nations University, Macau SAR China Corina Cirstea, University of Southampton, United Kingdom Patrick Cousot, New York University and École normale supérieure, France Jim Davies, University of Oxford, United Kingdom Juan deLara, Universidad Autónoma de Madrid, Spain Mieso Denko, UoG, Canada Felicita Di Giandomenico, ISTI-CNR, Italy Simon Dobson, University of St Andrews, United Kingdom Gilles Dowek, Laboratoire d'Informatique(LIX), École Polytechnique and INRIA, France Kerstin Eder, University of Bristol, United Kingdom Huascar Espinoza, ESI Tecnalia, Spain François Fages, INRIA, France Hector Figueiredo, BAE Systems, United Kingdom Franck Fleurey, SINTEF, Norway Robert France, Colorado State University, United States Leo Freitas, University of York, UK Carlo Alberto Furia, ETH Zurich, Switzerland Jean-Louis Giavitto, CNRS and University of Evry, France Mark Grechanik, Accenture Labs, United States Lindsay Groves, Victoria University of Wellington, New Zealand Esther Guerra, Universidad Autónoma de Madrid, Spain Gaétan Hains, Univeristy Paris Est, France Shinji Kikuchi, Fujitsu Laboratories, Japan Joseph Kiniry, IT University of Copenhagen, Denmark Fabrice Kordon, Univ. Paris 6, France Daniel Krob, Laboratoire d'Informatique(LIX), École Polytechnique and CNRS, France Ralf Laemmel, Universität Koblenz-Landau, Germany Phillip Laplante, Penn State University, United States Kung-Kiu Lau, The University of Manchester, United Kingdom Zhiming Liu, International Institute for Software Technology United Nations University,Macau SAR China Gerald Luettgen, University of Bamberg, Germany Tom Maibaum, McMaster University, Canada Tiziana Margaria, Potsdam University, Germany Julie McCann, Imperial College, United Kingdom Paul Mckee, BT Innovate and Design, United Kingdom Raffaela Mirandola, Politecnico di Milano, Italy Andrea Omicini, Università di Bologna, Italy Richard Paige, University of York, United Kingdom Laurent Pautet, Telecom ParisTech, France Isabelle Perseil, Inserm, France Robert Pettit, The Aerospace Corporation, United States Ivan Porres, Åbo Akademi University, Finland Awais Rashid, Lancaster University, United Kingdom Bernhard Rumpe, RWTH Aachen University, Germany Ricardo Sanz, Universidad Politecnica de Madrid, Spain Douglas Schmidt, Vanderbilt University, United States Cristina Seceleanu, Mälardalen University, Sweden Janet Smart, University of Oxford, United Kingdom Oleg Sokolsky, University of Pennsylvania, United States Ian Sommerville, St Andrews University, United Kingdom Jörn Guy Süß, ITEE, The University of Queensland, Australia Volker Stolz, United Nations University (UNU-IIST), Macau SAR China Jing Sun, The University of Auckland, New Zealand Clemens Szyperski, Microsoft Research, United States Kenji Taguchi, National Institute of Informatics, Japan Dalila Tamzalit, University of Nantes, France Bedir Tekinerdogan, Bilkent University, Turkey Suresh Thummalapenta, NC State University, United States Antonio Vallecillo, University of Malaga, Spain Tullio Vardanega, University of Padua, Italy Emil Vassev, Lero, Ireland Huibiao Zhu, East China Normal University, China Steffen Zschaler, King's College London, United Kingdom

1 0

Second CFP: Term and Graph Rewriting/TERMGRAPH 2011/ETAPS 2011
by Rachid Echahed 02 Dec '10

02 Dec '10

Apologies for multiple copies ------------------------------------------------------------------------- Second 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) -------------------------------------------------------------------------- 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 -------------------------------------------------------------------------- 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/) The Proceedings will be published in Electronic Proceedings in Theoretical Computer Science (EPTCS). 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 included in a special issue of the international journal Mathematical Structures in Computer Science (MSCS). -------------------------------------------------------------------------- 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