November 2011 - Haskell

Haskell Weekly News: Issue 207
by Daniel Santa Cruz 10 Nov '11

10 Nov '11

Welcome to issue 207 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of October 30 to November 05, 2011. You can find the HTML version of this issue at: http://contemplatecode.blogspot.com/2011/11/haskell-weekly-news-issue-207.h… New and Updated Projects * hierarchical-clustering-diagrams (Felipe Almeida Lessa; 0.1) Library to draw diagrams of dendrograms. [1] http://goo.gl/7deyG * websockets (Jasper Van der Jeugt; 0.4.0.0) Major re-write to the library with support for multiple versions of the protocol. [2] http://goo.gl/i6bVr * cereal (Trevor Elliott; 0.3.4.0) Provides support for IEEE754 encoded Float/Double values. [3] http://goo.gl/GwZk8 Quotes of the Week * wyfrn: whats broken? my brain or ghci? * dons: Being really mean to your software, and following up when it breaks, makes it a lot better. But you have to be really, really mean. * hpc: and when you want to get really ridiculous, agda has universe polymorphism, which is when you don't know how high up the tower of turtles you have managed to climb Top Reddit Stories * Quick and dirty reinversion of control. Domain: blog.sigfpe.com, Score: 59, Comments: 7 On Reddit: [4] http://goo.gl/J2oon Original: [5] http://goo.gl/pQYGA * Running a Startup on Haskell [Presentation] Domain: infoq.com, Score: 57, Comments: 12 On Reddit: [6] http://goo.gl/uqfqN Original: [7] http://goo.gl/QMu5c * LLVM patch is merged for inclusion in LLVM 3.0 release | GHC on ARM Domain: ghcarm.wordpress.com, Score: 48, Comments: 2 On Reddit: [8] http://goo.gl/UNRN6 Original: [9] http://goo.gl/h6q7I * Thunks and lazy blackholes: an introduction to GHC at runtime Domain: mainisusuallyafunction.blogspot.com, Score: 39, Comments: 0 On Reddit: [10] http://goo.gl/nQN3U Original: [11] http://goo.gl/HqKaL * GHC feature request: warn about unused constraints -- "I think this could make for a nice project for someone wanting to dig into hacking on GHC" Domain: byorgey.wordpress.com, Score: 34, Comments: 16 On Reddit: [12] http://goo.gl/MIMCN Original: [13] http://goo.gl/GPt0B * Haskell Implementors Workshop 2011 Videos Online! Domain: neilmitchell.blogspot.com, Score: 31, Comments: 3 On Reddit: [14] http://goo.gl/MqszQ Original: [15] http://goo.gl/LUsFe * What Constraints Entail, Part 1 Domain: comonad.com, Score: 29, Comments: 0 On Reddit: [16] http://goo.gl/Tt41V Original: [17] http://goo.gl/SdGdm * [Newbie]: Haskell code is really slow compared to same code in Python. Can anyone help me find what the problem is ? Domain: self.haskell, Score: 29, Comments: 51 On Reddit: [18] http://goo.gl/15bb8 Original: [19] http://goo.gl/15bb8 * Please help me gather information about Haskell installations on Macs Domain: gist.github.com, Score: 26, Comments: 14 On Reddit: [20] http://goo.gl/Yfc32 Original: [21] http://goo.gl/xQACw * Why learning Functional Programming (and Haskell in particular) can be hard Domain: harishankar.org, Score: 25, Comments: 46 On Reddit: [22] http://goo.gl/8Xb3V Original: [23] http://goo.gl/FKlcj * How do you write nontrivial tests in QuickCheck? Domain: self.haskell, Score: 23, Comments: 15 On Reddit: [24] http://goo.gl/FL6jh Original: [25] http://goo.gl/FL6jh Top StackOverflow Questions * Calling Haskell from Java with C in between votes: 14, answers: 1 Read on SO: [26] http://goo.gl/RyN00 * Is “List” specially handled in Haskell's pattern matching? votes: 14, answers: 5 Read on SO: [27] http://goo.gl/y3hdi * Why does this simple use of the State monad cause a stack overflow? votes: 12, answers: 1 Read on SO: [28] http://goo.gl/bLlnX * Why does this Haskell code not terminate? votes: 10, answers: 4 Read on SO: [29] http://goo.gl/LStfr * Is it possible to make a type an instance of a class if its type parameters are in the wrong order? votes: 10, answers: 4 Read on SO: [30] http://goo.gl/aRh0b * How to make a type with restrictions votes: 9, answers: 3 Read on SO: [31] http://goo.gl/SRTfY * Desugaring do-notation for Monads votes: 9, answers: 1 Read on SO: [32] http://goo.gl/CqoQF * Equation from “Programming Pearls” - can somebody explain me? votes: 8, answers: 1 Read on SO: [33] http://goo.gl/kUr67 * ADT names. What is `Left a`, and then what is `a`, in Haskell? votes: 8, answers: 2 Read on SO: [34] http://goo.gl/IVoN0 * Why are boxed vectors so slow? votes: 8, answers: 1 Read on SO: [35] http://goo.gl/4RrQX Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.bio/156 2. http://permalink.gmane.org/gmane.comp.lang.haskell.web/2204 3. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/93644 4. http://blog.sigfpe.com/2011/10/quick-and-dirty-reinversion-of-control.html 5. http://www.reddit.com/r/haskell/comments/luyf4/quick_and_dirty_reinversion_… 6. http://www.infoq.com/presentations/Running-a-Startup-on-Haskell 7. http://www.reddit.com/r/haskell/comments/lv9ge/running_a_startup_on_haskell… 8. https://ghcarm.wordpress.com/2011/11/03/llvm-patch-is-merged-for-inclusion-… 9. http://www.reddit.com/r/haskell/comments/lzaa7/llvm_patch_is_merged_for_inc… 10. http://mainisusuallyafunction.blogspot.com/2011/10/thunks-and-lazy-blackhol… 11. http://www.reddit.com/r/haskell/comments/luxzj/thunks_and_lazy_blackholes_a… 12. https://byorgey.wordpress.com/2011/11/05/wanted-ghc-feature-warn-about-unus… 13. http://www.reddit.com/r/haskell/comments/m23h2/ghc_feature_request_warn_abo… 14. http://neilmitchell.blogspot.com/2011/11/haskell-implementors-workshop-2011… 15. http://www.reddit.com/r/haskell/comments/lwpzf/haskell_implementors_worksho… 16. http://comonad.com/reader/2011/what-constraints-entail-part-1/ 17. http://www.reddit.com/r/haskell/comments/lyqnx/what_constraints_entail_part… 18. http://www.reddit.com/r/haskell/comments/m03p9/newbie_haskell_code_is_reall… 19. http://www.reddit.com/r/haskell/comments/m03p9/newbie_haskell_code_is_reall… 20. https://gist.github.com/f8f0464fb76e9fa2cfa1 21. http://www.reddit.com/r/haskell/comments/lz26e/please_help_me_gather_inform… 22. http://harishankar.org/blog/entry.php/why-learning-functional-programming-a… 23. http://www.reddit.com/r/haskell/comments/lv84d/why_learning_functional_prog… 24. http://www.reddit.com/r/haskell/comments/lvupa/how_do_you_write_nontrivial_… 25. http://www.reddit.com/r/haskell/comments/lvupa/how_do_you_write_nontrivial_… 26. http://stackoverflow.com/questions/7961335/calling-haskell-from-java-with-c… 27. http://stackoverflow.com/questions/7992524/is-list-specially-handled-in-has… 28. http://stackoverflow.com/questions/7998458/why-does-this-simple-use-of-the-… 29. http://stackoverflow.com/questions/7960543/why-does-this-haskell-code-not-t… 30. http://stackoverflow.com/questions/8005372/is-it-possible-to-make-a-type-an… 31. http://stackoverflow.com/questions/7978191/how-to-make-a-type-with-restrict… 32. http://stackoverflow.com/questions/8019670/desugaring-do-notation-for-monads 33. http://stackoverflow.com/questions/7967337/equation-from-programming-pearls… 34. http://stackoverflow.com/questions/7969499/adt-names-what-is-left-a-and-the… 35. http://stackoverflow.com/questions/7978130/why-are-boxed-vectors-so-slow

1 0

Call for Participation: 2nd Hiperfit Workshop, December 1-2, 2011, Copenhagen (DK)
by Jost Berthold 09 Nov '11

09 Nov '11

Please redistribute this call to interested readers. ______________________________________________________________________ 2nd Hiperfit Workshop 2011 Mathematical Finance meets Programming Languages and Systems Call for Participation December 1-2, 2011 Copenhagen, Denmark Information online: http://hiperfit.dk/workshop-12-2011.html _______________________________________________________________________ Hiperfit -------- Today, the financial sector faces daunting computational challenges, involving both an increasing demand for performance and higher transparency requirements. In addition, time-to-market is more and more important for financial applications, both by commercial software developers and in-house. The Hiperfit[1] research center at the University of Copenhagen aims to solve these simultaneous challenges of high transparency, high computational performance and high productivity in an integrated approach of declarative, domain specific and high-level functional programming languages. Hiperfit fosters cooperation between researchers from three different university departments (Computer Science, Mathematics, and Physics), and major industrial partners. Researchers and practicioners contribute cutting edge knowledge from their respective fields to bear on computational and algorithmic problems that transcend their own field of expertise. 2nd Hiperfit workshop, December 1st and 2nd , 2011 -------------------------------------------------- In view of our interdisciplinary spirit, Hiperfit organises biannual workshops to encourage experts' exchange and discussions. Our 2nd workshop, which will take place in Copenhagen on December 1-2, features 10 invited presentations by our academic partners and invited guests, combined with two special talks (DIKU talk and COPLAS talk series). Our eleven speakers are international researchers from the different Hiperfit areas, ranging from modern mathematical finance, via programming language technology and modern approaches to parallel programming, to high-performance systems. Interested researchers and practicioners of all related fields are invited to participate in this exciting event in Copenhagen, to meet and discuss with our international speakers and guests. Organisation and Venue ---------------------- The Hiperfit 2011 workshop will be held at the University of Copenhagen, North Campus, in the HCO building - next to the Department of Com- puter Science (DIKU). A map and travel information can be found on the department web pages: http://www.diku.dk/english/contact/findvej_kopi_kopi/ There will be no published proceedings, the meeting is intended to be an interdisciplinary forum for discussion and networking. For more in- formation, including presentation abstracts and the most recent schedule information, please visit the workshop web pages: http://hiperfit.dk/workshop-12-2011.html Participation is free, but for organisational purposes, a workshop registration is required. To register, please fill out the web form accessible from the workshop pages. Looking forward to seeing you in Copenhagen! Jost Berthold and Fritz Henglein - Hiperfit Research Center Workshop Programme ------------------ Thursday 1st December: * Claudio Albanese, Imperial College/Global Valuation Ltd High Throughput Portfolio Processing on Heterogeneous Boards * Enrico Biffis, Imperial College Collateral Flows, Funding Costs, and Counterparty-Risk- Neutral Swap Rates * Don Syme, Microsoft Research Redmond Strongly-Typed Programming in the Information Rich World * Niels Nygaard, University of Chicago Optimal Discretization of Random Variables and Option Pricing Using F# * Satnam Singh, University of Birmingham Data-parallel GPU/FPGA Programming with Accelerator * Manuel Chakravarty, University of New South Wales Shared Data Structures in Nested Data Parallelism * Mary Sheeran, Chalmers University of Technology (DIKU talk) Domain-Specific Languages: Past, Present and Future Friday 2nd Dec.: * Bob Harper, Carnegie-Mellon University Title TBA * John Reppy, University of Chicago Portable Parallelism in Diderot * Clemens Grelck, University of Amsterdam Declarative Array Programming with Single Assignment C - Language Design and Compiler Technology - * Thomas Neumann, Technical University Munich HyPer-sonic Combined Transaction AND Query Processing * Bob Harper, Carnegie-Mellon University (COPLAS talk) TBA [1] Hiperfit is the research center for Functional High-Performance Financial Information Technology at the University of Copenhagen, funded by the Danish Council for strategic research. In cooperation with CFIR (Copenhagen Finance IT Region), the center joins researchers in mathematical finance, programming languages, and systems, and four major Danish banks (Danske Bank, Nordea, Jyske Bank, Nykredit) and two companies in Financial Software (SimCorp, Lexifi). For more information see http://hiperfit.dk. Apologies if you receive this call more than once.

1 0

A Brazilian community for Haskell
by Giovanni Tirloni 08 Nov '11

08 Nov '11

Hello, To gather all Haskellers in Brazil, a new mailing list has been created: http://projects.haskell.org/cgi-bin/mailman/listinfo/haskell-br There is also the #haskell-br channel on Freenode as well as Twitter and Google+ feeds to keep everybody updated on recent activities. More information at: http://www.haskell-br.org/ []'s -- Giovanni

1 0

ANN: virthualenv - Virtual Haskell Environment
by Bartek Ćwikłowski 08 Nov '11

08 Nov '11

I am pleased to announce the first public release of the virthualenv tool. What is it? ========= virthualenv is a tool (inspired by Python's virtualenv) to create isolated Haskell environments. What does it do? ============== It creates a sandboxed environment in a .virthualenv/ sub-directory of your project, which, when activated, allows you to use regular Haskell tools (ghc, ghci, ghc-pkg, cabal) to manage your Haskell code and environment. It's possible to create an environment, that uses different GHC version than your currently installed. Very simple Emacs integration mode is included. Basic usage ========== First, choose a directory where you want to keep your sandboxed Haskell environment, usually a good choice is a directory containing your cabalized project (if you want to work on a few projects (perhaps an app and its dependent library), just choose any of them, it doesn't really matter). Enter that directory: > cd ~/projects/foo Next, create your new isolated Haskell environment (this is a one time only (per environment) step): > virthualenv Now, every time you want to use this environment, you have to activate it: > source .virthualenv/bin/activate That's it! Now it's possible to use all regular Haskell tools like usual, but it won't affect your global/system's Haskell environment, and also your per-user environment (from ~/.cabal and ~/.ghc) will stay the same. All cabal-installed packages will be private to this environment, and also the external environments (global and user) will not affect it (this environment will only inherit very basic packages, mostly ghc and Cabal and their deps). When you're done working with this environment, enter command 'deactivate', or just close the current shell (with exit). > deactivate More info ======== Hackage: http://hackage.haskell.org/package/virthualenv Github: https://github.com/Paczesiowa/virthualenv Readme: https://github.com/Paczesiowa/virthualenv/blob/master/README.md Blog post: http://paczesiowa.blogspot.com/2011/11/virtual-haskell-environment.html Regards, Bartosz Ćwikłowski

1 0

Re: [Haskell] Records in Haskell
by Barney Hilken 07 Nov '11

07 Nov '11

(sorry, I meant to send this to the list, but only sent it to Wolfgang) Here is my understanding of the current state of the argument: Instead of Labels, there will be a new kind String, which is not a subkind of *, so its elements are not types. The elements of String are strings at the type level, written just like normal strings. If you want labels, you can define them yourself, either empty: data Label (a :: String) or inhabited data Label (a :: String) = Label these definitions give you a family of types of the form Label "name", in the first case empty (except for undefined), in the second case inhabited by a single element (Label :: Label "name") There are several similar proposals for extensible records defined using labels, all of which (as far as I can see) could be defined just as easily using the kind String. There is also a proposal for nonextensible records, using the same techniques, which has (almost) converged with Simon's latest version of TDNR records. The problem with all of these is dealing with higher-rank field types: the current implementation of impredicative polymorphism isn't general enough to allow update of polymorphic fields. It seems to me that, if we could solve the (hard) impredicativity problem, we would be very close to a design which would 1. be compatible with existing code 2. allow field names to be polymorphic 3. make the future addition of extensible records possible The question is, should we wait till someone solves the impredicativity problem, or go ahead with a cludgy design now? Barney.

1 0

CFP: FD-COMA 2012: Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures
by Clemens Grelck 04 Nov '11

04 Nov '11

Extended deadline: Nov 11, 2011 !! Call for Papers: FD-COMA 2012 Workshop on Feedback-Directed Compiler Optimization for Multi-Core Architectures 7th HiPEAC Conference Paris, France, Jan 23-25, 2012 http://www.project-advance.eu/2011/10/fd-coma-workshop-2012/ http://www.hipeac.org/conference FD-COMA is a one-day workshop during the 7th HiPEAC Conference in Paris, January 23-25, 2012. The workshop is loosely connected to the FP-7 project Advance, but we particularly welcome contributions from outside the project consortium. Scope: Feedback driven optimizations have long proven to be powerful instruments for achieving better hardware utilization, but the on-going multi-core/many-core revolution opens up a whole new realm of possible applications and variations of feedback-directed compiler optimization. The increasing hardware diversity of execution platforms and the likewise increasing hardware heterogeneity of individual execution platforms make compile time resource planning less and less feasible. Dynamic compilation techniques are required, instead, that adapt application programs to the actual hardware they are running on to make best use of it. Furthermore, the abundance of compute cores allows us to run feedback-directed compiler optimizations in parallel with an application itself and, thus, to adapt a running application to the hardware it is running on or to the data it is processing, to name just a few opportunities. This workshop aims at bringing people together that share an interest in the novel opportunities for feedback directed optimisations in the context of the emerging heterogeneous architectures. Main topics: + Feedback directed compiler optimization for multi-core architectures + Compiler representations for feedback information + Performance modeling for feedback, including statistical and constraint-based techniques + Performance measurement using feedback information + Exploiting feedback for heterogeneous multi-core systems + Adaptive, feedback-controlled runtime systems for multi-core architectures + Exploiting feedback information for energy savings FD-COMA welcomes submission of papers describing: + Experimental work + Industrial experience + Theoretical work + Software and hardware platforms + Work in progress all with respect to the above workshop topics Paper submission: Submitted papers must not have been published or simultaneously submitted elsewhere. The full manuscript should be at most 8 pages. Submit a PDF copy of your manuscript via EasyChair (not yet open). Each paper will receive a minimum of two reviews. Papers will be selected based on their originality, relevance, technical clarity and presentation. Authors of accepted papers must guarantee that their papers will be registered and presented at the workshop. Accepted papers will be made available at the workshop in electronic form. Important dates: Submission deadline: 11/11/2011 Notification of acceptance: 22/11/2011 Final version due: 13/1/2012 Workshop organizers: Kevin Hammond, University of St Andrews, United Kingdom Clemens Grelck, University of Amsterdam, Netherlands Sven-Bodo Scholz, Heriott-Watt University, United Kingdom -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 University Lecturer 1098XH Amsterdam Netherlands University of Amsterdam Institute for Informatics T +31 (0) 20 525 8683 Computer Systems Architecture Group F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ----------------------------------------------------------------------

1 0

Haskell Weekly News: Issue 206
by Daniel Santa Cruz 03 Nov '11

03 Nov '11

Welcome to issue 206 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of October 23 to 29, 2011. A HTML version of this issue can be found at: http://contemplatecode.blogspot.com/2011/11/haskell-weekly-news-issue-206.h… Announcements Edward Kmett extended an invitation to the Hac Boston, to be held between Jan 20 to 22, 2012 at MIT in Cambridge, MA. [1] http://goo.gl/cZpvu Brent Yorgey has released the lastest issue of the Monad.Reader. This is a special issue on parallelism and concurrency. [2] http://goo.gl/JqIpx Ganesh Sittampalam shared the haskell.org committee's first-year report. [3] http://goo.gl/O1vNQ New and Updated Projects * diagrams (Brent Yorgey; 0.4) There are "quite a few changes and improvements" since the 0.1 release. [4] http://goo.gl/4nCE7 * HasGP (Sean Holden; 0.1) A library for Gaussian process inference. [5] http://goo.gl/JAI8u * OpenGL (Jason Dagit) Updates to the following packages: OpenGL, OpenGLRaw, GLURaw, and GLUT. [6] http://goo.gl/mhTek Quotes of the Week * DanBurton: are you using -XAbsurdInstances again? * ritchie: C has the power of assembly language and the convenience of ... assembly language. * RaptorRarr: Analogy puzzles are to intelligence as __________ is to elephants * Eduard_Munteanu: Haskell Ain't Some Kludgy Enterprisey Lame Language * byorgey: Monads are not supposed to be anything. They just are. * kmc: 4:20 smoke MagicHash every day Top Reddit Stories * Giving Haskell a Promotion (typed type-level programming/new kind system paper) Domain: research.microsoft.com, Score: 76, Comments: 29 On Reddit: [7] http://goo.gl/W5Jbb Original: [8] http://goo.gl/1p4BU * Frameworks drive language adoption - Yesod Blog Domain: yesodweb.com, Score: 57, Comments: 15 On Reddit: [9] http://goo.gl/BAOKH Original: [10] http://goo.gl/KEZU9 * Snap 0.6 Released Domain: snapframework.com, Score: 57, Comments: 8 On Reddit: [11] http://goo.gl/YdfTn Original: [12] http://goo.gl/3wTbZ * Code that writes code and conversation about conversations Domain: yesodweb.com, Score: 49, Comments: 23 On Reddit: [13] http://goo.gl/3cjxL Original: [14] http://goo.gl/701ar * The Monad.Reader Issue 19: Parallelism and Concurrency Domain: themonadreader.files.wordpress.com, Score: 49, Comments: 8 On Reddit: [15] http://goo.gl/D8AcV Original: [16] http://goo.gl/virTX * Zero-Analogy Monad Tutorial Domain: unknownparallel.com, Score: 48, Comments: 57 On Reddit: [17] http://goo.gl/kwf8k Original: [18] http://goo.gl/RbAWG * Dear Redditor Vim-loving Haskeller(s): what cool vim plugins or features do you use? Domain: self.haskell, Score: 46, Comments: 35 On Reddit: [19] http://goo.gl/oL6vH Original: [20] http://goo.gl/oL6vH * Rendering animated quasicrystals in parallel, with Haskell and Repa Domain: mainisusuallyafunction.blogspot.com, Score: 43, Comments: 12 On Reddit: [21] http://goo.gl/aJzFN Original: [22] http://goo.gl/rEs6X * Why is there no "cabal uninstall" option? Domain: self.haskell, Score: 39, Comments: 26 On Reddit: [23] http://goo.gl/2zy6P Original: [24] http://goo.gl/2zy6P * Quasicrystals rendered in real time using a pre-release or Repa3 [video]. Domain: youtube.com, Score: 36, Comments: 0 On Reddit: [25] http://goo.gl/SA7Zt Original: [26] http://goo.gl/YaJN8 Top StackOverflow Questions * How to make my Haskell program faster? Comparison with C votes: 28, answers: 4 Read on SO: [27] http://goo.gl/s01Nc * Why is it faster to sum a Data.Sequence by divide-and-conquer, even with no parallelism? votes: 25, answers: 2 Read on SO: [28] http://goo.gl/nR2eC * ST Monad == code smell? votes: 19, answers: 3 Read on SO: [29] http://goo.gl/sQeYv * Algorithm for type checking ML-like pattern matching? votes: 19, answers: 3 Read on SO: [30] http://goo.gl/Sl6Zy * Why does GHC think that this type variable is not injective? votes: 16, answers: 2 Read on SO: [31] http://goo.gl/smdFX * Expression evaluation mode in haskell for scripting votes: 13, answers: 3 Read on SO: [32] http://goo.gl/1UIAq * PCRE in Haskell - what, where, how? votes: 10, answers: 4 Read on SO: [33] http://goo.gl/43Dtu * Non-Trivial Lazy Evaluation votes: 9, answers: 2 Read on SO: [34] http://goo.gl/2BlZ4 * How to get variable name in haskell votes: 7, answers: 2 Read on SO: [35] http://goo.gl/we5N7 * Is it possible to define type with callable objects in Haskell? votes: 7, answers: 3 Read on SO: [36] http://goo.gl/qnNjb Until next time, Daniel Santa Cruz References 1. http://comments.gmane.org/gmane.comp.lang.haskell.cafe/93405 2. http://permalink.gmane.org/gmane.comp.lang.haskell.general/19000 3. http://permalink.gmane.org/gmane.comp.lang.haskell.general/19002 4. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/93323 5. http://permalink.gmane.org/gmane.comp.lang.haskell.general/18999 6. http://comments.gmane.org/gmane.comp.lang.haskell.hopengl/858 7. http://research.microsoft.com/en-us/people/dimitris/fc-kind-poly.pdf 8. http://www.reddit.com/r/haskell/comments/lpw4a/giving_haskell_a_promotion_t… 9. http://www.yesodweb.com/blog/2011/10/frameworks-drive 10. http://www.reddit.com/r/haskell/comments/ln8hi/frameworks_drive_language_ad… 11. http://snapframework.com/blog/2011/10/28/snap-0.6-released 12. http://www.reddit.com/r/haskell/comments/lrwdi/snap_06_released/ 13. http://www.yesodweb.com/blog/2011/10/code-generation-conversation 14. http://www.reddit.com/r/haskell/comments/lp4ya/code_that_writes_code_and_co… 15. http://themonadreader.files.wordpress.com/2011/10/issue19.pdf 16. http://www.reddit.com/r/haskell/comments/lqmqh/the_monadreader_issue_19_par… 17. http://unknownparallel.com/monads.php 18. http://www.reddit.com/r/haskell/comments/lskew/zeroanalogy_monad_tutorial/ 19. http://www.reddit.com/r/haskell/comments/lmapn/dear_redditor_vimloving_hask… 20. http://www.reddit.com/r/haskell/comments/lmapn/dear_redditor_vimloving_hask… 21. http://mainisusuallyafunction.blogspot.com/2011/10/quasicrystals-as-sums-of… 22. http://www.reddit.com/r/haskell/comments/lnxe7/rendering_animated_quasicrys… 23. http://www.reddit.com/r/haskell/comments/lrc39/why_is_there_no_cabal_uninst… 24. http://www.reddit.com/r/haskell/comments/lrc39/why_is_there_no_cabal_uninst… 25. http://www.youtube.com/watch?v=v_0Yyl19fiI 26. http://www.reddit.com/r/haskell/comments/lq845/quasicrystals_rendered_in_re… 27. http://stackoverflow.com/questions/7893786/how-to-make-my-haskell-program-f… 28. http://stackoverflow.com/questions/7869359/why-is-it-faster-to-sum-a-data-s… 29. http://stackoverflow.com/questions/7880555/st-monad-code-smell 30. http://stackoverflow.com/questions/7883023/algorithm-for-type-checking-ml-l… 31. http://stackoverflow.com/questions/7866375/why-does-ghc-think-that-this-typ… 32. http://stackoverflow.com/questions/7888632/expression-evaluation-mode-in-ha… 33. http://stackoverflow.com/questions/7882512/pcre-in-haskell-what-where-how 34. http://stackoverflow.com/questions/7868507/non-trivial-lazy-evaluation 35. http://stackoverflow.com/questions/7896928/how-to-get-variable-name-in-hask… 36. http://stackoverflow.com/questions/7902520/is-it-possible-to-define-type-wi…

1 0

VSTTE 2012 Competition: Final Call for Participation - 1 WEEK TO GO!
by Gudmund Grov 01 Nov '11

01 Nov '11

VSTTE 2012 Verification Competition starts Tuesday 8 November 2011! Follow the announcements at the competition Web page: https://sites.google.com/site/vstte2012/compet Join the discussion group or subscribe to our mailing list: http://groups.google.com/group/vstte-2012-verification-competition vstte-2012-verification-competition%2Bsubscribe(a)googlegroups.com VSTTE 2012 Verification Competition ----------------------------------- A software verification competition is organized on behalf of the VSTTE 2012 conference (https://sites.google.com/site/vstte2012) The purposes of this competition are: to help promote approaches and tools, to provide new verification benchmarks, to stimulate further development of verification techniques, and to have fun. The contest takes place during 48 hours, on 8-10 November 2011, two months prior to the conference. Problems will be put on the website of the conference. Solutions must be sent by email to the competition organizers. Any programming language, specification language, and verification tool is allowed. There will be several independent problems. Each problem is presented as a sequential algorithm, using English or pseudocode, and a list of properties to formally prove about it, also expressed in plain English and standard mathematical notation. Participants have liberty to implement the proposed algorithms in functional, imperative, object-oriented, or any other programming style. Anybody interested can take part in the contest. Team work is allowed, but only teams up to 4 members are eligible for the first prize. Individual participants may belong to several teams. However, the same solution cannot appear in different submissions. The winner is awarded a talk slot at VSTTE 2012, to present any research of his/her choice of interest for the VSTTE community. In particular, a presentation of solutions to the competition problems and/or of the techniques and system used would be appreciated. Tuesday 8 Nov 2011, 15:00 UTC - competition starts Thursday 10 Nov 2011, 15:00 UTC - competition stops Monday 12 Dec 2011 - the winner is notified 28-29 Jan 2012 - results are announced at VSTTE 2012 -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0