April 2011 - Haskell - Haskell.org

ANNOUNCE: iteratee-compress 0.2.0.0
by Maciej Piechotka 23 Apr '11

23 Apr '11

Iteratee-compress provides compressing and decompressing enumerators including flushing (using John Lato's implementation). Currently only gzip and bzip is provided but LZMA is planned. Changes from previous version: - Add BZip support Next goals: - LZMA support - Generic interface for flushing To think about: - Should inner iteratee be able to request flushing Regards

1 0

ANNOUNCE: PEZ, the Potentially Excellent Zipper library
by Brandon Simmons 23 Apr '11

23 Apr '11

I'm happy to present my long-languishing-on-the-harddrive generic zipper library I'm calling pez: http://hackage.haskell.org/package/pez The library brings together the 'fclabels' and 'thrist' packages with the Typeable class to enable a zipper library that is (I hope) intuitive and requiring a minimum of boilerplate. Get it with: $ cabal install pez There is still much to do, in particular I have not looked at the performance characteristics of this approach at all, but I hope others find it interesting or useful. Please send any feature requests, or bug reports. EXAMPLE USAGE ================ First you need to enable some extensions, the first two for generating and using 'fclabels' lenses, the second for easy deriving of Typeable instances on custom types: > {-# LANGUAGE TemplateHaskell, TypeOperators, DeriveDataTypeable #-} > > module Main where > > -- import pez > import Data.Typeable.Zipper > -- for prettiness: > import Control.Arrow > import Control.Applicative Now we define a tree that we want to use in our zipper. We want it to be an instance of Typeable which we can derive, and we want 'fclabels' lenses to be generated with TH for the branches, so we name the records with underdashes (see: http://hackage.haskell.org/package/fclabels ) > data Tree a = Node { > _leftNode :: Tree a, > _val :: a, > _rightNode :: Tree a } > | Nil > deriving (Typeable,Show) > > $(mkLabelsNoTypes [''Tree]) At this point we can use all of our zipper functions on the Tree type. The following returns the value at the left-most Node, along with a SavedPath back to that Node. It returns Nothing if the tree is empty: > -- 'a' must be Typeable because we actually "moveTo" it here: > getLeftmost :: Typeable a=> Tree a -> Maybe (a, SavedPath (Tree a) a) > getLeftmost = fmap (viewf &&& save) . descendLeft . zipper > where descendLeft z = > case viewf z of > Nil -> moveTo val <$> moveUp 1 z > _ -> descendLeft $ moveTo leftNode z A `SavedPath` can be restored moving the focus back to the location it points to, or it can be collapsed into a lens itself. Let's use the function we defined above to make sure it works: > tree = Node (Node Nil 'a' Nil) 'b' (Node Nil 'c' Nil) > > main = do > putStr "This should show 'a': " > putStrLn $ maybe "FAIL" (show . fst) $ getLeftmost tree You can also experiment with "zipping through" computations. It's as simple as defining a new fclabel lens for a reversible computation, e.g.: > reversible :: (Show b, Read b) => b :-> String > reversible = lens show (const . read) Thanks, Brandon Simmons http://coder.bsimmons.name

1 0

ANN: hledger 0.14
by Simon Michael 22 Apr '11

22 Apr '11

I'm pleased to announce hledger 0.14. This release includes work by Dmitry Astapov, Eric Kow, Max Bolingbroke, Omari Norman and myself. Thanks especially to Dmitry for helping me with release wrangling. binaries for linux, mac, windows: http://hledger.org/DOWNLOADS.html (64-bit linux binaries to follow) or: cabal update && cabal install hledger, cabal install hledger- web, ... home and docs: http://hledger.org irc: irc://irc.freenode.net/#ledger Release notes: * remove the specific process dependency that caused too many cabal install problems * treat arguments as possibly-encoded platform strings, do not assume UTF-8 * hledger now always reads and writes data as UTF-8, ignoring the system locale (#34) * look at the LEDGER_FILE env var for the journal path, otherwise LEDGER, like ledger * handle a blank LEDGER_FILE or LEDGER value more gracefully (use the default file path) * the default journal file path is now ~/.hledger.journal, to avoid breaking mac filevault (#41) * amounts with different prices are now aggregated, like ledger * zero amounts now have no sign or commodity, like ledger * parsing: assume current year when transaction dates have no year and there is no default year * parsing: more careful validation of eg leap years in transaction dates * parsing: better international number format support, allowing comma as decimal point and flexible digit groups (#32) * parsing: support @@ syntax specifying total price * parsing: infer the conversion price in transactions involving two unpriced commodities * parsing: support per-posting cleared status * parsing: more reporting interval syntax: biweekly, bimonthly, every N days/weeks/months/quarters/years, every Nst/nd/rd/th day of month/week * add: avoid offering account names for completion in inappropriate contexts * add: remember default account even if user submits a different amount. * convert: account-field directive specifies a field containing the base account name * convert: effective-date-field directive specifies a field containing the effective date * convert: date-format directive specifies custom date formats * convert: allow amount fields containing "AMT @@ PRICE" * histogram: honour the specified start or end dates * print: don't show a trailing space when description is blank * web: allow filter patterns with spaces if quoted, like command line * web: make edit form more cross-browser compatible, fixing it in firefox (#38) * web: move hidden add/edit/import forms below main content to help text-mode browsers a bit (#33) Release contributors: Simon Michael, Dmitry Astapov, Eric Kow, Max Bolingbroke, Omari Norman. Stats: 137 days, 113 commits, 11 end-user features and 15 end-user bugfixes since last release. 189 unit & functional tests and 59% unit test coverage (hledger, hledger-lib packages). 5540 lines of code (all packages). Cheers, -Simon

1 0

ANN: HacPhi 2011
by Daniel Wagner 21 Apr '11

21 Apr '11

Greetings, I am very pleased to officially announce HacPhi 2011, a Haskell hackathon/get-together to be held July 29-31 at the University of Pennsylvania in Philadelphia supported by contributions from Amgen, Jane Street, and Microsoft Research. The hackathon will officially kick off at 2:30 Friday afternoon, and go until 5pm on Sunday (with breaks for sleep, of course). Last year's HacPhi was a lot of fun, drawing an international crowd, and many people have already expressed interest in coming back this year. Come meet your Haskelly brothers-in-arms! I want to stress that everyone is welcome---you do not have to be a Haskell guru. Helping hack on someone else's project could be a great way to increase your Haskell-fu. If you plan on coming, please officially register [1]. Registration, travel, lodging and many other details can be found on the HacPhi wiki [2]. We're also looking for a few people interested in giving short (15-20 min.) talks, probably on Saturday afternoon. Anything of interest to the Haskell community is fair game---a project you've been working on, a paper, a quick tutorial. If you'd like to give a talk, add it on the wiki [3]. Hope to see you in Philadelphia! - The Hac φ team Brent Yorgey (byorgey) Daniel Wagner (dmwit) Chris Casinghino (ccasin) [1] http://haskell.org/haskellwiki/Hac_φ/Register [2] http://haskell.org/haskellwiki/Hac_φ [3] http://haskell.org/haskellwiki/Hac_φ/Talks

1 0

Haskell Weekly News: Issue 178
by Daniel Santa Cruz 21 Apr '11

21 Apr '11

Welcome to issue 178 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of April 10 to 16, 2011. You can find the HTML version at: http://bit.ly/feMLgB Announcements Simon Marlow commented (http://goo.gl/XythI) on plans to have a Hackathon at MSR Cambridge this summer. Dr. Heinrich Hordegen informed us (http://goo.gl/lQvqw) of the creation of a Munich funtional programmers' user group. Help us spread the word to anyone interested in functional programming in general. Eric Y. Kow announced (http://goo.gl/PYdKI) the creation of the parallel-haskell mailing list. "The group exists to bring together the various groups in the Haskell community that are working on parallelism. It is intended to provide some visibility into the various efforts and to encourage collaboration." Don Stewart announced (http://goo.gl/0nWn2) the release of the Haskell Platform 2011.2.0.1. "This release adds support for GHC 7.0.3, and significant improvements for Mac OS X users." Quotes of the Week * Gregory Collins: "Easy to use" and "high performance" don't have to be contradictory, but you shouldn't neglect the latter. * xplat: haskell is good for portability. it can run well on any sort of x86 unix, which is all there is after all. * Spockz: it's just that my first name isn't Simon so I'm not allowed to use unsafePerformIO :P * djahandarie: Category theorists are morphisms for turning cofree theorems into free theorems. * monochrom: lambdabot is partially broken and partially correct when it comes to utf-8 * mm_freak: > case analysis of syntax -> bullshit <lambdabot> True Top Reddit Stories * Simon Peyton-Jones – A Taste Of Haskell Domain: ontwik.com, Score: 57, Comments: On Reddit: http://goo.gl/fCxtx Original: http://goo.gl/4LpJQ * Really, HaskellWiki, really? Domain: i.imgur.com, Score: 43, Comments: 13 On Reddit: http://goo.gl/HTigS Original: http://i.imgur.com/fPpby.png * Haskell Platform 2011.2.0.1 is out -- major improvements for Mac users Domain: hackage.haskell.org, Score: 39, Comments: 9 On Reddit: http://goo.gl/BJWwp Original: http://goo.gl/5vbN8 * Tracing the compilation of Hello Factorial in GHC Domain: blog.ezyang.com, Score: 36, Comments: 1 On Reddit: http://goo.gl/WNA2Z Original: http://goo.gl/fsVtS * acid-state: use regular Haskell data structures without worrying about data loss or durability Domain: haskell.org, Score: 32, Comments: 5 On Reddit: http://goo.gl/2hgGj Original: http://goo.gl/tKpV2 * Persistence of Memory: persistent vs ephemeral data structures Domain: existentialtype.wordpress.com, Score: 28, Comments: 5 On Reddit: http://goo.gl/Ss70R Original: http://goo.gl/XHdJV * Bugs from using the wrong variable Domain: blog.ezyang.com, Score: 26, Comments: 11 On Reddit: http://goo.gl/x7RId Original: http://goo.gl/3HJs2 * Cost of calling Haskell from C? Domain: stackoverflow.com, Score: 20, Comments: 1 On Reddit: http://goo.gl/6OiRH Original: http://goo.gl/XfmRe * Comparing Snap and Yesod Domain: stackoverflow.com, Score: 19, Comments: 4 On Reddit: http://goo.gl/P0Gr6 Original: http://goo.gl/dvbEe * Announcing: Heist v0.5.1 Domain: snapframework.com, Score: 17, Comments: On Reddit: http://goo.gl/cIja8 Original: http://goo.gl/d7FWG Top StackOverflow Questions * Comparing Haskell's Snap and Yesod web frameworks votes: 28, answers: 4 Read on SO: http://goo.gl/AhFH5 * Haskell library for 2D drawing votes: 19, answers: 4 Read on SO: http://goo.gl/61C4e * One REPL to bind them all? votes: 19, answers: 3 Read on SO: http://goo.gl/JUFS2 * Performance considerations of Haskell FFI / C? votes: 16, answers: 4 Read on SO: http://goo.gl/tldoX * What is Haskell's style of polymorphism? votes: 13, answers: 1 Read on SO: http://goo.gl/z3JzT About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz

1 0

CFP -- SEFM'11: EXTENDED DEADLINE
by Alberto Pardo 20 Apr '11

20 Apr '11

CALL FOR PAPERS - SEFM 2011 The 9th International Conference on SOFTWARE ENGINEERING AND FORMAL METHODS (SEFM) 14-18 November 2011 Montevideo, Uruguay URL: http://www.fing.edu.uy/inco/eventos/SEFM2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ IMPORTANT DATES (EXTENDED DEADLINES) * NEW Title and abstract submission deadline: 30 April 2011 * NEW Paper submission deadline: 9 May 2011 * Acceptance/rejection notification: 15 June 2011 * Camera-ready version due: 15 July 2011 +++++++++++++++++++++++++++++++++++++++++++++++++++ BACKGROUND AND OBJECTIVES The aim of the conference is to bring together practitioners and researchers from academia, industry and government to advance the state of the art in formal methods, to facilitate their uptake in the software industry and to encourage their integration with practical engineering methods. Papers that combine formal methods and software engineering are especially welcome. Authors are invited to submit original research or tool papers on any relevant topic. These can either be normal or short papers. Short papers can discuss new ideas which are at an early stage of development and which have not yet been thoroughly evaluated. TOPICS Topics of interest include, but are not limited to: * formal requirement analysis, specification and design * programming languages, program analysis and type theory * formal methods for service-oriented and cloud computing * formal aspects of security and mobility * model checking, theorem proving and decision procedures * formal methods for real-time, hybrid and embedded systems * formal methods for safety-critical, fault-tolerant and secure systems * software architecture and coordination languages * component, object and multi-agent systems * formal aspects of software evolution and maintenance * formal methods for testing, re-engineering and reuse * light-weight and scalable formal methods * tool integration * applications of formal methods, industrial case studies and technology transfer KEYNOTE SPEAKERS * Holger Hermanns, Saarland University, Germany * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Daniel Le Métayer - INRIA, France SPECIAL TRACK The conference programme will include a special track on "Modelling for Sustainable Development" with a separate Call for Papers that can be found at http://www.fing.edu.uy/inco/eventos/SEFM2011/CFP-MSD-special-track.txt. All queries on submissions to the special track should be sent to: sefm2011-msd(a)iist.unu.edu. The special track will have as keynote speaker: * Matteo Pedercini, Millennium Institute, USA LOCATION The conference will be held at the NH Columbia Hotel located close to the financial center of Montevideo and enjoying excellent views of the Plata river (Río de la Plata) - http://www.nh-hotels.com/nh/en/hotels/uruguay/montevideo/nh-columbia.html. SUBMISSION AND PUBLICATION Submissions to the conference must not have been published or be concurrently considered for publication elsewhere. All submissions will be peer-reviewed and judged on the basis of originality, contribution to the field, technical and presentation quality, and relevance to the conference. All papers must be written in English. Research and tool papers must not exceed 16 pages in the LNCS format while short papers must not exceed 8 pages in the LNCS format (see http://www.springer.de/comp/lncs/authors.html for details). All queries on the submissions should be sent to: sefm2011(a)fing.edu.uy. Papers must be submitted electronically via the Easychair System: http://www.easychair.org/conferences/?conf=sefm11 The proceedings will be published in the Springer Lecture Notes in Computer Science series (LNCS, http://www.springer.com/lncs) After the conference, authors of selected papers will be invited to submit an extended version of their work to be considered for publication in a special issue of the SoSyM journal (Software and Systems Modeling, Springer), following the standard reviewing process of the journal. COMMITTEES Conference Chair * Alberto Pardo, Universidad de la República, Uruguay Program Co-chairs * Gilles Barthe, IMDEA Software, Spain * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden Program Committee * Bernhard K. Aichering, Graz University of Technology, Austria * Luis Barbosa, University of Minho, Portugal * Gilles Barthe, IMDEA Software, Spain * Thomas Anung Basuki, Parahyangan Catholic University, Indonesia * Alexandre Bergel, University of Chile, Chile * Gustavo Betarte, Universidad de la República, Uruguay * Ana Cavalcanti, University of York, UK * Pedro R. D'Argenio, Univ. Nacional de Córdoba, Argentina * Van Hung Dang, Vietnam National University, Vietnam * George Eleftherakis, SEERC, Greece * José Luiz Fiadeiro, University of Leicester, UK * Martin Fränzle, Oldenburg University, Germany * Stefania Gnesi, ISTI-CNR, Italy * Rob Hierons, Brunel University, UK * Paola Inverardi, University of L'Aquila, UK * Jean-Marie Jacquet, University of Namur, Belgium * Tomasz Janowski, UNU-IIST, China * Jean-Marc Jezequel, IRISA, France * Joseph Kiniry, IT University of Copenhagen, Denmark * Paddy Krishnan, Bond University, Australia * Martin Leucker, TU Munich, Germany * Xuandong Li, Nanjing University, China * Peter Lindsay, The University of Queensland, Australia * Antónia Lopes, University of Lisbon, Portugal * Nenad Medvidovic, University of Southern California, USA * Mercedes Merayo, Universidad Complutense de Madrid, Spain * Stephan Merz, INRIA Nancy, France * Madhavan Mukund, Chennai Mathematical Institute, India * Cesar Muñoz, NASA, USA * Martín Musicante, UFRN, Brazil * Mizuhito Ogawa, JAIST, Japan * Olaf Owe, University of Oslo, Norway * Gordon Pace, University of Malta, Malta * Ernesto Pimentel, University of Málaga, Spain * Sanjiva Prasad, Indian Institute of Technology Delhi, India * Anders Ravn, Aalborg University, Denmark * Leila Ribeiro, UFRGS, Brazil * Augusto Sampaio, UFPE, Brazil * Gerardo Schneider, Chalmers | Univ. of Gothenburg, Sweden * Sebastian Uchitel, Imperial College London, UK, and UBA, Argentina * Willem Visser, University of Stellenbosch, South Africa * Sergio Yovine, CONICET and UBA, Argentina Organising Committee * Carlos Luna, Universidad de la República, Uruguay * Alberto Pardo, Universidad de la República, Uruguay * Luis Sierra, Universidad de la República, Uruguay Steering Committee * Manfred Broy, TU Munich, Germany * Antonio Cerone, UNU-IIST, Macao SAR, China * Mike Hinchey, Lero-The Irish Software Engineering Research Centre, Ireland * Mathai Joseph, TRDDC, Pune, India * Zhiming Liu, UNU-IIST, Macao SAR, China * Andrea Maggiolo-Schettini, Pisa University, Italy

1 0

CFT -- Haskell Implementors' Workshop 2011
by Ben Lippmeier 20 Apr '11

20 Apr '11

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)

1 0

Extended deadline; IFIP sponsorship: IFIP Working Conference on Domain-Specific Languages
by Chung-chieh Shan 19 Apr '11

19 Apr '11

IFIP Working Conference on Domain-Specific Languages (DSL) 6-8 September 2011, Bordeaux, France http://dsl2011.bordeaux.inria.fr/ CALL FOR PAPERS (EXTENDED DEADLINE; IFIP SPONSORSHIP) Domain-specific languages have long been a popular way to shorten the distance from ideas to products in software engineering. On one hand, the interface of a DSL lets domain experts express high-level concepts succinctly in familiar notation, such as grammars for text or scripts for animation, and often provides guarantees and tools that take advantage of the specifics of the domain to help write and maintain these particular programs. On the other hand, the implementation of a DSL can automate many tasks traditionally performed by a few experts to turn a specification into an executable, thus making this expertise available widely. Overall, a DSL thus mediates a collaboration between its users and implementers that results in software that is more usable, more portable, more reliable, and more understandable. These benefits of DSLs have been delivered in domains old and new, such as signal processing, data mining, and Web scripting. Widely known examples of DSLs include Matlab, Verilog, SQL, LINQ, HTML, OpenGL, Macromedia Director, Mathematica, Maple, AutoLisp/AutoCAD, XSLT, RPM, Make, lex/yacc, LaTeX, PostScript, and Excel. Despite these successes, the adoption of DSLs have been stunted by the lack of general tools and principles for developing, compiling, and verifying domain-specific programs. General support for building and using DSLs is thus urgently needed. Languages that straddle the line between the domain-specific and the general-purpose, such as Perl, Tcl/Tk, and JavaScript, suggest that such support be based on modern notions of language design and software engineering. The goal of this conference, following the last one in 2009, is to explore how present and future DSLs can fruitfully draw from and potentially enrich these notions. We seek research papers on the theory and practice of DSLs, including but not limited to the following topics. * Foundations, including semantics, formal methods, type theory, and complexity theory * Language design, including concrete syntax, semantics, and types * Software engineering, including domain analysis, software design, and round-trip engineering * Modularity and composability of DSLs * Software processes, including metrics for software and language evaluation * Implementation, including parsing, compiling, program generation, program analysis, transformation, optimization, and parallelization * Reverse engineering, re-engineering, design discovery, automated refactoring * Hardware/software codesign * Programming environments and tools, including visual languages, debuggers, testing, and verification * Teaching DSLs and the use of DSLs in teaching * Case studies in any domain, especially the general lessons they provide for DSL design and implementation The conference will include a visit to the city of Bordeaux, a tour and tasting at the wine museum and cellar, and a banquet at La Belle Époque. INSTRUCTIONS FOR AUTHORS Papers will be judged on the depth of their insight and the extent to which they translate specific experience into general lessons for software engineers and DSL designers and implementers. Where appropriate, papers should refer to actual languages, tools, and techniques, provide pointers to full definitions, proofs, and implementations, and include empirical results. Proceedings will be published in Electronic Proceedings in Theoretical Computer Science (http://info.eptcs.org/) Submissions and final manuscripts should be at most 25 pages in EPTCS format. IMPORTANT DATES * 2011-04-25: Abstracts due (extended deadline) * 2011-05-02: Submissions due (extended deadline) * 2011-06-10: Authors notified of decisions * 2011-07-11: Final manuscripts due * 2011-09-05: Distilled tutorials * 2011-09-06/2011-09-08: Main conference PROGRAM COMMITTEE * Emilie Balland (INRIA) * Olaf Chitil (University of Kent) * Zoé Drey (LaBRI) * Nate Foster (Cornell University) * Mayer Goldberg (Ben-Gurion University) * Shan Shan Huang (LogicBlox) * Sam Kamin (University of Illinois at Urbana-Champaign) * Jerzy Karczmarczuk (University of Caen) * Jan Midtgaard (Aarhus University) * Keiko Nakata (Tallinn University of Technology) * Klaus Ostermann (University of Marburg) * Jeremy Siek (University of Colorado at Boulder) * Tony Sloane (Macquarie University) * Josef Svenningsson (Chalmers University of Technology) * Paul Tarau (University of North Texas) * Dana N. Xu (INRIA) ORGANIZERS Local chair: Emilie Balland (INRIA) Program chairs: Olivier Danvy (Aarhus University), Chung-chieh Shan (Rutgers University)

1 0

Another(!) PhD Position at Strathclyde
by Conor McBride 19 Apr '11

19 Apr '11

Hot on the heels of Patricia Johann's advertisement, here's another PhD Position in the Mathematically Structured Programming Group, Deparment of Computer and Information Sciences at the University of Strathclyde to be supervised by Dr. Conor McBride and Prof. Neil Ghani on something related to Designing Precision with Dependent Types. We invite applications for one PhD position within the Mathematically Structured Programming group at the University of Strathclyde. The group comprises Prof. Neil Ghani, Dr. Patricia Johann, Dr. Conor McBride, Dr. Peter Hancock, Dr. Robert Atkey, and five PhD students. The PhD project involves THEORETICAL and PRACTICAL issues in FUNCTIONAL PROGRAMMING with DEPENDENT TYPES. Dependent type systems allow us to construct precise variations on general-purpose datatypes which address the specific needs of particular programming problems, thus opening a new "precision" axis in the design space of programs and data. We seek equipment to help programmers explore this axis, determining what is needed to shift the level of precision at which existing functions operate and which properties are guaranteed in return. The project thus represents an opportunity to study mathematical abstractions with a concrete engineering motivation. The PhD position is for 3 years, starting in October 2011. The position is a fully-funded post for a UK or EU student, and includes coverage both of fees and an EPSRC-level stipend for each of the three years. More information about the department is available at http://www.strath.ac.uk/cis The University of Strathclyde (http://www.strath.ac.uk) is slap bang in the middle of Glasgow, a thronging metropolis of wit and daring. Scotland is a hive of activity in Computer Science: we have active collaborations with researchers at Edinburgh, Heriot-Watt, Glasgow and St. Andrews. This is the time and the place to make an impact. Requests for further information and other informal enquiries can be sent to: Conor McBride conor at cis.strath.ac.uk Please get in touch as soon as you can. We hope to appoint in early May.

1 0

Adjoint Folds and Unfolds Or: Scything through the Thicket of Morphisms
by KC 18 Apr '11

18 Apr '11

Just tripped over this: Adjoint Folds and Unfolds Or: Scything through the Thicket of Morphisms Folds and unfolds are at the heart of the algebra of programming. They allow the cognoscenti to derive and manipulate programs rigorously... Ralf Hinze Lecture Notes in Computer Science, 2010, Volume 6120, Mathematics of Program Construction, Pages 195-228 -- -- Regards, KC

1 0