- Haskell - Haskell.org

announce: language-objc
by John Lato 19 Jun '12

19 Jun '12

Hello, I am pleased to announce the initial release to hackage of language-objc, an objective-C AST, parser, and pretty-printer. More details and short examples are available at http://johnlato.blogspot.sg/2012/06/language-objc-released.html This package is a fork of language-c, and I am most grateful to the work of Benedikt Huber, Manuel Chakravarty, Duncan Coutts, Bertram Felgenhauer, and all other contributors; they did the bulk of the coding. Bugs and infelicities are mine. The version number is rather high for a beta release as I started from a recent language-c number. The Objective-C extensions are rather less well tested at this time. Feedback and comments are welcome. Cheers, John Lato

2 1

Re: [Haskell] ANNOUNCE: set-monad
by Dan Burton 16 Jun '12

16 Jun '12

Convenience aside, doesn't the functor instance conceptually violate some sort of law? fmap (const 1) someSet The entire shape of the set changes. fmap (g . h) = fmap g . fmap h This law wouldn't hold given the following contrived ord instance data Foo = Foo { a, b :: Int } instance Ord Foo where compare = compare `on` a Given functions h foo = foo { a = 1 } g foo = foo { a = b foo } Does this library address this? If so, how? If not, then you'd best note it in the docs. On Jun 15, 2012 6:42 PM, "George Giorgidze" <giorgidze(a)gmail.com> wrote: I would like to announce the first release of the set-monad library. On Hackage: http://hackage.haskell.org/package/set-monad The set-monad library exports the Set abstract data type and set-manipulating functions. These functions behave exactly as their namesakes from the Data.Set module of the containers library. In addition, the set-monad library extends Data.Set by providing Functor, Applicative, Alternative, Monad, and MonadPlus instances for sets. In other words, you can use the set-monad library as a drop-in replacement for the Data.Set module of the containers library and, in addition, you will also get the aforementioned instances which are not available in the containers package. It is not possible to directly implement instances for the aforementioned standard Haskell type classes for the Set data type from the containers library. This is because the key operations map and union, are constrained with Ord as follows. map :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b union :: (Ord a) => Set a -> Set a -> Set a The set-monad library provides the type class instances by wrapping the constrained Set type into a data type that has unconstrained constructors corresponding to monadic combinators. The data type constructors that represent monadic combinators are evaluated with a constrained run function. This elevates the need to use the constraints in the instance definitions (this is what prevents a direct definition). The wrapping and unwrapping happens internally in the library and does not affect its interface. For details, see the rather compact definitions of the run function and type class instances. The left identity and associativity monad laws play a crucial role in the definition of the run function. The rest of the code should be self explanatory. The technique is not new. This library was inspired by [1]. To my knowledge, the original, systematic presentation of the idea to represent monadic combinators as data is given in [2]. There is also a Haskell library that provides a generic infrastructure for the aforementioned wrapping and unwrapping [3]. The set-monad library is particularly useful for writing set-oriented code using the do and/or monad comprehension notations. For example, the following definitions now type check. s1 :: Set (Int,Int) s1 = do a <- fromList [1 .. 4] b <- fromList [1 .. 4] return (a,b) -- with -XMonadComprehensions s2 :: Set (Int,Int) s2 = [ (a,b) | (a,b) <- s1, even a, even b ] s3 :: Set Int s3 = fmap (+1) (fromList [1 .. 4]) As noted in [1], the implementation technique can be used for monadic libraries and EDSLs with restricted types (compiled EDSLs often restrict the types that they can handle). Haskell's standard monad type class can be used for restricted monad instances. There is no need to resort to GHC extensions that rebind the standard monadic combinators with the library or EDSL specific ones. [1] CSDL Blog: The home of applied functional programming at KU. Monad Reification in Haskell and the Sunroof Javascript compiler. http://www.ittc.ku.edu/csdlblog/?p=88 [2] Chuan-kai Lin. 2006. Programming monads operationally with Unimo. In Proceedings of the eleventh ACM SIGPLAN International Conference on Functional Programming (ICFP '06). ACM. [3] Heinrich Apfelmus. The operational package. http://hackage.haskell.org/package/operational _______________________________________________ Haskell mailing list Haskell(a)haskell.org http://www.haskell.org/mailman/listinfo/haskell

2 1

FunctionalOWL: FP Usergroup in Germany, area Bielefeld
by raichoo 16 Jun '12

16 Jun '12

Announcing FunctionalOWL in Bielefeld! Next Wednesday will be the first meetup of the FunctionalOWL at Hackerspace Bielefeld. The meetup is aimed at people who are interested in functional programming. FunctionalOWL wants to provide a wide range of interesting topics and opportunities to share and acquire knowledge. Become a part of it. When: Wed 20 June @ 19:00 Where: Sudbrackstraße 42, Bielefeld Followup meetups are planned to happen every 3rd Wednesday at the same location. We have various beamers and whiteboards. Internet and caffeinated lemonade are also available. For more information and contact, check out our website. Feel free to drop a message on our pubML or in our Chatroom. www.hackerspace-bielefeld.de Kind regards, raichoo, Hackerspace Bielefeld

1 0

ANN: GHC-7.4.2-Eden - Parallel Haskell on multicore and cluster systems
by Eden - Functional parallel Programming (Mischa Dieterle) 16 Jun '12

16 Jun '12

We are happy to announce a new release of Eden, a parallel extension of Haskell. The release comprises: * The GHC-7.4.2-Eden compiler: GHC-7.4.2 extended with the Eden parallel runtime system. * The Eden modules: a library defining the Eden language constructs. * The Eden skeleton library: a comprehensive library with common task and data parallel patterns. * The Eden trace viewer EdenTV: an visualisation and analysis tool for eventlogs of parallel program runs. All resources are available via: http://www.mathematik.uni-marburg.de/~eden Eden extends Haskell with a small set of syntactic constructs for explicit process specification and creation. While providing enough control to implement parallel algorithms efficiently, it frees the programmer from the tedious task of managing low-level details by introducing automatic process handling, synchronisation and communication (via head-strict lazy lists). Eden is tailored for distributed systems but works equally well on multicore architectures. Processes work within disjoint address spaces and do not share any data. This simplifies Eden's implementation as there is no need for global garbage collection. A tutorial is available from http://www.mathematik.uni-marburg.de/~eden/paper/edenCEFP.pdf The compiler release includes binary packages for Linux and Windows, and a source distribution, available from http://www.mathematik.uni-marburg.de/~eden/?content=down_eden_7_4&navi=down Other features: - Extensions for GHC's event logging support. - Built-in serialisation of Haskell data structures (orthogonal to evaluation), see "Orthogonal Serialisation for Haskell", available from http://www.diku.dk/hjemmesider/ansatte/berthold/jbpubl.html - Optimised local communication. - Stand-alone version for multicore, using middleware MPI or PVM for clusters. Eden libraries and tools are available separately from hackage: - Eden modules: http://hackage.haskell.org/package/edenmodules (already included in the Eden compiler) - Eden skeleton library: http://hackage.haskell.org/package/edenskel - EdenTV: http://hackage.haskell.org/package/edentv (uses gtk2hs and glade) When built using a standard GHC, the packages will produce a threaded simulation of Eden.

1 0

ANNOUNCE: set-monad
by George Giorgidze 16 Jun '12

16 Jun '12

I would like to announce the first release of the set-monad library. On Hackage: http://hackage.haskell.org/package/set-monad The set-monad library exports the Set abstract data type and set-manipulating functions. These functions behave exactly as their namesakes from the Data.Set module of the containers library. In addition, the set-monad library extends Data.Set by providing Functor, Applicative, Alternative, Monad, and MonadPlus instances for sets. In other words, you can use the set-monad library as a drop-in replacement for the Data.Set module of the containers library and, in addition, you will also get the aforementioned instances which are not available in the containers package. It is not possible to directly implement instances for the aforementioned standard Haskell type classes for the Set data type from the containers library. This is because the key operations map and union, are constrained with Ord as follows. map :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b union :: (Ord a) => Set a -> Set a -> Set a The set-monad library provides the type class instances by wrapping the constrained Set type into a data type that has unconstrained constructors corresponding to monadic combinators. The data type constructors that represent monadic combinators are evaluated with a constrained run function. This elevates the need to use the constraints in the instance definitions (this is what prevents a direct definition). The wrapping and unwrapping happens internally in the library and does not affect its interface. For details, see the rather compact definitions of the run function and type class instances. The left identity and associativity monad laws play a crucial role in the definition of the run function. The rest of the code should be self explanatory. The technique is not new. This library was inspired by [1]. To my knowledge, the original, systematic presentation of the idea to represent monadic combinators as data is given in [2]. There is also a Haskell library that provides a generic infrastructure for the aforementioned wrapping and unwrapping [3]. The set-monad library is particularly useful for writing set-oriented code using the do and/or monad comprehension notations. For example, the following definitions now type check. s1 :: Set (Int,Int) s1 = do a <- fromList [1 .. 4] b <- fromList [1 .. 4] return (a,b) -- with -XMonadComprehensions s2 :: Set (Int,Int) s2 = [ (a,b) | (a,b) <- s1, even a, even b ] s3 :: Set Int s3 = fmap (+1) (fromList [1 .. 4]) As noted in [1], the implementation technique can be used for monadic libraries and EDSLs with restricted types (compiled EDSLs often restrict the types that they can handle). Haskell's standard monad type class can be used for restricted monad instances. There is no need to resort to GHC extensions that rebind the standard monadic combinators with the library or EDSL specific ones. [1] CSDL Blog: The home of applied functional programming at KU. Monad Reification in Haskell and the Sunroof Javascript compiler. http://www.ittc.ku.edu/csdlblog/?p=88 [2] Chuan-kai Lin. 2006. Programming monads operationally with Unimo. In Proceedings of the eleventh ACM SIGPLAN International Conference on Functional Programming (ICFP '06). ACM. [3] Heinrich Apfelmus. The operational package. http://hackage.haskell.org/package/operational

1 0

Call for Papers: PEPM 2013, Partial Evaluation and Program Manipulation
by Shin-Cheng Mu 15 Jun '12

15 Jun '12

C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ** SUBMISSION DEADLINE: ** late September/early October (precise date to be announced on the website shortly) SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Like for recent PEPMs, selected papers will be invited for a journal special issue dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universität München, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France)

1 0

JustHub 'Sherkin' Release
by Chris Dornan 14 Jun '12

14 Jun '12

JustHub 'Sherkin' Release ==================== I am pleased to announce the Sherkin release of the JustHub distribution of Haskell for Enterprise Linux and the release of the Hub source code on which the distribution is based to Hackage and GitHub. The JustHub distribution is distinctive in providing a comprehensive back-catalogue of GHC tool chains (back to 6.10.4) and major Haskell Platform releases (currently back to 2011.2.0.1) as well as the timely appearance of leading edge GHC releases (such as GHC 7.4.2) in addition to the Haskell Platform de jour (2012.2.0.0), all of which can be deployed simultaneously on the same system. Previous releases of the distribution have been confined to Red Hat Enterprise Linux versions 5 and 6 (and of course CentOS and Scientific Linux); this release expands this coverage to Fedora Linux 16 and 17, which can deployed along side or integrated into Fedora Linux's excellent native Haskell distribution. The JustHub distribution is based on the Hub system for sandbox development that allows each work tree to work in its own sandboxed environment with a specific tool chain and a private user-package database. All of the standard Haskell tools inter-operate cleanly and transparently with the sandboxes and operate in the normal way outside of them. Sandboxed environments (hubs) can be shared between work trees as well as being (re)named, annotated, replicated, swapped, archived, locked and removed. Proper package deletion with the option of garbage collecting orphaned code and documentation is also supported. If anyone would like to incorporate the hub system into a Haskell distribution or port it to a non-Posix system then they are very welcome to contact me (though be warned: time is tight just now). Note that while the distro has had plenty of serious usage (funnily enough it is popular with build-bot admins) it has also been recently extended and revised the software remains in beta testing for now. For news, documentation, articles, download and installation instructions, links to the repositories and trackers etc., see http://justhub.org. Chris Dornan

4 6

Haskell Weekly News: Issue 231
by Daniel Santa Cruz 14 Jun '12

14 Jun '12

Welcome to issue 231 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of June 03 to 09, 2012. Announcements Paolo Capriotti announced the patchlevel release of GHC 7.4.2. "This release contains a number of bugfixes relative to 7.4.1, so we recommend upgrading." [1] http://goo.gl/X3Z85 Quotes of the Week * roconnor: there's a right way, and a wrong way, and then there is the ekmett way. Top Reddit Stories * Haskell Platform 2012.2.0.0 released Domain: hackage.haskell.org, Score: 104, Comments: 33 On Reddit: [2] http://goo.gl/ZNa9h Original: [3] http://goo.gl/JjJg2 * Why free monads matter Domain: haskellforall.com, Score: 61, Comments: 47 On Reddit: [4] http://goo.gl/hfKlc Original: [5] http://goo.gl/JPpsp * 3 Flavors of MVar: Lock, Var, Barrier Domain: neilmitchell.blogspot.com, Score: 43, Comments: 20 On Reddit: [6] http://goo.gl/3eEkO Original: [7] http://goo.gl/ek7Qq * Introducing the HERMIT Equational Reasoning Framework Domain: ittc.ku.edu, Score: 36, Comments: 20 On Reddit: [8] http://goo.gl/UC0sF Original: [9] http://goo.gl/ifS7f * Complicating conduit? Domain: yesodweb.com, Score: 35, Comments: 45 On Reddit: [10] http://goo.gl/W4rfE Original: [11] http://goo.gl/rU0vK * Beautiful Code, Compelling Evidence: OpenGL, Cairo tutorial [PDF, 33 pages] Domain: renci.org, Score: 33, Comments: 2 On Reddit: [12] http://goo.gl/qKY8w Original: [13] http://goo.gl/r5SVj * Forklift - a pattern for performing monadic actions in a worker thread Domain: apfelmus.nfshost.com, Score: 30, Comments: 7 On Reddit: [14] http://goo.gl/B6brV Original: [15] http://goo.gl/mWVAv * Dependently typed programming with singletons (Eisenberg, Weirich)[PDF] Domain: cis.upenn.edu, Score: 29, Comments: 3 On Reddit: [16] http://goo.gl/y3fYv Original: [17] http://goo.gl/RqM5m * Continuation-based relative-time FRP Domain: paolocapriotti.com, Score: 22, Comments: 6 On Reddit: [18] http://goo.gl/CFSK7 Original: [19] http://goo.gl/cP0cJ * Explaining the Prompt monad with a clearer representation Domain: joeysmandatory.blogspot.com, Score: 21, Comments: 42 On Reddit: [20] http://goo.gl/ZZM93 Original: [21] http://goo.gl/Im7SF * Lazily Evaluate length of a list Domain: self.haskell, Score: 21, Comments: 29 On Reddit: [22] http://goo.gl/cKUOt Original: [23] http://goo.gl/cKUOt Top StackOverflow Questions * Killing a thread when MVar is garbage collected votes: 22, answers: 4 Read on SO: [24] http://goo.gl/cvoqw * How does one write efficient Dynamic Programming algorithms in Haskell? votes: 16, answers: 3 Read on SO: [25] http://goo.gl/mkMTp * How to apply a polymorphic function to a Dynamic value votes: 11, answers: 1 Read on SO: [26] http://goo.gl/3jIVr * Haskell Typeclass for Tuples votes: 11, answers: 3 Read on SO: [27] http://goo.gl/pvDah * Monadic expressions in conditionals - GHC compiles, cabal refuses votes: 10, answers: 2 Read on SO: [28] http://goo.gl/QXMXh * GHC Optimization: Collatz conjecture votes: 10, answers: 2 Read on SO: [29] http://goo.gl/AfiEC * Haskell: Lists vs Streams votes: 10, answers: 3 Read on SO: [30] http://goo.gl/qn1dE * Is my program Turing-complete? votes: 9, answers: 2 Read on SO: [31] http://goo.gl/PLf5q * How to find the optimal processing order? votes: 9, answers: 1 Read on SO: [32] http://goo.gl/P3XZ2 * How to do fast data deserialization in Haskell votes: 9, answers: 1 Read on SO: [33] http://goo.gl/Synm2 * What's so bad about OverlappingInstances? votes: 9, answers: 1 Read on SO: [34] http://goo.gl/M17Rp Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.glasgow.user/22181 2. http://hackage.haskell.org/platform/?2012.2.0.0 3. http://www.reddit.com/r/haskell/comments/uipvz/haskell_platform_2012200_rel… 4. http://www.haskellforall.com/2012/06/you-could-have-invented-free-monads.ht… 5. http://www.reddit.com/r/haskell/comments/utxq2/why_free_monads_matter/ 6. http://neilmitchell.blogspot.com/2012/06/flavours-of-mvar_04.html 7. http://www.reddit.com/r/haskell/comments/uk9wu/3_flavors_of_mvar_lock_var_b… 8. http://www.ittc.ku.edu/csdlblog/?p=105 9. http://www.reddit.com/r/haskell/comments/ujdet/introducing_the_hermit_equat… 10. http://www.yesodweb.com/blog/2012/06/complicating-conduit 11. http://www.reddit.com/r/haskell/comments/urc75/complicating_conduit/ 12. http://www.renci.org/wp-content/pub/tutorials/BeautifulCode.pdf 13. http://www.reddit.com/r/haskell/comments/uqc33/beautiful_code_compelling_ev… 14. http://apfelmus.nfshost.com/blog/2012/06/07-forklift.html 15. http://www.reddit.com/r/haskell/comments/uq44h/forklift_a_pattern_for_perfo… 16. http://www.cis.upenn.edu/~eir/papers/2012/singletons/paper.pdf 17. http://www.reddit.com/r/haskell/comments/uic9g/dependently_typed_programmin… 18. http://paolocapriotti.com/blog/2012/06/04/continuation-based-relative-time-… 19. http://www.reddit.com/r/haskell/comments/uklsq/continuationbased_relativeti… 20. http://joeysmandatory.blogspot.com/2012/06/explaining-prompt-monad-with-sim… 21. http://www.reddit.com/r/haskell/comments/unpaz/explaining_the_prompt_monad_… 22. http://www.reddit.com/r/haskell/comments/uomz4/lazily_evaluate_length_of_a_… 23. http://www.reddit.com/r/haskell/comments/uomz4/lazily_evaluate_length_of_a_… 24. http://stackoverflow.com/questions/10871303/killing-a-thread-when-mvar-is-g… 25. http://stackoverflow.com/questions/10906053/how-does-one-write-efficient-dy… 26. http://stackoverflow.com/questions/10889682/how-to-apply-a-polymorphic-func… 27. http://stackoverflow.com/questions/10899804/haskell-typeclass-for-tuples 28. http://stackoverflow.com/questions/10867300/monadic-expressions-in-conditio… 29. http://stackoverflow.com/questions/10876110/ghc-optimization-collatz-conjec… 30. http://stackoverflow.com/questions/10942450/haskell-lists-vs-streams 31. http://stackoverflow.com/questions/10878846/is-my-program-turing-complete 32. http://stackoverflow.com/questions/10879838/how-to-find-the-optimal-process… 33. http://stackoverflow.com/questions/10902405/how-to-do-fast-data-deserializa… 34. http://stackoverflow.com/questions/10942136/whats-so-bad-about-overlappingi…

1 0

Lectureship within the MSP group, Strathclyde
by Robert Atkey 13 Jun '12

13 Jun '12

****************************************************************** *** Lectureship *** *** Mathematically Structured Programming Group *** University of Strathclyde *** ****************************************************************** Applications are invited for lectureship within the MSP group at the University of Strathclyde The applicant's motivation must centre on a desire to discover beautiful mathematics of lasting value. The applicant should also have an innate sense of the wonder of learning allied with the capacity for self-motivation and a track record of academic achievement. The Mathematically Structured Programming Group's vision is to use mathematics to understand the nature of computation, and to then turn that understanding into practical advances within programming languages research. This reflects the symbiotic relationship between mathematics, programming, and the design of programming languages --- we believe that any attempt to sever this connection will diminish each component. In order to achieve these research goals, we mainly use ideas from category theory, type theory, and functional programming. The group consists of a number of internationally leading researchers including Professor Neil Ghani, Dr Patricia Johann, Dr Conor McBride, Dr Peter Hancock, Dr Robert Atkey, and our PhD students. While the lectureship is formally in the area of Program Verification, this is to be interpreted broadly. Very broadly. Anyone interested should in the first instance contact Professor Neil Ghani, whose email address is "neil.ghani at strath.ac.uk" to register interest. Details of the position can be found at http://www.mis.strath.ac.uk/Personnel/open/712012.pdf The closing date for applications is Thursday July 26. Please pass this on to anyone who you think would enjoy the chance to work with us. All the best Neil

1 0

Ph.D. position in computer science at DIKU
by Fritz Henglein 13 Jun '12

13 Jun '12

The Department of Computer Science, University of Copenhagen, Denmark (DIKU) invites applications for a PhD scholarship starting September/October 2012. The scholarship is internally financed and *not* subject to requirements of a specific research project or an external funding agent. The Theory and Practice of Programming Languages Lab at DIKU would welcome applications from candidates with a strong background in core computer science (algorithms, languages, systems) and interests in functional programming, including type systems, program transformation, program analysis, parallel computing and database systems. Application deadline: July 2nd, 2012. For more information, see http://diku.dk/ominstituttet/ledige_stillinger/phd_computer_science/ If you have questions, please feel free to contact Fritz Henglein at henglein(a)diku.dk.

1 0