- Haskell - Haskell.org

ANN: hledger-web 0.15.1 (& hledger 0.15)
by Simon Michael 02 Sep '11

02 Sep '11

I've made a bugfix release of the hledger-web package, to fix build problems. hledger-web 0.15.1: * web: add missing Hledger.Web.Options to cabal file * web: tighten up dependencies to reduce build problems And here's another new dependency I forgot to mention: flot, the js charting library. The rest of this mail is a repeat of yesterday's announcement, since that one seriously confused google groups, gmane, and perhaps your mailreader (pro tip: don't re-edit old announcements with Mail.app's cmd-shift-d. :) -Simon Date: 2011/9/1 Subject: ANN: hledger 0.15 I'm pleased to announce hledger 0.15! This release includes work by Trygve Laugstøl, Dmitry Astapov, Clint Adams, Johann Klähn and myself. hledger is a library and set of user tools for working with financial data (or anything that can be tracked in a double-entry accounting ledger.) It is a haskell port and friendly fork of John Wiegley's Ledger. hledger provides command-line, curses and web interfaces, and aims to be a reliable, practical tool for daily use. Given a plain text file describing transactions of money or any other commodity, it will print the chart of accounts, account balances, or just the transactions you're interested in. It can also help you record new transactions, or convert CSV data from your bank. Home: http://hledger.org IRC: irc://irc.freenode.net/#ledger Install: cabal update; cabal install hledger [hledger-web hledger-vty hledger-chart hledger-interest] Platform-specific binaries, which are time-consuming to make and support, are now provided on request to financial donors - a great way to give back and help pay hosting costs! Best, -Simon Release notes for 0.15: * hledger's options are now modal, providing better help (using cmdargs) * hledger now lists and runs any hledger-* add-ons found in the user's path * case insensitivity of filter patterns has been fixed * parsing: `alias`/`end aliases` directives, for renaming accounts, are supported, like ledger's but a bit more powerful; also an `--alias` option for renaming on the fly * parsing: the `account` directive now preserves posting type (normal/virtual/balanced virtual) * parsing: the `pop` directive is supported as an alias for `end tag`, like ledger * parsing: `P` (historical price) directives can contain a (ignored) numeric time zone, like ledger * parsing: the leading `!` in directives is now optional and deprecated, like ledger * parsing: entries with a negative amount in the first posting now infer the correct balancing amount * parsing: bad date checking is more accurate * balance: collapsing of boring accounts to one line can be disabled with `--no-elide` * balance: fix a wrong precision regression from last release * convert: standard input can be converted * convert: an alternate rules file can be specified with `--rules` * convert: `account2-field` can be used when the CSV file specifies both accounts * convert: `description-field` can have a custom format and combine multiple CSV fields * convert: `in-field` and `out-field` support CSV files that use two amount columns * convert: don't fail when there's no default journal file * web: the web interface has been overhauled/cleaned up * web: account register views are now transaction-based, like gnucash etc., and show accurate historical balances when possible * web: simple balance charts are displayed (using flot) * web: more expressive and consistent search patterns, using a new matching engine * web: add form uses currently focussed account as default, redirects to itself, formats status messages better * web: sidebar now shows empty/boring accounts too * web: now uses warp and a newer yesod * api simplifications * importable Hledger, Hledger.Web, Hledger.Vty and Hledger.Chart modules * the basic reports are now provided by hledger-lib for easier reuse * new api use examples: `equity.hs`, `uniquify.hs` * some old base 3 support has been dropped * the old -s flag has been dropped Stats: Release contributors: Simon Michael, Trygve Laugstøl, Dmitry Astapov, Clint Adams, Johann Klähn 132 days, 314 commits, 18 end-user features and 6 end-user bugfixes since last release. 210 unit & functional tests and 55% unit test coverage (hledger, hledger-lib packages). 7642 lines of code (all packages).

1 0

ANN: bindings-DSL 1.0.14
by Maurício CA 02 Sep '11

02 Sep '11

FFI package bindings-DSL provides a language to describe foreign interfaces on top of hsc2hs. http://bitbucket.org/mauricio/bindings-dsl http://hackage.haskell.org/package/bindings-DSL New to this release is that you can get pointers to all declared fields of a structure. Suppose you have the following struct in C: struct a { int b; struct { char c; float d; } e; struct a *f; }; You write this in your .hsc file: #starttype struct a #field b , CInt #field e.c , CChar #field e.d , CFloat #field f , Ptr <a> #stoptype Besides the usual Storable instantiated Haskell version of struct a, (named C'a), now you also get the following: p'a'b :: Ptr C'a -> Ptr CInt p'a'e'c :: Ptr C'a -> Ptr CChar p'a'e'd :: Ptr C'a -> Ptr CFloat p'a'f :: Ptr C'a -> Ptr (Ptr C'a) Hope it's useful to you. Best, Maurício

2 1

ANNOUNCE: GA-0.1 - a genetic algorithm library
by Kenneth Hoste 01 Sep '11

01 Sep '11

Hello Haskellers, I'd like to announce the release of the GA library, which provides support for working with genetic algorithms in Haskell. Key features: * pragmatic implementation of a genetic algorithm, aimed at making it easy to use for evolving self-defined entities * flexible configuration * support for automatic checkpointing and restoring from the last available checkpoint * two toy examples included in the v0.1 release, which illustrate how to use the library Version 0.1, which has only been tested by me up until now, is available on Hackage: http://hackage.haskell.org/package/GA The master repository is on github: https://github.com/boegel/GA GA is available under a BSD3 license (if this would hinder you to use the GA library, please let me know). Comments/suggestions welcome. Enjoy! Kenneth

1 0

Haskell Weekly News: Issue 197
by Daniel Santa Cruz 31 Aug '11

31 Aug '11

Welcome to issue 197 the HWN, a newsletter covering developments in the Haskell community. This release covers the week of August 21 to 27, 2011. [1] http://goo.gl/8hDku Announcements Liyang HU announced HakkaTaikai, a Haskell hackathon in Tokyo, on Sunday September 25th, 2011. [2] http://goo.gl/tJ4F4 Qiuchi Jian wondered if anyone would be interested in joining him in translating the 2010 Haskell Report into Chinese. [3] http://goo.gl/QDdeF Johan Tibell announced the results of this year's "State of Haskell" survey. [4] http://goo.gl/26Evg New and Updated Projects * network-address (New - Sebastian Nowicki) Provides data structures for IP addresses as well as subnetworks. [5] http://goo.gl/LTuUK * shelltestrunner (Update - Simon Michael) Tests command-line programs or arbitrary shell commands. [6] http://goo.gl/uKHMo * netwire (Update - Ertugrul Soeylemez) An arrowized functional reactive programming library written with networking applications in mind. [7] http://goo.gl/yM0hy * instinct (New - Ertugrul Soeylemez) Library for neural networks. [8] http://goo.gl/yM0hy Quotes of the Week * elliott: i'm here to prove theorems and compile code and I'm all out of code * shachaf: To deepSeq is a fundamental right * djahandarie: I wonder if De Bruijn was any good at remembering names. * JaffaCake: In the beginning there were 8 registers, and That Was Enough For Everyone. * frezik: "The compiler accepted it, why can't you?" * Cale: the units of the monoids in the algebras for the monoid monad * _Ray_: fucking hell, math and cs need to stop having awesome interesting things. it's ruining my life. * accel: next time I'll read a few research papers before I start trolling hakell * ddarius: isJust :: Maybe a -> Bool; isJust = unsafeCoerce Top Reddit Stories * Interested in a 2nd edition of "Real World Haskell"? Domain: self.haskell, Score: 130, Comments: 33 On Reddit: [9] http://goo.gl/fNS6P Original: [10] http://goo.gl/fNS6P * GHC on ARM: Merged into GHC HEAD Domain: ghcarm.wordpress.com, Score: 78, Comments: 7 On Reddit: [11] http://goo.gl/BvFvX Original: [12] http://goo.gl/ZKDYx * Why Haskell is Kinda Cool Domain: amtal.github.com, Score: 56, Comments: 27 On Reddit: [13] http://goo.gl/9ealD Original: [14] http://goo.gl/0AJIn * Haskell for Kids: Week 2! Domain: cdsmith.wordpress.com, Score: 55, Comments: 20 On Reddit: [15] http://goo.gl/0Qm5z Original: [16] http://goo.gl/DzdUy * Results from the State of Haskell, 2011 Survey Domain: blog.johantibell.com, Score: 54, Comments: 18 On Reddit: [17] http://goo.gl/BAQye Original: [18] http://goo.gl/l6sc1 * PyPy: We need Software Transactional Memory Domain: morepypy.blogspot.com, Score: 49, Comments: 2 On Reddit: [19] http://goo.gl/6dPjT Original: [20] http://goo.gl/kNCma * mmmodularity! - A modular package language for Haskell Domain: skilpat.tumblr.com, Score: 48, Comments: 8 On Reddit: [21] http://goo.gl/6dfSf Original: [22] http://goo.gl/os9IJ * A Tutorial Introduction to the Lambda Calculus Domain: utdallas.edu, Score: 34, Comments: 9 On Reddit: [23] http://goo.gl/OtPrs Original: [24] http://goo.gl/zTIx4 * Functional representation of Rubik's cube Domain: pnyf.inf.elte.hu, Score: 30, Comments: 3 On Reddit: [25] http://goo.gl/TMOnc Original: [26] http://goo.gl/EoYbu * monad-control, for more flexible transformers Domain: yesodweb.com, Score: 27, Comments: 14 On Reddit: [27] http://goo.gl/XF6GZ Original: [28] http://goo.gl/ijd6V * A different haskell emacs mode (work in progress) Domain: chrisdone.com, Score: 26, Comments: 5 On Reddit: [29] http://goo.gl/lfmxF Original: [30] http://goo.gl/7qvho Top StackOverflow Questions * Haskell: How does non-strict and lazy differ? votes: 25, answers: 5 Read on SO: [31] http://goo.gl/2KJVY * forall in Scala votes: 18, answers: 5 Read on SO: [32] http://goo.gl/ejOwF * What is the name of this monad-like functional programming pattern? votes: 16, answers: 1 Read on SO: [33] http://goo.gl/Rv1BC * Is (reverse . f . reverse) efficient? votes: 11, answers: 4 Read on SO: [34] http://goo.gl/U7qLu * Haskell Space Overflow votes: 8, answers: 4 Read on SO: [35] http://goo.gl/5uBY2 * How to write recursive lambda expression in Haskell? votes: 8, answers: 2 Read on SO: [36] http://goo.gl/TokK2 * Is the random number generator in Haskell thread-safe? votes: 8, answers: 4 Read on SO: [37] http://goo.gl/ERVpl * How can I create a tuple where each of the members are compared by an expression? votes: 7, answers: 5 Read on SO: [38] http://goo.gl/BiUpC * Haskell cartesian product of infinite lists votes: 7, answers: 4 Read on SO: [39] http://goo.gl/DC9M5 * How to implement a generic hierarchy of structures with injected functionality votes: 7, answers: 6 Read on SO: [40] http://goo.gl/IoMT6 About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18899 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91853 4. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18894 5. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18893 6. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18900 7. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91845 8. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/91845 9. http://www.reddit.com/r/haskell/comments/jtdrz/interested_in_a_2nd_edition_… 10. http://www.reddit.com/r/haskell/comments/jtdrz/interested_in_a_2nd_edition_… 11. http://ghcarm.wordpress.com/2011/08/27/current-status-merged-into-ghc-head/ 12. http://www.reddit.com/r/haskell/comments/jwgxj/ghc_on_arm_merged_into_ghc_h… 13. http://amtal.github.com/2011/08/25/why-haskell-is-kinda-cool.html 14. http://www.reddit.com/r/haskell/comments/juemg/why_haskell_is_kinda_cool/ 15. http://cdsmith.wordpress.com/2011/08/23/haskell-for-kids-week-2/ 16. http://www.reddit.com/r/haskell/comments/js4kd/haskell_for_kids_week_2/ 17. http://blog.johantibell.com/2011/08/results-from-state-of-haskell-2011.html 18. http://www.reddit.com/r/haskell/comments/jqfey/results_from_the_state_of_ha… 19. http://morepypy.blogspot.com/2011/08/we-need-software-transactional-memory.… 20. http://www.reddit.com/r/haskell/comments/jrprb/pypy_we_need_software_transa… 21. http://skilpat.tumblr.com/post/9411500320/a-modular-package-language-for-ha… 22. http://www.reddit.com/r/haskell/comments/jvlrw/mmmodularity_a_modular_packa… 23. http://www.utdallas.edu/~gupta/courses/apl/lambda.pdf 24. http://www.reddit.com/r/haskell/comments/jt0m1/a_tutorial_introduction_to_t… 25. http://pnyf.inf.elte.hu:8000/Rubik_en.xml 26. http://www.reddit.com/r/haskell/comments/jwfz2/functional_representation_of… 27. http://www.yesodweb.com/blog/2011/08/monad-control 28. http://www.reddit.com/r/haskell/comments/jtuk9/monadcontrol_for_more_flexib… 29. http://chrisdone.com/posts/2011-08-21-haskell-emacs.html 30. http://www.reddit.com/r/haskell/comments/js3sm/a_different_haskell_emacs_mo… 31. http://stackoverflow.com/questions/7140978/haskell-how-does-non-strict-and-… 32. http://stackoverflow.com/questions/7213676/forall-in-scala 33. http://stackoverflow.com/questions/7135540/what-is-the-name-of-this-monad-l… 34. http://stackoverflow.com/questions/7152183/is-reverse-f-reverse-efficient 35. http://stackoverflow.com/questions/7140732/haskell-space-overflow 36. http://stackoverflow.com/questions/7141229/how-to-write-recursive-lambda-ex… 37. http://stackoverflow.com/questions/7153255/is-the-random-number-generator-i… 38. http://stackoverflow.com/questions/7136921/how-can-i-create-a-tuple-where-e… 39. http://stackoverflow.com/questions/7141287/haskell-cartesian-product-of-inf… 40. http://stackoverflow.com/questions/7157841/how-to-implement-a-generic-hiera…

1 0

[CUFP 2011] Birds of a Feather sessions
by Ashish Agarwal 30 Aug '11

30 Aug '11

========================================================= Birds of a Feather sessions (BOFs) Commercial Users of Functional Programming Workshop (CUFP 2011) http://cufp.org/bofs-2011 Tokyo, Japan, September 22 - 23 ========================================================= Following last year's success, CUFP 2011 will again include Birds of a Feather sessions. BoFs provide a place for our community to gather informally at CUFP and reach consensus on matters of importance. Any CUFP attendee can propose a BoF session, and grab one of the spare rooms to hold a discussion. Attendance in the evening is open to all. BoF sessions facilitate ad-hoc discussions and provide a place to gather and start off the chat, before moving on during the evening to a local restaurant or pub. There is no deadline for proposing a session, but we encourage you to do so at the earliest possible time to help us with planning and to publicize your proposed discussion. Attendees are also free to show up even if you have not confirmed, but again earlier confirmation will help us with planning. Please see http://cufp.org/bofs-2011 for details on how to propose a BoF session or confirm attendance at one of them. Scheduled BoFs will be listed here as they are confirmed. General information on CUFP 2011 can be found at http://cufp.org/conference/2011. The conference is co-located with ICFP. You can register for CUFP at the main ICFP website http://www.icfpconference.org/icfp2011.

1 0

ANNOUNCE: swapper: Transparently swapping data from in-memory structures to disk
by Roman Smrž 30 Aug '11

30 Aug '11

The package swapper provides a wrapper for functors, which allows their data to be automatically and transparently swapped to disk and loaded back when necessary. The version 0.1 is the first public one. Hackage: http://hackage.haskell.org/package/swapper Github: http://github.com/roman-smrz/swapper/ The original motivation was the use with happstack-state, which is a system to maintain a global state whole kept in memory. If the data get too big, they can be swapped to disk by the operating system, yet sometimes a bit more control may be beneficial. That is provided by this package (a cache, with possible custom implementation, deciding which and how many items are kept in memory, is associated with the structure) and also the use of snapshots is optimized more than in the case of OS swap: only the data currently cached need to be added when creating snapshot and after loading one, the data are read only as needed. Regards, Roman Srmž

2 2

VSTTE 2012: Extended deadline for paper submission: September 10
by Gudmund Grov 29 Aug '11

29 Aug '11

VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ (*** NEW SUBMISSION DEADLINE: September 10, 2011 ***) The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES September 10, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference KEYNOTE SPEAKERS Rupak Majumdar, Max Planck Institute for Software Systems Wolfgang Paul, Saarland University TUTORIALS Francesco Logozzo, Microsoft Research Rustan Leino, Microsoft Research CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter Müller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Supérieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Université Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter Müller, ETH Zurich Tobias Nipkow, Technische Universität München Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Université Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

ANN: shelltestrunner 1.1
by Simon Michael 25 Aug '11

25 Aug '11

I'm pleased to announce shelltestrunner 1.1. shelltestrunner tests command-line programs or arbitrary shell commands. It reads simple declarative tests specifying a command, some input, and the expected output, error output and exit status. Tests can be run selectively, in parallel, with a timeout, in color, and/or with differences highlighted. Projects using it include hledger, yesod, and berp. shelltestrunner is free software released under GPLv3+. New in 1.1: * bump process dependency to allow building with GHC 7.2.1 * new `-a/--all` flag shows all failure output without truncating Home page: http://joyful.com/shelltestrunner Install: $ cabal install shelltestrunner

1 0

ANNOUNCE: HakkuTaikai: Haskell Hackathon in Tokyo, 25th September 2011
by Liyang HU 25 Aug '11

25 Aug '11

You may have heard the rumours, and I can confirm that it's true: HakkuTaikai is happening! After spending a long week at ICFP 2011 talking about Haskell, why not relax by actually hacking some Haskell? Full details on the wiki page: http://www.haskell.org/haskellwiki/HakkuTaikai When: Sunday, 25th September 2011 Where: Room 1208 of the NII building; the same location as ICFP. Registration is free! See the wiki page above for details. Feel free to email or IRC or twit me with any questions. Many thanks to http://www.nii.ac.jp/ for hosting the event! Cheers, /Liyang

1 0

Deadline extension: (August 31): SPLST'11
by James Chapman 25 Aug '11

25 Aug '11

Dear list, The paper deadline for SPLST’11 (12th Symposium on Programming Languages and Software Tools - http://www.cs.ioc.ee/splst11/) has been extended until August 31. There's still almost a week left to prepare a short paper on work in progress! The programme committee (and I in particular) would be delighted to receive submissions related to or using Haskell. If you would like to visit us in Estonia please consider submitting something. The workshop is timed to coincide with the Estonian Theory Days meeting which SPLST attendees are also welcome to attend. Best wishes, James Chapman Begin forwarded message: > From: Jaan Penjam <jaan(a)cs.ioc.ee> > Subject: [excs] Deadline extension: (August 31): SPLST'11 > > Dear colleagues, > > On behalf of the organizers and Program Committee I inform you that due to several requests the paper submission deadline for SPLST’11 (12th Symposium on Programming Languages and Software Tools - http://www.cs.ioc.ee/splst11/) has been extended to August 31. > > Apologies for multiple copies. > > Jaan Penjam > > x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x x > > CALL for PAPERS > SPLST'11 > > 12th Symposium on Programming Languages and Software Tools > http://cs.ioc.ee/splst11/ > > October 5-7, 2011, Tallinn, Estonia > > > IMPORTANT DATES (EXTENDED) > > Submission Deadline: > Wed, August 31 > Author Notification: Wed, September 14 > Camera ready manuscript: Wed, September 21 > Registration: Mon, September 19 > > > BACKGROUND > > This symposium is the twelfth in a series of conferences which started in 1989 in Szeged, Hungary. Since then it has been organized biannually. The twelfth symposium will be hosted by the Institute of Cybernetics at Tallinn University of Technology (IoC) and organized in co-operation with the Estonian Centre of Excellence in Computer Science (EXCS). > > > AIMS AND SCOPE > > The Symposium on Programming Languages and Software Tools will provide a forum for software scientists to present and discuss recent research and development in computer science. > > The scope of the symposium covers ongoing research related to languages, tools and methods for software development. Topics of interest include, but are not limited to: > - programming and modeling languages and systems, > - formal methods and algorithms, > - parallel and distributed systems, > - techniques for embedded, database, web and ubiquitous systems, > - techniques and tools for software engineering, > - model-driven software engineering, > - software evolution, refactoring and re-engineering, > - software architectures and software processes, > etc. > > > PROCEEDINGS > > All accepted papers will be published in the conference proceedings as a report of IoC with ISBN. > > The authors of selected talks will be invited to revise their papers in order to be published as a special issue of the Proceedings of the Estonian Academy of Sciences (http://www.eap.ee/proceedings) in 2012. The papers submitted to this special issue will undergo standard journal referee process. > > > SUBMISSIONS > > Authors are invited to submit full research papers (at most 12 pages) or short research papers (4-6 pages) in PDF-format before August 31st. Submissions should be written in English and formatted using the easychair.cls LaTeX class (can be obtained fromhttp://www.easychair.org/easychair.zip) > > All submitted papers will be reviewed by members of the program committee and the accepted papers must be presented at the workshop by one of the authors. Submissions should contain sufficient detail to allow to evaluate its validity, quality, originality and relevance. Simultaneous submission to other conferences with published proceedings or journals is not allowed. > > Paper submission and reviewing is handled via Easychair: http://www.easychair.org/conferences?conf=splst11 > > > PROGRAM COMMITTEE > > James Chapman - Institute of Cybernetics, Estonia > Hassan Charaf - Budapest University of Technology and Economics, Hungary > Marlon Dumas - University of Tartu, Estonia > Tibor Gyimóthy - University of Szeged, Hungary > Zoltán Horváth - Eötvös Loránd University, Hungary > Akos Kiss - University of Szeged, Hungary > Kai Koskimies - Tampere University of Technology, Finland > Tamas Kozsik - Eötvös Loránd University, Hungary > Merik Meriste - University of Tartu, Estonia > Erkki Mäkinen - University of Tampere, Finland > Jukka Paakki - University of Helsinki, Finland > András Pataricza - Budapest University of Technology and Economics, Hungary > Jaan Penjam - Institute of Cybernetics, Estonia > Jari Peltonen - Tampere University of Technology, Finland > Attila Pethõ - University of Debrecen, Hungary > Luigia Petre - Åbo Akademi University, Finland > Kari Smolander - Lappeenranta University of Technology, Finland > Tarja Systä - Tampere University of Technology, Finland > Jorma Tarhio - Aalto University, Finland > Kuldar Taveter - Tallinn University of Technology, Estonia > Tarmo Uustalu - Institute of Cybernetics, Estonia > Margus Veanes - Microsoft Research, Redmond USA > Varmo Vene - University of Tartu, Estonia > > > STEERING COMMITTEE > > Kai Koskimies - Tampere University of Technology, Finland > Zoltán Horváth - Eötvös Loránd University, Hungary > Jaan Penjam - Institute of Cybernetics, Estonia > > > CONTINUATION EVENT > > SPLST’11 symposium will be followed by the Estonian Computer Science Theory Days (http://cs.ioc.ee/excs/tdays/) on October 7-9, 2011. The SPLST participants interested in that topics may consider to continue with this scientific meeting. More information about this event can be found on the Theory Days’ web-pages. > > ------------------- > Jaan Penjam, Prof [Phone: +372 620 4214] > Senior Research Fellow of the Institute of Cybernetics at [GSM: +372 514 7798] > Tallinn University of Technology [Fax: +372 620 4151] > Akadeemia tee 21, room B404 [email: jaan(a)cs.ioc.ee] > Tallinn 12618, Estonia > > >

1 0