February 2011 - Haskell

WGP 2011: Call for Papers
by Shin-Cheng Mu 19 Feb '11

19 Feb '11

====================================================================== CALL FOR PAPERS WGP 2011 7th ACM SIGPLAN Workshop on Generic Programming Tokyo, Japan Sunday, September 18th, 2011 http://flolac.iis.sinica.edu.tw/wgp11/ Collocated with the International Conference on Functional Programming (ICFP 2011) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organizers ---------- Co-Chair Jaakko Järvi, Texas A&M University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee ------------------- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen, Universitetet i Bergen, Norway Akimasa Morihata, Tohoku University, Japan Pablo Nogueira, Universidad Politécnica de Madrid, Spain Ulf Norell, Chalmers University of Technology and University of Gothenberg, Sweden Ross Paterson, City University London, UK Rinus Plasmeijer, Radboud University Nijmegen, The Netherlands Sibylle Schupp, Technische Universität Hamburg-Harburg, Germany Andrew Sutton, Kent State University, USA Tarmo Uustalu, Institute of Cybernetics, Estonia Important Information --------------------- We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Monday 2011-06-06 Notification of acceptance: Tuesday 2011-07-01 Final submission due: Monday 2011-07-25 Workshop: Sunday 2011-09-18 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP11 EasyChair instance by the above deadline. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming ---------------------------------------------- This year: * Tokyo, Japan 2011 (affiliated with ICFP11) Earlier Workshops on Generic Programming have been held in * Baltimore, Maryland, US 2010 (affiliated with ICFP10) * Edinburgh, UK 2009 (affiliated with ICFP09) * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop), There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). Additional information: The WGP steering committee consists of J. Gibbons, R. Hinze, P. Jansson, J. Järvi, J. Jeuring, B. Oliveira, S. Schupp, and M. Zalewski

1 0

ANNOUNCE: Sifflet visual programming language, release 1.2.3
by gdweber＠iue.edu 18 Feb '11

18 Feb '11

Sifflet and sifflet-lib 1.2.3 are now available on Hackage. This is a compatibility release for GHC 7 and Haskell Platform 2011.2. 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 the diagrams to show how function calls are evaluated. Sifflet-lib is the library containing many modules of the sifflet application. What's New ---------- February 18, 2011: Version 1.2.3 provides compatibility with GHC 7 (remaining backward-compatible with GHC 6.12.3) and Haskell Platform 2011.2. 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

Haskell Web Framework Happstack 6 Released
by Jeremy Shaw 17 Feb '11

17 Feb '11

Hello, I am pleased to announce the release of Happstack 6. We fully recommend that all Happstack users migrate to the new release. Happstack is a high-performance Haskell web framework. It has high- level functionality for routing requests, extracting parameters, manipulating responses, serving static file contents, compression responses, and more. It includes an integrated HTTP server and a native RAM-cloud database system known as MACID. This allows you to deploy your web application with out having to configure apache, php, mysql, memcached, etc! Install instructions can be found here: http://happstack.com/download If you are porting existing applications you should check out the Happstack 6 migration guide: http://code.google.com/p/happstack/wiki/Happstack6Migration Porting should be pretty straight-forward. Despite the massive reorganization, the exports from Happstack.Server are largely the same. What's Exciting! ---------------- The focus of this release has been happstack-server. The primary goal was to make happstack-server much easier to learn and to use. This includes: 1. improving the overall organization of the library 2. greatly improving the documentation 3. making it easier to install 4. ensuring that the server provides fast, reliable performance 5. making it easier for new (and old) developers to understand and get started If you have looked at Happstack before and found it too difficult to understand, I highly recommend you take another look. The new organization and documentation make it far easier to understand. More Logical Organiation ------------------------ In prior versions, the Happstack.Server.SimpleHTTP module contained just about everything, with little organization, and no real differentiation between the external API and the library internals. In Happstack 6, SimpleHTTP has been refactored into numerous, smaller modules. The internals have been moved into Happstack.Server.Internal.* so that they are not leaking into the external API. This should make it much easier to find what you are looking for, and prevent you from accidently running across internal things like the WebT monad, which you do not really need to know anything about. Better Documentation -------------------- The API documentation for happstack-server is also much better. All external API functions should now have good haddock documentation with many inline examples. However, learning a new library by studying the API documentation can still be pretty frustrating. So we also have the brand new Happstack Crash Course. http://happstack.com/docs/crashcourse/index.html. The Happstack Crash Course covers a vast majority of the happstack- server API. It covers the API in a logical manner and includes many downloadable, runnable examples. It is intended to be read start to finish, and to also be usable as a reference guide for specific "How do I do XXX" questions. Additionally, the guestbook example has been updated to a cleaner, more modern style of Happstack coding. It also has more comments/ haddock documentation. Better API ---------- During the process of documenting Happstack, many small improvements where made to the API. Once you try to document something stupid you realize how stupid it is and decided it would be good to fix it first ;) For example, the Cookie API now makes it more obvious how to create session cookies vs persistent cookies. And makes it obvious how to expire a cookie. The functions for looking up values in the query string and require body no longer require the use of the RqData monad. You can use the look* functions directly in the ServerPart monad. If you do choose to use RqData, it now has an Applicative instance which can accummulate and report lookup errors. (http://happstack.blogspot.com/2010/10/is-rqdata-monad-still-needed.html ) There are a bunch of other improvements to request data handling documented here, http://happstack.com/docs/crashcourse/RqData.html. Easier Install -------------- In order to make Happstack easier to install we have removed as many dependencies as possible. happstack-data no longer depends on happstack-util, which makes it easier to install happstack-data or happstack-state with out the rest of the framework. HSP and HStringTemplate support has been moved into *optional* happstack-hsp and happstack-hstringtemplate packages. New Features ------------ Happstack also has a number of new features including: - support for Heist templates (http://happstack.com/docs/crashcourse/Templates.html#helloheist ) - support for Hamlet templates - improved environment for extracting query string and form values (http://happstack.blogspot.com/2010/10/is-rqdata-monad-still-needed.html ) - support for recompilation and reloading of templates in a running server (http://happstack.blogspot.com/2010/10/recompile-your-haskell-based-template… ) - directory browsing when using serveDirectory And numerous other improvements including enhancements to IxSet, file locking, and much more. Bigger, Better Version Number ----------------------------- We have also upgraded our version numbers! We have decided to call this release Happstack 6.0 instead of Happstack 0.6. There are two reasons for this: 1. the amount of changes we are making really do represent a new major release 2. it will make it easier to comply with the Haskell package version policy. Now that Happstack 6 is out, we plan to make more frequent releases. The new version scheme will allow us to talk about the next major release (Happstack 7), but still put out changes to Happstack 6 which change the API (aka, Happstack 6.2, etc). GHC 7 - mostly -------------- Happstack mostly works with GHC 7. Due to some compiler bugs, HSP does not work with GHC 7.0.1. These bugs were reported and are fixed in the upcoming GHC 7.0.2 release. If you are not using the optional happstack-hsp package, then GHC 7 is fine. If you are using happstack- hsp, then you will need to use GHC 6.12, a recent version of GHC from darcs, or wait until GHC 7.0.2 comes out. The Future ========== The current future plan looks like this: Happstack 7 ----------- The next major release of Happstack will be Happstack 7. The primary focus of Happstack 7 will be improving happstack-state (also known as MACID). Big features include: - sharding support - a rewrite of IxSet based on kdtrees with much better RAM and CPU performance - performance testing to show how awesome MACID is - much better documentation and examples - better tools for examining and modifying state in running applications There are also a bunch of lower-level API improvements planned which should make it nicer to use happstack-state. Happstack 8 ----------- Happstack 8 will finally feature an enumerator-based HTTP backend. This is a feature we have been hoping to add since January of 2009. http://code.google.com/p/happstack/issues/detail?id=29 Rather than develop a competing HTTP backend, Happstack will put its efforts into improving an existing HTTP backend. We currently have our eye on WAI/warp. However, we will also consider snap and hyena when the time comes. It should be noted that the current lazy I/O based backend is not the relentless nightmare of space leaks that some people might lead you to believe it is. The current happstack-server can easily handle uploads and downloads of large or streaming files with out leaks. But, enumerators *are* nice. How You can Help ================ You are encouraged to get involved in Happstack. The easiest way to get involved is to complain about how horrible Happstack is. If you don't voice your complaints, then we might not know something things to be fixed. If you are looking to make code contributions, please feel free to ask on #happs or the mailing list. There are tasks that are easy for novices, tasks that are worthy of a Ph.D, and everything in between. If you want to work, we can certainly find a way to use your talents! There are also plenty of non-coding related tasks including documentation, graphic design, user surveys, etc. You are also encouraged to blog about your Happstack projects! Thanks! - jeremy shaw

1 0

How do I get a Hackage password?
by Trystan Spangler 17 Feb '11

17 Feb '11

How do I get a password for Hackage? I got a username but I have no idea what my password is and I can't find how to reset it or get a new one. Thanks a bunch, Trystan Spangler

2 1

Haskell Weekly News: Issue 169
by Daniel Santa Cruz 17 Feb '11

17 Feb '11

Welcome to issue 169 of the HWN, a newsletter covering developments in the [1]Haskell community. This release covers the week of February 6 - 12, 2011. Congrats to Bryan O'Sullivan and Mark Lentczner for pulling off a successfull [2]BayHac 2011! Announcements Joao Fernandes [3]sent out a call for papers for the 4th International Conference on Software Language Engineering to be held in Braga, Portugal, 3-6 July 2011. Bas van Dijk annouced [4]version 0.1 and [5]version 0.2 of his monad-control library. "monad-control is a rewrite of monad-peel than uses CPS style operations and exploits RankNTypes language extensions to simplify and speed up most functions." Gregory Collins and the Snap team [6]proudly announced the release of Snap 0.4 "containing a whole bunch of nifty new features." Peter Scott [7]announced pwstore, a library that aims to "handle all the details of password storage for you, in a way that should be so easy to use that there's no reason not to use it." Bas van Dijk [8]released case-insensitive 0.1. "The package provides the module Data.CaseInsensitive which exports the CI type constructor which can be parameterised by a string-like type... Comparisons of values of the resulting type are then insensitive to cases." Ryan Newton [9]released a package to do accelerated AES and RNG. Brent Yorgey [10]sent in a second call for submissions to the Monad.Reader -- special poetry and fiction edition. John Lato [11]released version 3.0.1 of ListLike, which "provides polymorphic functions with Data.List-style api for many different data types, including list, arrays, and bytestrings. John also [12]released version 0.7.0.2 and 0.8.0.1 of iteratee, after discovering a memory leak which affects all current versions of iteratee. He states that he would "strongly encourage all users of earlier versions to upgrade to one of these releases." Ganesh Sittampalam and the darcs team are [13]pleased to announce version 2.5.1, a minor upgrade for the 2.5 release. "The main focus of this release is support for the GHC 7.0 series and the upcoming February 2011 Haskell Platform, but the release also includes bug fixes and minor usability improvements." Trystan Spangler [14]announced the release of hspec: Behavior Driven Development for Haskell. "hspec ties together requirements and code that verifies the requirements are met. The verifying code can be a boolean expression, a QuickCheck property, or an explination of why it's pending. The requirements can then be turned into documentation of what the code does and what remains to be implemented." Wren Ng Thornton [15]announce bytestring-trie 0.2.3, a "long awaited release for efficient finite maps from (byte)strings to values." Brent Yorgey would like to invite you to [16]save the date for the Haskell hackathon in Philadelphia, July 29-31. Quotes of the Week * smerdyakov: Some might argue that you can derive False from a sentence containing both "dependent types" and "contract programming." * Einstein: Make everything as simple as possible, but not simpler. * Einskell: Make everything as monad as possible, but not monadder. * kmc: it's important to show that Haskell is usable not just for useless maths, but also for real-world tasks such as rendering teapots * ddarius: Attempting to join #not-not-math sent me to #math. Freakin' Boole. * gwern: [quoting a hypothetical edwardk] 'I HAVE CONSUMED YOUR KNOWLEDGE; LEAVE ME LEST I CONSUME YOUR FLESH AS WELL' * monochrom: @let germanize = concat . words Top Reddit Stories * Announcing: Snap Framework v0.4 Domain: snapframework.com, Score: 40, Comments: 3 On Reddit: http://www.reddit.com/r/haskell/comments/fgc38/announcing_snap_framework_v0… Original: http://snapframework.com/blog/2011/02/05/snap-0.4-released * Haskell Summers of Code retrospective (updated for 2010) Domain: gwern.net, Score: 31, Comments: 7 On Reddit: http://www.reddit.com/r/haskell/comments/fid5w/haskell_summers_of_code_retr… Original: http://www.gwern.net/Haskell%20Summer%20of%20Code.html * How to write type-level lambda-abstractions at the value level Domain: haskell.org, Score: 26, Comments: 7 On Reddit: http://www.reddit.com/r/haskell/comments/fjbxw/how_to_write_typelevel_lambd… Original: http://www.haskell.org/pipermail/haskell-cafe/2011-February/089184.html * Storing passwords securely: don't roll your own Domain: finger-tree.blogspot.com, Score: 25, Comments: 22 On Reddit: http://www.reddit.com/r/haskell/comments/fgm26/storing_passwords_securely_d… Original: http://finger-tree.blogspot.com/2011/02/storing-passwords-securely-in-haske… * #haskell-game & Haskellers Game Interest Group Domain: self.haskell, Score: 25, Comments: 3 On Reddit: http://www.reddit.com/r/haskell/comments/fjzz0/haskellgame_haskellers_game_… Original: /r/haskell/comments/fjzz0/haskellgame_haskellers_game_interest_group/ * Type class generics to be replaced in GHC 7.2 or 7.4 Domain: haskell.org, Score: 24, Comments: 2 On Reddit: http://www.reddit.com/r/haskell/comments/fiq7o/type_class_generics_to_be_re… Original: http://www.haskell.org/pipermail/glasgow-haskell-users/2011-February/020006… * What can I do with Haskell? Domain: self.haskell, Score: 22, Comments: 33 On Reddit: http://www.reddit.com/r/haskell/comments/fgfh9/what_can_i_do_with_haskell/ Original: /r/haskell/comments/fgfh9/what_can_i_do_with_haskell/ * There seems to be lots of interest in SMT solvers in the Haskell community these days, so I started ##smt on freenode Domain: self.haskell, Score: 20, Comments: 6 On Reddit: http://www.reddit.com/r/haskell/comments/fh2zw/there_seems_to_be_lots_of_in… Original: /r/haskell/comments/fh2zw/there_seems_to_be_lots_of_interest_in_smt_solvers/ * darcs 2.5.1 released Domain: lists.osuosl.org, Score: 16, Comments: 0 On Reddit: http://www.reddit.com/r/haskell/comments/fj46y/darcs_251_released/ Original: http://lists.osuosl.org/pipermail/darcs-users/2011-February/026018.html * monad-control Domain: mail-archive.com, Score: 11, Comments: 2 On Reddit: http://www.reddit.com/r/haskell/comments/fgbao/monadcontrol/ Original: http://www.mail-archive.com/haskell@haskell.org/msg23278.html Top StackOverflow Answers * How does Data.MemoCombinators work? votes: 20 Read on SO: http://stackoverflow.com/questions/4980102/how-does-data-memocombinators-wo… This library is a straightforward combinatorization of the well-known technique of memoization. Let's start with the canonical example: fib = (map fib' [0..] !!) where fib' 0 = 0 fib' 1 = 1 fib' n = fib (n-1) + fib (n-2) I interpret what you said to mean that you know how and why this works. So I'll focus on the combinatorization. We ... * What's similar to fmap for monadic values? votes: 16 Read on SO: http://stackoverflow.com/questions/4927014/whats-similar-to-fmap-for-monadi… pelotom's answer is the straightforward one. But not the fun one! sequence is the Haskell function that one can think of as flipping the order of type constructors between a list and a monad. sequence :: (Monad m) => [m a] -> m [a] Now what you want is, so to speak, to flip the order of type constructors between a Maybe and a monad. Data.Traversable ... * Does there exist a monad instance for Data.Map / Data.IntMap? votes: 15 Read on SO: http://stackoverflow.com/questions/4973335/does-there-exist-a-monad-instanc… Is there any particular reason you want to avoid using monad transformers? if you get the MaybeT package from Hackage you can achieve what you want like this: import Control.Monad import Control.Monad.Maybe import Control.Monad.State import qualified Data.Map as Map type MapM k v a = MaybeT (State (Map.Map k v)) a lookupM k = MaybeT $ Map.lookup k `liftM` ... * How to split a string in Haskell? votes: 11 Read on SO: http://stackoverflow.com/questions/4978578/how-to-split-a-string-in-haskell… There is a package for this called split. cabal install split Use it like this: ghci> splitOn "," "my,comma,separated,list" ["my","comma","separated","list"] It comes with a lot of other functions for splitting on matching delimiters or having several delimiters. * Haskell (n+1) in pattern matching votes: 10 Read on SO: http://stackoverflow.com/questions/4913588/haskell-n1-in-pattern-matching/4… It's a specific case of what is called "n+k patterns", which is generally disliked, and will be has been removed from the language. See here for more information. Here is a good note on n+k patterns, which quotes the following from the Haskell 98 Report (emphasis mine): Matching an n+k pattern (where n is a variable and k is a positive integer ... * Setting upper limit to the input set according to the output function votes: 10 Read on SO: http://stackoverflow.com/questions/4927387/setting-upper-limit-to-the-input… The check fib x < 1000000 in the list comprehension filters away the fib x values that are less than 1000000; but the list comprehension has no way of knowing that greater values of x imply greater value of fib x and hence must continue until all x have been checked. Use takeWhile instead: takeWhile (< 1000000) [ fib x | x <- [0..35]] Top StackOverflow Questions * How does Data.MemoCombinators work? votes: 13, answers: 4 Read on SO: http://stackoverflow.com/questions/4980102/how-does-data-memocombinators-wo… * How to best synchronize game engine and network server in Haskell? votes: 10, answers: 3 Read on SO: http://stackoverflow.com/questions/4973401/how-to-best-synchronize-game-eng… * How to choose right Haskell C type? votes: 9, answers: 1 Read on SO: http://stackoverflow.com/questions/4924994/how-to-choose-right-haskell-c-ty… * How to split a string in Haskell? votes: 9, answers: 5 Read on SO: http://stackoverflow.com/questions/4978578/how-to-split-a-string-in-haskell * Haskell (n+1) in pattern matching votes: 7, answers: 1 Read on SO: http://stackoverflow.com/questions/4913588/haskell-n1-in-pattern-matching About the Haskell Weekly News You can find an html version of this newsletter at: http://bit.ly/h1ICad To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. I'm in dire need of finding good "quotes of the week". If you happen to come across any, please don't hesitate to send it along. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://mtnviewmark.wordpress.com/2011/02/13/bayhac-2011-wrap-up/ 3. http://article.gmane.org/gmane.comp.lang.haskell.general/18473/match=call+p… 4. http://article.gmane.org/gmane.comp.lang.haskell.general/18474 5. http://article.gmane.org/gmane.comp.lang.haskell.general/18485 6. http://article.gmane.org/gmane.comp.lang.haskell.cafe/86087 7. http://article.gmane.org/gmane.comp.lang.haskell.general/18476 8. http://article.gmane.org/gmane.comp.lang.haskell.general/18475 9. http://article.gmane.org/gmane.comp.lang.haskell.general/18481 10. http://themonadreader.wordpress.com/2011/01/19/call-for-copy-special-poetry… 11. http://article.gmane.org/gmane.comp.lang.haskell.general/18486 12. http://article.gmane.org/gmane.comp.lang.haskell.general/18490 13. http://article.gmane.org/gmane.comp.version-control.darcs.user/25902 14. http://article.gmane.org/gmane.comp.lang.haskell.general/18493 15. http://article.gmane.org/gmane.comp.lang.haskell.libraries/15294 16. http://article.gmane.org/gmane.comp.lang.haskell.general/18501

1 0

ANNOUNCE: hspec-0.2.0 (now on hackage!)
by Trystan Spangler 17 Feb '11

17 Feb '11

hspec, Behavior Driven Development for Haskell, is now version 0.2.0 and on Hackage! hspec version 0.2.0 - still allows boolean expressions or QuickCheck properties to act as examples - still allows examples to be pending - now allows HUnit test to act as examples - now catches exceptions and treats them as failed examples - has much improved haddock documentation - has many examples in the haddock documentation From the haddock description: Hspec is a Behaviour-Driven Development tool for Haskell programmers. BDD is an approach to software development that combines Test-Driven Development, Domain Driven Design, and Acceptance Test-Driven Planning. Hspec helps you do the TDD part of that equation, focusing on the documentation and design aspects of TDD. Hspec (and the preceding intro) are based on the Ruby library RSpec. Much of what applies to RSpec also applies to Hspec. Hspec ties together *descriptions* of behavior and *examples* of that behavior. The examples can also be run as tests and the output summarises what needs to be implemented. You can find it on Hackage: cabal install hspec You can find it on github: https://github.com/trystan/hspec Any advice, comments, or questions are welcome, Trystan

1 0

Post-doc positions at Portland State University
by Mark P. Jones 16 Feb '11

16 Feb '11

The High-Assurance Systems Programming (HASP) project at Portland State University in Portland, OR, USA, has openings for *two* post-doctoral researchers to help design, develop, and apply a new strongly typed, pure functional language for systems programming. The Habit language derives from Haskell, with the addition of features for efficient low-level programming. Its compiler and high-assurance runtime system (HARTS) extend the verified CompCert compiler. Possible demonstration projects include an L4-based microkernel, lightweight Xen guest domains, and high-assurance portable devices. It is anticipated that one post-doc will champion the certifying compiler and the other will champion the demonstration project. The HASP team currently consists of three faculty (James Hook, Mark Jones, and Andrew Tolmach) and seven PhD students. Please see http://hasp.cs.pdx.edu/postdoc.html for more details.

1 0

research post
by Zhaohui.Luo＠rhul.ac.uk 16 Feb '11

16 Feb '11

Department of Computer Science Royal Holloway, University of London Research Assistant Applications are invited for a research assistant in the above department, funded by the Leverhulme Trust for the following interdisciplinary research project: Lexical Semantics in Type Theory with Coercive Subtyping (http://www.cs.rhul.ac.uk/home/zhaohui/lexsem.html) The post is full time, for a period of three years and available from June 2011, with the starting annual salary between 31,987 pounds and 33,805 pounds (inclusive of London allowance). Candidates would normally be expected to have a PhD or equivalent experience in mathematics, computer science, or computational linguistics. Experience or background in some of the following areas is considered to be desirable, though not necessary: typed lambda calculi, computational linguistics, functional programming, and theorem proving. Applications should be made before 12 noon, March 14, 2011 and should include a curriculum vitae and the names of two or three referees with their addresses (and email addresses if available). Informal enquiries before formal applications are encouraged and can be addressed to Prof Zhaohui Luo at the email address zhaohui(a)cs.rhul.ac.uk. For further details on how to apply, please visit the following web page: http://www.rhul.ac.uk/jobs/jobvacancies/6223resarchfellowcomputerscience.as… or contact the Recruitment Team by email: recruitment(a)rhul.ac.uk or tel: +44-(0)1784-414241.

1 0

RDP IFCoLog student session
by Mário Florido 15 Feb '11

15 Feb '11

Call for Papers First IFCoLog-RDP Student Session http://www.ifcolog.net/?page_id=6149 Novi Sad, Serbia 29 May 2011 An associated event of RDP 2011, Sixth Federated Conference on Rewriting, Deduction, and Programming =================================================================== Important Dates --------------- * 20 March 2011: Submission deadline * 10 April 2011: Author notification * 29 May 2011: Student Session The contributions and program will be available online before the event. Scope ----- The IFCoLog-RDP student session is a new initiative to encourage undergraduate and master students to present their research projects at high profile computer science events, and offer a good opportunity to undergraduate and master students to interact with more senior researchers. Topics ------ The IFCoLog-RDP student session will consider papers on Rewriting, Deduction, and Programming, broadly construed. But welcomes submissions on the topics of the two main RDP conferences, RTA and TCLA, with which the student session is connected. See http://www.rdp2011.uns.ac.rs/ for further details. Submission and Publication -------------------------- Authors are invited to submit an extended abstract (max. 5 pages). Papers should be written in English, and submitted in PostScript or PDF format, using the EasyChair class style. After the student session, authors of accepted submissions will be asked to submit a final version to be published in a biannual issue of the IFCoLog workshop series. Submission is through the Easychair website: https://www.easychair.org/account/signin.cgi?conf=ifcologrdpss2011 Programme Committee ------------------- to be announced Contact ------- Sandra Alves: sandra(a)dcc.fc.up.pt Michael Gabbay: michael.gabbay(a)kcl.ac.uk

1 0

Well-Typed are hiring: Haskell consultant
by Ian Lynagh 15 Feb '11

15 Feb '11

Fellow Haskellers, In order to keep up with customer demand, we are looking to hire a Haskell expert to work with us at Well-Typed as a Haskell consultant. This is an exciting opportunity for someone who is passionate about Haskell and who is keen to improve and promote Haskell in a professional context. The role is quite general and could cover any of the projects and activities that we are involved in as a company. The tasks may involve: * working on the Haskell compilers, libraries and tools; * Haskell application development; * working directly with clients to solve their problems. Well-Typed has a variety of clients. For some we do proprietary Haskell development and consulting. For others, much of the work involves open-source development and cooperating with the rest of the Haskell community: the commercial, open-source and academic users. Our ideal candidate has excellent knowledge of Haskell, whether from industry, academia, or personal interest. Familiarity with other languages, low-level programming, and good software engineering practices are also useful. Good organisation and ablity to manage your own time, and reliably meet deadlines, is important. You are likely to have a batchelor's degree or higher in computer science or a related field, although this isn't a requirement. Experience of consulting, or running a business, is also a bonus. The position is initially as a contractor for one year with a salary of 150 GBP per day, plus a bonus if profits are high. We offer flexible hours and work from home. Living in England is not required. In the longer term there is the opportunity to become a member of the partnership with a full stake in the business: being involved in business decisions, and fully sharing the risks and rewards. If you are interested, please apply via info(a)well-typed.com. Tell us why you are interested and why you would be a good fit for the job, and attach your CV. We are more than happy to answer informal enquiries. Contact Duncan Coutts, Ian Lynagh or Andres Löh for further information, either by email or IRC. *** The deadline for applications is Tuesday 1st March 2011. *** About Well-Typed Well-Typed LLP is a Haskell services company, providing consultancy services, writing bespoke applications, and offering commercial training in Haskell and related topics. -- Ian Lynagh, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

1 0