Dear all,
Please consider submitting a short or long paper to this symposium to
be held in Tallinn in October. The symposium is timed to coincide with
the next (more informal) Estonian Theory Days meeting so authors are
welcome to attend both events. The symposium is local in a linguistic
sense and alternates between Estonia, Finland and Hungary. After the
symposium selected authors will be invited to revise their papers for
a journal special issue published by the Estonian Academy of Sciences.
We would be delighted to see submissions from the Haskell community!
See below for further information.
Regards,
James Chapman
Call for Papers
SPLST'11
12th Symposium on Programming Languages and Software Tools
http://www.cs.ioc.ee/splst11/
October 5-7, 2011, Tallinn, Estonia
IMPORTANT DATES
Submission Deadline: Monday, August 22
Author Notification: Saturday, September 10
Camera ready manuscript: Monday, September 19
Registration: Monday, 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 22nd. Submissions should be written
in English and formatted
using the easychair.cls LaTeX class (can be obtained from
http://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
The SPLSTʼ11 symposium will be followed by the Estonian Computer
Science Theory Days on October 7-
9, 2011. The SPLST participants interested are welcome to join (see
http://cs.ioc.ee/excs/tdays/ ).
I am pleased to announce that Issue 18 of The Monad.Reader is now
available [1].
Issue 18 consists of the following three articles:
* "MapReduce as a Monad" by Julian Porter
* "Fun with Parallel Monad Comprehensions" by Tomas Petricek
* "Attributed Variables: Their Uses and One Implementation" by
Douglas M. Auclair
Feel free to browse the source files. You can check out the entire
repository using darcs (or simply visit the below URL in your
browser):
darcs get http://code.haskell.org/~byorgey/TMR/Issue18
Enjoy!
[1] http://themonadreader.files.wordpress.com/2011/07/issue18.pdf
Call for Talks
ACM SIGPLAN Haskell Implementors' Workshop
http://haskell.org/haskellwiki/HaskellImplementorsWorkshop/2011
Tokyo, Japan, September 23rd, 2011
The workshop will be held in conjunction with ICFP 2011
http://www.icfpconference.org/icfp2011/
Important dates
Proposal Deadline: 22nd July 2011
Notification: 8th August 2011
Workshop: 23rd September 2011
The Haskell Implementors' Workshop is to be held alongside ICFP 2011
this year in Tokyo, Japan. There will be no proceedings; it is an
informal gathering of people involved in the design and development
of Haskell implementations, tools, libraries, and supporting
infrastructure.
This relatively new workshop reflects the growth of the user
community: there is a clear need for a well-supported tool chain for
the development, distribution, deployment, and configuration of
Haskell software. The aim is for this workshop to give the people
involved with building the infrastructure behind this ecosystem an
opportunity to bat around ideas, share experiences, and ask for
feedback from fellow experts.
We intend the workshop to have an informal and interactive feel, with
a flexible timetable and plenty of room for ad-hoc discussion, demos,
and impromptu short talks.
Scope and target audience
-------------------------
It is important to distinguish the Haskell Implementors' Workshop from
the Haskell Symposium which is also co-located with ICFP 2011. The
Haskell Symposium is for the publication of Haskell-related research.
In contrast, the Haskell Implementors' Workshop will have no
proceedings -- although we will aim to make talk videos, slides and
presented data available with the consent of the speakers.
In the Haskell Implementors' Workshop we hope to study the underlying
technology. We want to bring together anyone interested in the nitty
gritty details necessary to turn a text file into a deployed product.
Having said that, members of the wider Haskell community are more than
welcome to attend the workshop -- we need your feedback to keep the
Haskell ecosystem thriving.
The scope covers any of the following topics. There may be some topics
that people feel we've missed, so by all means submit a proposal even
if it doesn't fit exactly into one of these buckets:
* Compilation techniques
* Language features and extensions
* Type system implementation
* Concurrency and parallelism: language design and implementation
* Performance, optimisation and benchmarking
* Virtual machines and run-time systems
* Libraries and Tools for development or deployment
Talks
-----
At this stage we would like to invite proposals from potential speakers
for a relatively short talk. We are aiming for 20 min talks with 10 mins
for questions and changeovers. We want to hear from people writing
compilers, tools, or libraries, people with cool ideas for directions in
which we should take the platform, proposals for new features to be
implemented, and half-baked crazy ideas. Please submit a talk title and
abstract of no more than 200 words to benl(a)cse.unsw.edu.au
We will also have a lightning talks session which will be organised on
the day. These talks will be 2-10 minutes, depending on available time.
Suggested topics for lightning talks are to present a single idea, a
work-in-progress project, a problem to intrigue and perplex Haskell
implementors, or simply to ask for feedback and collaborators.
Organisers
----------
* Rebekah Leslie (Portland State University)
* Ben Lippmeier - co-chair (University of New South Wales)
* Andres Loeh (Well-Typed LLP)
* Oleg Lobachev (University of Marburg)
* Neil Mitchell - co-chair (Standard Chartered)
* Dimitrios Vytiniotis (Microsoft Research)
I am glad to announce the initial release of regex-applicative.
Hackage: http://hackage.haskell.org/package/regex-applicative
Repository: https://github.com/feuerbach/regex-applicative
Issues: https://github.com/feuerbach/regex-applicative/issues
regex-applicative is aimed to be an efficient and easy to use parsing combinator
library based on regular expressions.
Perl programmers often use regular expressions for parsing, even if it is not
an appropriate tool for the job, because Perl has so good support for regexps.
The opposite seems to be valid about Haskell programmers -- they use parsing
combinators (which recognize context-free or even context-sensitive grammars),
even when the language is actually regular!
Hopefully, this library will improve the situation.
This is an early preview release. Some features are lacking, and performance is
probably not very good yet.
Among the features that we are going to support in future versions are:
* Non-greedy operators
* Search-and-replace functionality
* Error reporting
The implementation is heavily based on the ideas from "A Play on Regular
Expressions" by Sebastian Fischer, Frank Huch and Thomas Wilke.
http://sebfisch.github.com/haskell-regexp/regexp-play.pdf
--
Roman I. Cheplyaka :: http://ro-che.info/
v0.4 of `RandProc` has just been posted to Hackage:
http://hackage.haskell.org/package/randproc
In this release:
* Examples of using the `RandProc` library to work problems from
`Random Processes` text have been added.
* `README` file has been fleshed out a bit.
Dear all,
I am currently advertising a Fully-Funded PhD Studentship in
Functional Programming at the University of Nottingham:
http://www.cs.nott.ac.uk/~gmh/phd-advert.html
Please forward to any good UK students who may be interested.
Best wishes,
Graham
--
Graham Hutton
Functional Programming Lab
School of Computer Science
University of Nottingham, UK
http://www.cs.nott.ac.uk/~gmh
This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham.
This message has been checked for viruses but the contents of an attachment
may still contain software viruses which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.
