- Haskell - Haskell.org

CONCUR 08: second call for papers
by Simon Marlow 25 Mar '08

25 Mar '08

[ posting on behalf of Franck van Breugel <franck(a)cse.yorku.ca> ] ------------------------------------------------------------------- Call for Papers 19th International Conference on Concurrency Theory (CONCUR 08) Toronto, Canada, August 19-22, 2008 >> http://www.cse.yorku.ca/concur08 << Submission deadline: April 11, 2008 ------------------------------------------------------------------- CONCUR 08, the 19th International Conference on Concurrency Theory, will take place in Toronto, Canada, on August 19-22, 2008. The purpose of the CONCUR conferences is to bring together researchers, developers, and students in order to advance the theory of concurrency, and promote its applications (in a broad sense). CONCUR 08 will be collocated with the 27th Annual ACM SIGACT-SIGOPS Symposium on the Principles of Distributed Computing (PODC 2008). The program of CONCUR and PODC includes invited talks by Tevfik Bultan, University of California, Santa Barbara, USA Peter Druschel, Max Planck Institute for Software Systems, Saarbruecken, Germany Joseph Halpern, Cornell University, Ithaca, USA Prakash Panangaden, McGill University, Montreal, Canada Shaz Qadeer, Microsoft Research, Redmond, USA Don Towsley, University of Massachusetts, Amherst, USA Furthermore, there will be a symposium celebrating the contributions of Nancy Lynch and the following nine workshops: Workshop on Approximate Behavioural Equivalences; Workshop on Concurrency in Enterprise Applications; Workshop on Distributed computing, Concurrency theory, and Verification; 15th International Workshop on Expressiveness in Concurrency; International Workshop on Foundations of Mobile Computing Workshop on Formal Methods for Wireless Systems; 10th International Workshop on Verification of Infinite-State Systems; 6th International Workshop on Security Issues in Concurrency; Young Researchers Workshop The overall event will take place at the University of Toronto on August 18-23, 2008. CONCUR 08 welcomes two categories of papers: - regular papers; - tool papers. Submissions are solicited in all areas of semantics, logics, verification and analysis of concurrent systems. The principal topics include (but are not limited to): - basic models of concurrency (such as abstract machines, domain theoretic models, game theoretic models, process algebras, and Petri nets); - logics for concurrency (such as modal logics, temporal logics and resource logics); - models of specialized systems (such as biology-inspired systems, circuits, hybrid systems, mobile systems, multi-core processors, probabilistic systems, real time systems, synchronous systems, and web services); - verification and analysis techniques for concurrent systems (such as abstract interpretation, atomicity checking, model-checking, race detection, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving and type systems); - related programming models (such as distributed or object-oriented). Submissions will be evaluated by the program committee for inclusion in the proceedings, which will be published by Springer-Verlag in the Lecture Notes in Computer Science series. Papers must be in English and should be formatted according to the Springer-Verlag LNCS guidelines. Simultaneous submission to journals or other conferences with published proceedings is not allowed. Both regular and tool papers will be presented at the conference, and so at least one author of each accepted paper is expected to be present at the conference. The link for submissions is http://www.easychair.org/conferences/?conf=CONCUR08 Regular papers -------------- Authors are invited to submit an extended abstract. Regular papers must contain original contributions, be clearly written, and include appropriate reference to and comparison with related work. Authors are encouraged to submit a paper title and a short abstract before submitting the extended abstract. The short abstract should not exceed 200 words, and it should be entered in ASCII at the link given below. The extended abstract should not exceed 15 pages. If necessary, the extended abstract may be supplemented with a clearly marked appendix, which will be reviewed at the discretion of the program committee. Tool papers ----------- Tool papers should present novel tools based on aforementioned technologies (such as abstract interpretation, atomicity checking, model-checking, race detection, run-time verification, state-space exploration, static analysis, synthesis, testing, theorem proving and type systems) or fall into the above application areas (such as biology-inspired systems, circuits, hybrid systems, mobile systems, multi-core processors,probabilistic systems, real time systems, synchronous systems, and web services) and have an explicit emphasis on handling of concurrency. If previous versions of the tool have already been presented at meetings or published in some form, the enhancements and novel features of the tool should be clearly described. A tool paper should not exceed 4 pages and should have an appendix that provides a detailed description of: - how the oral presentation will be conducted (for example illustrated by a number of snapshots) and - the availability of the tool, the number and types of users, and other information which may illustrate the maturity and robustness of the tool (if applicable, a link to a web-page for the tool). The appendix will not be included in the proceedings, but during the evaluation of the tool papers it will be equally important as the pages submitted for publication in the proceedings. Important dates --------------- Abstract Submission: April 4, 2008 Paper Submission: April 11, 2008 (strict) Notification: May 27, 2008 Final version due: June 17, 2008 Program committee ----------------- Luca de Alfaro, University of California, Santa Cruz, USA Pedro R. D'Argenio, Universidad Nacional de Cordoba, Argentina Jos Baeten, Eindhoven University of Technology, the Netherlands Christel Baier, Technical University Dresden, Germany Eike Best, Carl von Ossietzky Universitaet Oldenburg, Germany Dirk Beyer, Simon Fraser University, Canada Patricia Bouyer, LSV, CNRS & ENS Cachan, France Mario Bravetti, University of Bologna, Italy Franck van Breugel (co-chair), York University, Canada Ilaria Castellani, INRIA Sophia Antipolis, France Marsha Chechik (co-chair), University of Toronto, Canada Wan Fokkink, Vrije Universiteit Amsterdam/CWI, the Netherlands Rob van Glabbeek, National ICT Australia Arie Gurfinkel, Carnegie Mellon University, USA Anna Ingolfsdottir, Reykjavik University, Iceland Radha Jagadeesan, DePaul University, USA Barbara Koenig, University of Duisburg-Essen, Germany Marta Kwiatkowska, University of Oxford, UK Orna Kupferman, Hebrew University, Israel Kim Larsen, Aalborg University, Denmark Nancy Lynch, MIT, USA P. Madhusudan, UIUC, USA Ugo Montanari, University of Pisa, Italy Anca Muscholl, Universite Bordeaux, France Catuscia Palamidessi, INRIA Futurs and LIX, France Corina Pasareanu, Perot Systems/NASA Ames Research Center, USA Scott Smolka, SUNY at Stony Brook, USA Nobuko Yoshida, Imperial College London, UK Steering Committee ------------------ Roberto Amadio, Universite Paris Diderot, France Jos Baeten, Eindhoven University of Technology, the Netherlands Eike Best, Carl von Ossietzky Universitaet Oldenburg, Germany Kim Larsen, Aalborg University, Denmark Ugo Montanari, University of Pisa, Italy Scott Smolka, SUNY at Stony Brook, USA Sponsors -------- IBM; Microsoft; SAP; Department of Computer Science, University of Toronto; Department of Computer Science and Engineering, York University.

1 0

ANN: hmm-0.1
by Max Rabkin 25 Mar '08

25 Mar '08

HMM is a library for creating and manipulating Hidden Markov Models. It contains implementations of the forward algorithm and Viterbi's algorithm. It is still experimental, but I hope it can be of some interest or use. http://hackage.haskell.org/cgi-bin/hackage-scripts/package/hmm-0.1 --Max

1 0

ANN: uuid-0.1.0 Haskell bindings to libuuid
by Antoine Latter 24 Mar '08

24 Mar '08

Haskell bindings to libuuid. The library libuuid is available as a part of e2fsprogs: http://e2fsprogs.sourceforge.net/. This library is useful for creating, comparing, parsing and printing Universally Unique Identifiers. See http://en.wikipedia.org/wiki/UUID for more details on UUIDs. -Antoine

2 1

ANN (2 Libs) -- hvac 0.1b, a lightweight web framework and HStringTemplate 0.3
by Sterling Clover 23 Mar '08

23 Mar '08

1) hvac 0.1b: transactional, declarative framework for lightweight web applications. 2) HStringTemplate 0.3 1) hvac 0.1b hvac (short for http view and controller) has been my project for the last little while, and is finally in a fairly usable state, so I'm opening up the repo (darcs get http://community.haskell.org/~sclv/ hvac/) for folks to play with and to get some feedback. While not quite yet ready for hackage, the package as provided should be fully cabal installable. Documentation is available at http:// community.haskell.org/~sclv/hvac/html_docs/hvac/ The aim of hvac is to provide an environment that makes the creation of lightweight fastcgi based web applications as simple as possible, with an emphasis on concise, declarative style code, correct concurrent transactional logic, and transparency in adding caching combinators. There are two included example programs, naturally neither of which is feature complete. They share a common login module of about 50 lines of code, excluding imports, templates, and database schema. The first program is a classic, greenspun-style message board with basic login functionality. It totals roughly 40 lines and tends to use just under 4mb of resident memory on my system. The second is a wiki based on Pandoc and the PandocWiki code. The code totals roughly 30 lines (rendering borrowed from PandocWiki aside) and uses about 5mb of memory. hvac processes all requests in the STM monad, with some bells attached to properly interleave STM with session, database and filesystem operations such that they all conceptually occur together in a single transaction per request. Currently it is only fully tested with sqlite, but it should operate, modulo a few tweaks, with any database accessible via HDBC. hvac is particularly designed to use the HStringTemplate library as an output layer, in a simple declarative fashion. As the StringTemplate grammar is explicitly sub-turing, this ensures a clean separation of program logic from presentation, while providing a nonetheless fairly powerful language to express typical display tasks. The included cache combinators, still experimental, should allow a simple and fine-grained control over the level of caching of various disk-bound operations. Phantom types are used to ensure that no functions that modify state may be cached. To give a flavor of hvac code, the following is the complete (twenty lines!) source of the wiki controller (due to sql statements, some lines are rather long): wikiController tmpl = h |/ "login" *> login_plug tmpl <|> (h |/ "wiki" |\\ \pageName -> h |// "POST" *> withValidation [ ("contents", return) ] (\ [contents] -> do pageId <- selectVal "id from pages where name=?" [toSql pageName] maybe (addErrors [("Login","must be logged in.")] >> continue) (\user -> case fromSql pageId of Just (_::Int) -> execStat "insert into page_hist (pageId,contents,author) values(?,?,?)" [pageId, toSql contents, toSql . userName $ user] Nothing -> do execStat "insert into pages (name,locked) values(?,?)" [toSql pageName, toSql (0::Int)] pid <- selectVal "max(id) from pages" [] execStat "insert into page_hist (pageId,contents,author) values(?,?,?)" [pid, toSql contents, toSql . userName $ user]) =<< getSes continue) <|> do pageId <- selectVal "id from pages where name=?" [toSql pageName] (join $ renderf (tmpl "showPage") ("pageName", pageName) <$> "pageContents" |= selectRow "* from page_hist where pageId=? order by time desc limit 1" [pageId] )) <|> (redirect . ( ++ "/wiki/Index") =<< scriptName) Future directions for work on hvac include: Stress testing for correctness of transactional logic and benchmarks. Exploration of various efficiency tweaks. Unit tests. Further development of the cache combinator API. Improvement of the example apps and addition of a few others (a blog maybe). Expansion of the library of validator functions. Exploration of transferring hvac to the standard FastCGI bindings (currently it uses a custom modified version to work properly with STM). Improvement of the database layer, particularly with regards to common paging functions. Creation of a set of simple combinators for generating CRUD (create read update delete) pages. Creation of a minimal set of standard templates (maybe). 2) HStringTemplate 0.3.1 This release of HStringTemplate (up now at Hackage) fixes a number of bugs pointed out to me by its small but growing user base (thanks, cinema, elliottt!) ranging from the minor (a particular two-level iteration pattern wasn't working properly) to the truly irritating (poor handling of file groups). It's still unfortunately skimpy on the docs, outside of the haddocks and the main StringTemplate grammar documentation at http://www.stringtemplate.org (although the examples from hvac should also prove helpful). However, it does have a set of very nice and handy new features for development. * renderf, a function similar in spirit to printf, that takes an arbitrary number of heterogeneous (String, value) tuples as arguments. This should cut down considerably on long setAttribute chains. Additionally, with custom instances (not, I'll grant, trivial to write) it can be used to declaratively chain together strings of attribute retrieval functions in arbitrary monads, as in the above code example from hvac. * dumpAttribs, a function/template that prints out the tree of the entire attribute environment a template is operating in -- extremely handy for development. * nullGroup, also for use in development, a simple way to display more information about templates that can't be found. Error messages in usafeVolatileDirectoryGroup have also been significantly improved. * getStringTemplate', a version of getStringTemplate guaranteed not to be inlined. While the optimizer will still sometimes rearrange code such that a volatile group is not updated properly, this at least helps remedy the situation (I think). * Some minor changes: For grammar reasons, dots have been removed from template names -- however, underscores and slashes are now available. Additionally, there's a much improved logic for which aspects of a local environment are overridden and preserved when a template is called from another. For both of these libraries, patches, comments, bug reports, requests, and of course contributions more than welcome! Regards, Sterl.

1 0

MSFP second call for papers
by Venanzio Capretta 22 Mar '08

22 Mar '08

SECOND CALL FOR PAPERS This is a reminder that the deadline for submission to MSFP is approaching. Second Workshop on MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING 6 July 2008, Reykjavik - Iceland A satellite workshop of ICALP 2008 PRESENTATION The workshop on Mathematically Structured Functional Programming is devoted to the derivation of functionality from structure. It is a celebration of the direct impact of Theoretical Computer Science on programs as we write them today. Modern programming languages, and in particular functional languages, support the direct expression of mathematical structures, equipping programmers with tools of remarkable power and abstraction. Monadic programming in Haskell is the paradigmatic example, but there are many more mathematical insights manifest in programs and in programming language design: Freyd-categories in reactive programming, symbolic differentiation yielding context structures, and comonadic presentations of dataflow, to name but three. This workshop is a forum for researchers who seek to reflect mathematical phenomena in data and control. The first MSFP workshop was held in Kuressaare, Estonia, in July 2006. An associated special issue of the Journal of Functional Programming is in preparation. INVITED SPEAKERS Andrej Bauer, University of Ljubljana Dan Piponi, Industrial Light and Magic SUBMISSIONS Electronic Notes in Theoretical Computer Science have provisionally agreed to publish the proceedings of MSFP 2008. ENTCS require submissions in LaTeX, formatted according to their guidelines (http://www.entcs.org/prelim.html) Papers must report previously unpublished work and not be submitted concurrently to another conference with refereed proceedings. Programme Committee members, barring the co-chairs, may (and indeed are encouraged to) contribute. Accepted papers must be presented at the workshop by one of the authors. There is no specific page limit, but authors should strive for brevity. We are using the EasyChair software to manage submissions. To submit a paper, please log in at: http://www.easychair.org/conferences/?conf=msfp2008. TIMELINE: Submission of abstracts: 4 April Submission of papers: 11 April Notification: 16 May Final versions due: 13 June Workshop: 6 July For more information about the workshop, go to: http://msfp.org.uk/ Programme Committee * Yves Bertot, INRIA, Sophia-Antipolis, France * Venanzio Capretta (co-chair), Radboud University, Nijmegen, The Netherlands * Jacques Carette, McMaster University, Hamilton, Ontario, Canada * Thierry Coquand, Chalmers University, Göteborg, Sweden * Andrzej Filinski, DIKU, University of Copenhagen, Denmark * Jean-Christophe Filliâtre, LRI, Université Paris Sud, France * Jeremy Gibbons, Oxford University, England * Andy Gill, Galois Inc., Portland, Oregon, USA * Peter Hancock, University of Nottingham, England * Oleg Kiselyov, FNMOC, Monterey, California, USA * Paul Blain Levy, University of Birmingham, England * Andres Löh, Utrecht University, The Netherlands * Marino Miculan, Università di Udine, Italy * Conor McBride (co-chair), Alta Systems, Northern Ireland * James McKinna, Radboud University, Nijmegen, The Netherlands * Alex Simpson, University of Edinburgh, Scotland * Tarmo Uustalu, Institute of Cybernetics, Tallinn, Estonia

1 0

PhD or PostDoc opening for Haskell research in Dresden
by Janis Voigtlaender 20 Mar '08

20 Mar '08

Dear all, I have a research position on offer in the project described at: http://linux.tcs.inf.tu-dresden.de/~voigt/project/ The official job advertisement (in German) can be found at: http://www.verw.tu-dresden.de/StellAus/einzelstelle.asp?id=783 The key facts are: - full faculty position - no teaching duties - initial appointment for up to 30 months (maybe less for a PostDoc) Please contact me with any further questions. Please also forward to potentially interested students. The closing date for applications is 15th May 2008. Best wishes, Janis Voigtlaender -- Dr. Janis Voigtlaender http://wwwtcs.inf.tu-dresden.de/~voigt/ mailto:voigt@tcs.inf.tu-dresden.de

1 0

ANN: The Disciplined Disciple Compiler - alpha 1
by Ben Lippmeier 20 Mar '08

20 Mar '08

Hi All, I'm pleased to announce the initial alpha release of the Disciplined Disciple Compiler (DDC). Disciple is an explicitly lazy dialect of Haskell which includes: - first class destructive update of arbitrary data. - computational effects without the need for state monads. - type directed field projections. All this and more through the magic of effect typing. More information (and download!) available from: http://www.haskell.org/haskellwiki/DDC or http://code.google.com/p/disciple DDC: more than lambdas. Onward! Ben.

1 0

Two lectureships in Nottingham
by Graham Hutton 19 Mar '08

19 Mar '08

Dear all, We are advertising two new Lectureships (Assistant Professorships) in Computer Science at the University of Nottingham in England. Applications in the area of functional programming are particularly welcome. Further details are available from: http://jobs.nottingham.ac.uk/vacancies.aspx?cat=160#j2797 The closing date for applications is 28th March 2008. Best wishes, Graham Hutton +-----------------------------------------------------------------+ | Dr Graham Hutton Email : gmh(a)cs.nott.ac.uk | | School of Computer Science | | University of Nottingham Web : www.cs.nott.ac.uk/~gmh | | Jubilee Campus, Wollaton Road | | Nottingham NG8 1BB, UK Phone : +44 (0)115 951 4220 | +-----------------------------------------------------------------+ 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.

1 0

ANN: haskell-src-exts 0.3.2
by Niklas Broberg 18 Mar '08

18 Mar '08

Hi all, I'm pleased to announce a new release for the haskell-src-exts package. haskell-src-exts 0.3.2 =========================== haskell-src-exts is a package for handling and manipulating Haskell source code. It is based on the haskell-src package that is part of the standard libraries, but extends this to support a number of syntactic extensions, e.g. MPTCs, fundeps, GADTs, TH etc. It is intended as a drop-in replacement for the standard haskell-src package, and exports the same functions and data types, plus some more. Apart from the more standard extensions supported by e.g. GHC, haskell-src-exts also provides support for HaRP (Haskell Regular Patterns) and HSX (Haskell Source with XML) syntax. Note that as of 0.3, haskell-src-exts /= HSX. * cabal sdist: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/haskell-src-exts… * darcs repo: darcs get http://code.haskell.org/HSP/haskell-src-exts === Changes from 0.2: === * Added support for - Indexed type families (including associated types/datatypes) - Explicit kind signatures - Standalone deriving * haskell-src-exts is now decoupled from hsx/trhsx and harp. - Modules renamed to Language.Haskell.Exts.* - Module Transform is removed from the package (now in package hsx) * New repository (i.e. darcs pull in an old repo won't work, use darcs get), containing only the haskell-src-exts package (no hsx or harp). * Builds with 6.8.2 (thanks Duncan Coutts) === Complete list of supported extensions === * Multi-parameter type classes (MPTCs) * Functional dependencies * Associated types, indexed type families * Liberal class and instance heads * Implicit parameters * Explicit kind signatures * Pattern guards * Generalized algebraic data types (GADTs) * Template Haskell (TH) * Universal and existential quantification (forall) * Empty data type declarations * Unboxed tuples (# #) * Standalone deriving * Regular patterns * Haskell XML, HSX style === Build Requirements === * happy >= 1.17 - It might work with 1.16 though I haven't tested. In that case change the cabal file. - It would work with older versions as well, though they insert a dependency on Array (haskell98) instead of Data.Array. If that's all you have to work with, update the cabal file with a dependency on haskell98. * Cabal >= 1.2 Patches are more than welcome. :-) Cheers, /Niklas

2 2

S-Hack 2008: Workshop on S-Net and SaC
by Stephan Herhut 18 Mar '08

18 Mar '08

Motto : From Solo to Symphony - Making your application go multi-core! Website : http://events.sac-home.org/s-hack/ When? : Mon. 14.4. - Wed. 16.4. 2008 Where? : University of Hertfordshire, Hatfield, UK; 51.7522 N 0.242 W Who can participate? : Anybody who has a computationally intensive application which can be expressed in terms of non-recursive data structures and operations thereon and who wants to have it all: * a nice and intuitive high-level specification * and high-performance, parallelised execution on multi-core architectures! Agenda : Mo / Tue : tutorials on our functional streaming & data parallel framework Tue / Wed : you start your own application using our framework Costs? : participation is free; hacking essentials such as coffee and electricity on a 24 hour basis also come for free! Catch? : we only have a limited amount of places available and will give these away on a first come first serve basis! How can I register? : Send an email to events(a)sac-home.org in which you state: * your name * your affiliation * the nature of your application -- Stephan Herhut Centre for Computer Science and Informatics Research Science and Technology Research Institute University of Hertfordshire

1 0