- Haskell - Haskell.org

ANNOUNCE: haskell-src-exts 1.14.0
by Niklas Broberg 20 Aug '13

20 Aug '13

Fellow Haskelleers, I'm pleased to announce the release of haskell-src-exts-1.14.0! * On hackage: http://hackage.haskell.org/package/haskell-src-exts * Via cabal: cabal install haskell-src-exts * git repo: https://github.com/haskell-suite/haskell-src-exts<http://code.haskell.org/haskell-src-exts> There are two primary reasons for this release, and a number of smaller ones. The first primary reason is technical: haskell-src-exts 1.14 revamps the Extension datatype, among other things to allow turning extensions on and off (similar to what Cabal allows). We also introduce the concept of a Language, separate from a set of extensions. This is the only backwards-incompatible change in this release. The second reason is structural: haskell-src-exts is now part of a larger context -- the Haskell Suite. The package has a new home on github (see above), alongside its new cool friends: haskell-names and haskell-packages. There is also a really nice issue tracker there - please help me fill it, or better yet, empty it! What this release does *not* cover is support for the extensions added to GHC in recent time (with the exceptions of CApiFFI and InterruptibleFFI). Work is in progress on many of these, and there will be another major release not far off in the future. This release owes many thanks to Roman Cheplyaka in particular, as well as Erik Hesselink, Simon Meier and David Fox. Thanks a lot! Complete changelog: 1.13.6 --> 1.14.0 =============== * Modernize the Extension datatype in L.H.E.Extension, following the lead of Cabal, to allow negative and positive extension modifiers (turning features on and off). You need to worry about backwards-incompatible changes if any of the following pertains to you: 1) If you use the Extension datatype programmatically - it has changed significantly (see documentation). 2) The ParseMode record now has one more field (baseLanguage :: Language), which might give you a type error. 3) The behavior of the (extensions :: [Extension]) field has changed, which could bite you if you pass custom extensions in the ParseMode. Previously, the ParseMode defaulted to the list of extensions accepted by Haskell2010, and if you set the list explicitly you would override this. Now, the defaults are { baseLanguage = Haskell2010, extensions = [] }, and explicitly setting a list of extensions will be interpreted on top of Haskell2010. See further the documentation for L.H.E.Extension. * Add support for the 'capi' calling convention. It is enabled with the CApiFFI extension. It's been included since GHC 7.4, and advertised since 7.6. * Add support for the 'interruptible' FFI safety annotation, enabled with the InterruptibleFFI extension. * Give better error message when lexing newline fails. In particular, fix the bug when the parser would crash if the file didn't end with a newline. * Support unboxed tuple expressions and patterns. * Fix bug in lexing of primitive integer literals in hex or octal notation. * Disallow negative primitive word literals (such as W# (-0x8000000000000000##)). * Allow phase control for SPECIALIZE pragma. * Derive Foldable and Traversable instances for all annotated AST types. * Fix bug with pretty-printing WARNING and DEPRECATED pragmas. Cheers, Niklas

3 7

ICFP 2013 Call for Participation
by Tarmo Uustalu 17 Aug '13

17 Aug '13

===================================================================== CALL FOR PARTICIPATION 18th ACM SIGPLAN International Conference on Functional Programming ICFP 2013 Boston, MA, USA, 25-27 September 2013 Affiliated events 22-24 September, 28 September 2013 http://www.icfpconference.org/icfp2013 ===================================================================== ICFP is a forum for researchers and practitioners to hear about the latest developments in the art and science of functional programming. The conference cover the entire spectrum of work, from theory to practice. The keynote speakers of ICFP 2013 are Ulf Norell on dependently typed programming and Simon Peyton Jones on computer science as a school subject. The 40 contributed papers on all aspects of functional programming were selected by the program committee from 133 submissions. Affiliated to ICFP 2013 are: ACM SIGPLAN Commercial Users of Functional Programming Workshop ACM SIGPLAN Workshop on Dependently Typed Programming ACM SIGPLAN Workshop on Functional Art, Music, Modeling and Design ACM SIGPLAN Workshop on Functional High-Performance Computing ACM SIGPLAN Erlang Workshop ACM SIGPLAN Functional Programming in Domain-Specific Languages Workshop ACM SIGPLAN Workshop on Generic Programming ACM SIGPLAN Haskell Symposium ACM SIGPLAN Haskell Implementors Workshop ACM SIGPLAN Workshop on Higher-Order Programming with Effects ACM SIGPLAN International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice ACM SIGPLAN Workshop on ML ACM SIGPLAN OCaml Workshop VENUE The conference will take place at Hilton Boston Logan Airport Hotel. REGISTRATION Registration is available at https://regmaster3.com/2013conf/ICFP13/register.php *Note that early registration ends 22 August 2013.* ICFP 2013 PROGRAMME Wednesday, 25 September 9-10 Keynote 1 Interactive Programming with Dependent Types Ulf Norell (Chalmers University of Technology) 10-1020 Break 1020-1100 Session 1: Verification with Grammars and Automata Verified Decision Procedures for MSO on Words Based on Derivatives of Regular Expressions [Functional Pearl] Dmitriy Traytel and Tobias Nipkow C-SHORe Christopher Broadbent, Arnaud Carayol, Matthew Hague and Olivier Serre 1100-1130 Break 1130-1230 Session 2 Automatic SIMD Vectorization for Haskell Leaf Petersen, Dominic Orchard and Neal Glew Exploiting Vector Instructions with Generalized Stream Fusion Geoffrey Mainland, Roman Leshchinskiy and Simon Peyton Jones Optimising Purely Functional GPU Programs Trevor L. McDonell, Manuel Chakravarty, Gabriele Keller and Ben Lippmeier 1230-14 Lunch 14-15 Session 3: Dependent Types Type-Theory In Color Jean-Philippe Bernardy and Guilhem Moulin Typed Syntactic Meta-programming Dominique Devriese and Frank Piessens Mtac: A Monad for Typed Tactic Programming in Coq Beta Ziliani, Derek Dreyer, Neelakantan Krishnaswami, Aleksandar Nanevski and Viktor Vafeiadis 15-1530 Break 1530-1630 Session 4: Fun in the Afternoon Fun with Semirings [Functional Pearl] Stephen Dolan Efficient Divide-and-Conquer Parsing of Practical Context-Free Languages Jean-Philippe Bernardy and Koen Claessen Functional Geometry and the "Traité de Lutherie" [Functional Pearl] Harry Mairson 1630-17 Break 17-1740 Session 5: Handling Effects Programming and Reasoning with Algebraic Effects and Dependent Types Edwin Brady Handlers in Action Ohad Kammar, Sam Lindley and Nicolas Oury 1740-18 Program Chair's Report Thursday, 26 September 9-10 Keynote 2 Computer Science as a School Subject Simon Peyton Jones (Microsoft Research, Cambridge, UK) 10-1020 Break 1020-11 Session 6: Concurrency Correctness of an STM Haskell Implementation Manfred Schmidt-Schauss and David Sabel Programming with Permissions in Mezzo Francois Pottier and Jonathan Protzenko 11-1130 Break 1130-1230 Session 7: (Co-)Recursion Wellfounded Recursion with Copatterns Andreas Abel and Brigitte Pientka Productive Coprogramming with Guarded Recursion Robert Atkey and Conor McBride Unifying Structured Recursion Schemes Ralf Hinze, Nicolas Wu and Jeremy Gibbons 1230-14 Lunch 14-15 Session 8: Functional Reactive Programming (and More) Higher-Order Functional Reactive Programming without Spacetime Leaks Neelakantan Krishnaswami Functional Reactive Programming with Liveness Guarantees Alan Jeffrey A Short Cut to Parallelization Theorems Akimasa Morihata 15-1530 Break 1530-1630 Session 9: Lambda-Calculus Using Circular Programs for Higher-Order Syntax [Functional Pearl] Emil Axelsson and Koen Claessen Weak Optimality, and the Meaning of Sharing Thibaut Balabonski System FC with Explicit Kind Equality Stephanie Weirich, Justin Hsu and Richard A. Eisenberg 1630-17 Break 17-1740 Programming Contest Co-Chairs' Report and Awards 1740-18 ICFP 2003 Most Influential Paper Award Friday, 27 September 9-10 Session 10: Monads The Constrained-Monad Problem Neil Sculthorpe, Jan Bracker, George Giorgidze and Andy Gill Simple and Compositional Reification of Monadic Embedded Languages [Functional Pearl] Josef Svenningsson and Bo Joel Svensson Structural Recursion for Querying Ordered Graphs Soichiro Hidaka, Kazuyuki Asada, Zhenjiang Hu, Hiroyuki Kato and Keisuke Nakano 10-1020 Break 1020-11 Session 11: Modular Meta-Theory Modular Monadic Meta-Theory Benjamin Delaware, Steven Keuchel, Tom Schrijvers and Bruno Oliveira Modular and Automated Type-Soundness Verification for Language Extensions Florian Lorenzen and Sebastian Erdweg 11-1130 Break 1130-1230 Session 12: Experience Reports (Chair: John Launchbury) A Nanopass Framework for Commercial Compiler Development [Experience Report] Andrew Keep and R Kent Dybvig Applying Random Testing to a Base Type Environment [Experience Report] Vincent St-Amour and Neil Toronto Functional Programming of mHealth Applications [Experience Report] Christian Petersen, Matthias Gorges, Dustin Dunsmuir, Mark Ansermino and Guy Dumont 1230-14 Lunch 14-15 Session 13: Program Logics Hoare-Style Reasoning with (Algebraic) Continuations Germán Andrés Delbianco and Aleksandar Nanevski Unifying Refinement and Hoare-Style Reasoning in a Logic for Higher-Order Concurrency Aaron Turon, Derek Dreyer and Lars Birkedal The Bedrock Structured Programming System Adam Chlipala 15-1530 Break 1530-1630 Session 14: Language Design A Practical Theory of Language-Integrated Query James Cheney, Sam Lindley and Philip Wadler Calculating Threesomes, with Blame Ronald Garcia Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism Joshua Dunfield and Neelakantan R. Krishnaswami 1630-17 Break 17-1740 Session 15: Analysis and Optimization Optimizing Abstract Abstract Machines J. Ian Johnson, Nicholas Labich, Matthew Might and David Van Horn Testing Noninterference, Quickly Catalin Hritcu, John Hughes, Benjamin C. Pierce, Antal Spector-Zabusky, Dimitrios Vytiniotis, Arthur Azevedo de Amorim and Leonidas Lampropoulos 1740-18 ICFP 2014 Advert & Closing GENERAL CHAIR Greg Morrisett, Harvard University PROGRAM CHAIR Tarmo Uustalu, Institute of Cybernetics, Tallinn PROGRAM COMMITTEE Thorsten Altenkirch, University of Nottingham Olaf Chitil, University of Kent Silvia Ghilezan, University of Novi Sad Michael Hanus, Christian-Albrechts-Universität zu Kiel Fritz Henglein, University of Copenhagen Mauro Jaskelioff, Universidad Nacional de Rosario Alan Jeffrey, Alcatel-Lucent Bell Labs Shin-ya Katsumata, Kyoto University Shriram Krishnamurthi Brown University John Launchbury, Galois Ryan Newton, Indiana University Sungwoo Park, Pohang University of Science and Technology Sam Staton, University of Cambridge Nikhil Swamy, Microsoft Research, Redmond, WA Dimitrios Vytiniotis, Microsoft Research, Cambridge

1 0

Call for participation IFL 2013
by publicityifl＠gmail.com 16 Aug '13

16 Aug '13

CALL FOR PARTICIPATION 25th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES - IFL 2013 RADBOUD UNIVERSITY NIJMEGEN, THE NETHERLANDS ACM In-Cooperation / ACM SIGPLAN AUGUST 28 - 30 2013 "Landgoed Holthurnsche Hof" http://ifl2013.cs.ru.nl [program available - late registration still open] We are proud to announce that the 25th edition of the IFL series returns to its roots at the Radboud University Nijmegen in the Netherlands. The symposium is held from 28th to 30th of August 2013. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2013 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2013 will use a post-symposium review process to produce the formal proceedings which will be published in the ACM Digital Library. All participants of IFL 2013 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/Resources/Policies/Republication The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. Hence, publications that appear only in the draft proceedings do not count as publication for the ACM SIGPLAN republication policy. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Invited Speaker --------------- Lennart Augustsson, currently employed by the Standard Chartered Bank, well-known for his work on Haskell, parallel Haskell, Cayenne, and Bluespec, is the invited speaker of IFL 2013. The title and abstract of his talk is: "Implementation and Application of Functional Languages - A personal perspective" It is now over 30 years ago since I implemented my first functional language, and over 15 years ago since I wrote my first commercial application. In this talk I will look back to those bygone days and remind you of things that you might have forgotten or never known. The talk will be absolutely free of anything new. Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Thomas Arts, Quviq, Gothenburg, Sweden Andrew Butterfield, Trinity College, Dublin, Ireland Edwin Brady, University of St. Andrews, UK Clemens Grelck, University of Amsterdam, Netherlands Adam Granicz, IntelliFactory, Budapest, Hungary Jeremy Gibbons, University of Oxford, UK Fritz Henglein, University of Copenhagen, Denmark Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (co-chair), University of Oxford, UK Zoltán Horváth, Eötvös Loránd University, Budapest, Hungary Zhenjiang Hu, University of Tokyo, Japan Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Johan Jeuring, University of Utrecht, Netherlands Rita Loogen, University of Marburg, Germany Marco T. Morazán, Seton Hall University, New Jersey, US Dominic Orchard, University of Cambridge, UK Rinus Plasmeijer (chair), Radboud University Nijmegen, Netherlands Tim Sheard, Portland State University, US Sam Tobin-Hochstadt, Northeastern University / Indiana University, US Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Venue ----- The 25th IFL is organized by the Radboud University Nijmegen, Model Based Software Development Department at the Nijmegen Institute for Computing and Information Sciences. The event is held in the Landgoed Holthurnsche Hof, a rural estate in the woodlands surrounding Nijmegen. It can be reached quickly and easily by public transport. Program ------- Wednesday August 28 ------------------- 8:15 registration 8:50 opening 9:00 Marcos Viera First Class Syntax, Semantics, and Their Composition Doaitse Swierstra 9:25 Olivier Danvy Circularity and Lambda Abstraction Peter Thiemann Ian Zerny 9:50 break 10:20 Loic Denuziere Piglets to the rescue Ernesto Rodriguez Adam Granicz 10:45 Simon Fowler Correct and Secure Web Programming using Dependent Types Edwin Brady and Embedded Domain-Specific Languages 11:10 break 11:40 Jennifer Hackett The Under-Performing Unfold: A new approach to optimising Graham Hutton corecursive programs Mauro Jaskelioff 12:05 Laurence Edward Day Compilation á la Carte Graham Hutton 12:30 Artjoms Sinkarovs Functionally Redundant Declarations for Improved Sven-Bodo Scholz Performance Portability 12:55 lunch 14:00 Xavier Clerc OCaml-Java: Typing Java Accesses from OCaml Programs 14:25 Jonathan Protzenko The implementation of the Mezzo type-checker 14:50 break 15:20 Ralf Lämmel The 101haskell chrestomathy Thomas Schmorleiz Andrei Varanovich 15:45 Chide Groenouwe Instant playful access to serious programming for non-programmers with a visual functional programming language 16:10 break 16:40 Arjan Boeijink Supercompiling Haskell to Hardware Philip Hölzenspies Christiaan Baaij Jan Kuper 17:05 Bas van Gijzel Towards a framework for the implementation and verification Henrik Nilson of translations between argumentation models 17:30 end of talks 18:00 dinner 20:00 25th IFL reunion 23:00 Thursday August 29 ------------------ 9:00 Bas Lijnse Supporting Semi-Structured Work using Higher Order Tasks Jan Martin Jansen 9:25 Viktória Zsók A Prototype of CPS Systems 9:50 break 10:20 Majed Al Saeed A Critical Analysis of Parallel Functional Profilers Patrick Maier Phil Trinder Lilia Georgieva 10:45 Vladimir Janjic Using Erlang Skeletons to Parallelise Realistic Christopher Brown Medium-Scale Parallel Programs Kevin Hammond 11:10 break 11:40 Lennart Augustsson Invited talk: Implementation and Application of Functional Languages A personal perspective 12:40 lunch 13:45 - 23:00 Social event: excursion, symposium dinner, Peter Landin award Friday August 30 ---------------- 9:00 Malak Aljabri The Design and Implementation of GUMSMP: Hans-Wolfgang Loidl a Multilevel Parallel Haskell Implementation Phil Trinder 9:25 Henrique Ferreiro Kindergarten Cop: Laura Castro Dynamic Nursery Resizing for Increasing Parallelism in GHC Vladimir Janjic David Castro Kevin Hammond 9:50 break 10:20 Fangyong Tang User-Defined Shape Constraints in SAC Clemens Grelck 10:45 Leaf Petersen Measuring the Haskell Gap Todd Anderson Hai Liu Neal Glew 11:10 break 11:40 Marco T. Morazán Immediate Dominators in Linear Time 12:05 Merijn Verstraaten On Predicting the Impact of Resource Redistribution Sven-Bodo Scholz in Streaming Applications 12:30 IFL 2014 12:40 lunch 14:00 Melinda Tóth Reduction of regression tests for Erlang based on impact analysis István Bozó Zoltán Horváth 14:25 Macías López A DSL for Web Services Automatic Test Data Generation Henrique Ferreiro Laura M. Castro Thomas Arts 14:50 break 15:20 Kanae Tsushima A Weighted Type Error Slicer Kenichi Asai 15:45 Ben Thorner A Type Inference Debugger for ML in Education Kathryn Gray 16:10 break 16:40 Nicolas Wu Structured Sharing for Dynamic Programming 17:05 Clemens Grelck Towards Persistent and Parallel Asynchronous Adaptive Specialisation Heinz Wiesinger for Data-Parallel Array Processing in SAC 17:30 closing

1 0

Haskell Weekly News: Issue 276
by Daniel Santa Cruz 15 Aug '13

15 Aug '13

Welcome to issue 276 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of August 4 to 10, 2013. Quotes of the Week * AndrazBajt: co-worker = producer of work tasks * Brend: I have created a revolutionary AI from first principles! Also, can anyone tell me how to draw coloured dots on the screen? * nejucomo: nejucomo can't resist a good wooly yak. Top Reddit Stories * FP Complete is hiring Haskell contract programmers to work from anywhere Domain: self.haskell, Score: 89, Comments: 17 On Reddit: [1] http://goo.gl/MRqlHd Original: [2] http://goo.gl/MRqlHd * What are some killer libraries and frameworks unique to Haskell? Domain: self.haskell, Score: 87, Comments: 149 On Reddit: [3] http://goo.gl/N3aAqW Original: [4] http://goo.gl/N3aAqW * Cartesian Closed Comic #21: A question will be asked Domain: ro-che.info, Score: 64, Comments: 17 On Reddit: [5] http://goo.gl/Kv5Lwh Original: [6] http://goo.gl/pwLne3 * Haskell for all: Composable streaming folds Domain: haskellforall.com, Score: 56, Comments: 38 On Reddit: [7] http://goo.gl/SIFdvq Original: [8] http://goo.gl/OCpBDf * The Monad.Reader issue 22 is out Domain: themonadreader.wordpress.com, Score: 51, Comments: 3 On Reddit: [9] http://goo.gl/yUim7j Original: [10] http://goo.gl/YE6XAV * Typo – A programming language that runs in Haskell's type system Domain: github.com, Score: 49, Comments: 26 On Reddit: [11] http://goo.gl/yceg83 Original: [12] http://goo.gl/g3ae02 * tasty — a new testing framework (successor to test-framework) Domain: documentup.com, Score: 45, Comments: 33 On Reddit: [13] http://goo.gl/08CufZ Original: [14] http://goo.gl/5GN7bO * Get started with GHC development: a starting point for newcomers Domain: ghc.haskell.org, Score: 39, Comments: 4 On Reddit: [15] http://goo.gl/zfGesW Original: [16] http://goo.gl/23IqSe * John Carmack's talk on function programming, Haskell, Lisp, Scheme and concurrency Domain: youtu.be, Score: 38, Comments: 3 On Reddit: [17] http://goo.gl/1yUTKC Original: [18] http://goo.gl/2K6370 * Daily Haskell Exercise Domain: dailyhaskellexercise.tumblr.com, Score: 37, Comments: 13 On Reddit: [19] http://goo.gl/nwmY9b Original: [20] http://goo.gl/Zyy3Sp * "Teach a kid functional programming and you feed her for a lifetime," says Huffington Post CTO Domain: huffingtonpost.com, Score: 27, Comments: 6 On Reddit: [21] http://goo.gl/8YXXgz Original: [22] http://goo.gl/Mm2xa9 Top StackOverflow Questions * Functors and Applicatives for types of kind (* -> *) -> * votes: 15, answers: 1 Read on SO: [23] http://goo.gl/PQ2VmY * How do I correctly use Control.Exception.catch in Haskell? votes: 15, answers: 3 Read on SO: [24] http://goo.gl/G4Eptv * Safer Handles in Haskell? votes: 13, answers: 1 Read on SO: [25] http://goo.gl/b4gWPa * Typeably casting GADTs votes: 8, answers: 1 Read on SO: [26] http://goo.gl/vcuUxt * Repa performance for planetary simulation votes: 7, answers: 0 Read on SO: [27] http://goo.gl/VqggZo * Transforming functions of type `a -> b` into those of type `String -> String` in Haskell votes: 7, answers: 2 Read on SO: [28] http://goo.gl/VzejZ0 * Resolving overlapping instances in external library votes: 6, answers: 1 Read on SO: [29] http://goo.gl/f7QDdu * Cabal - Expose all modules while building library votes: 6, answers: 1 Read on SO: [30] http://goo.gl/C8lKJB * What are Alternative's “some” and “many” useful for? votes: 6, answers: 4 Read on SO: [31] http://goo.gl/o4lLGy Until next time, [32]+Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/1jzatv/fp_complete_is_hiring_haske… 2. http://www.reddit.com/r/haskell/comments/1jzatv/fp_complete_is_hiring_haske… 3. http://www.reddit.com/r/haskell/comments/1k3fq7/what_are_some_killer_librar… 4. http://www.reddit.com/r/haskell/comments/1k3fq7/what_are_some_killer_librar… 5. http://ro-che.info/ccc/21.html 6. http://www.reddit.com/r/haskell/comments/1jp265/cartesian_closed_comic_21_a… 7. http://www.haskellforall.com/2013/08/composable-streaming-folds.html 8. http://www.reddit.com/r/haskell/comments/1jo9gm/haskell_for_all_composable_… 9. http://themonadreader.wordpress.com/2013/08/06/issue-22/ 10. http://www.reddit.com/r/haskell/comments/1jvhj7/the_monadreader_issue_22_is… 11. https://github.com/seliopou/typo 12. http://www.reddit.com/r/haskell/comments/1jwp0s/typo_a_programming_language… 13. http://documentup.com/feuerbach/tasty 14. http://www.reddit.com/r/haskell/comments/1jr8lb/tasty_a_new_testing_framewo… 15. http://ghc.haskell.org/trac/ghc/wiki/Newcomers 16. http://www.reddit.com/r/haskell/comments/1k0uk9/get_started_with_ghc_develo… 17. http://youtu.be/1PhArSujR_A?t=2m5s 18. http://www.reddit.com/r/haskell/comments/1k2w93/john_carmacks_talk_on_funct… 19. http://dailyhaskellexercise.tumblr.com/ 20. http://www.reddit.com/r/haskell/comments/1juqez/daily_haskell_exercise/ 21. http://www.huffingtonpost.com/john-pavley/teach-a-kid-functional-pr_b_36668… 22. http://www.reddit.com/r/haskell/comments/1jr0og/teach_a_kid_functional_prog… 23. http://stackoverflow.com/questions/18052158/functors-and-applicatives-for-t… 24. http://stackoverflow.com/questions/18052619/how-do-i-correctly-use-control-… 25. http://stackoverflow.com/questions/18135648/safer-handles-in-haskell 26. http://stackoverflow.com/questions/18109654/typeably-casting-gadts 27. http://stackoverflow.com/questions/18099878/repa-performance-for-planetary-… 28. http://stackoverflow.com/questions/18106170/transforming-functions-of-type-… 29. http://stackoverflow.com/questions/18071439/resolving-overlapping-instances… 30. http://stackoverflow.com/questions/18084265/cabal-expose-all-modules-while-… 31. http://stackoverflow.com/questions/18108608/what-are-alternatives-some-and-… 32. https://plus.google.com/105107667630152149014/about

1 0

Call for Participation: Functional High-Performance Computing (FHPC 2013)
by Jost Berthold 14 Aug '13

14 Aug '13

===================================================================== CALL FOR PARTICIPATION FHPC 2013 The 2nd ACM SIGPLAN Workshop on Functional High-Performance Computing Boston, Massachusetts September 23, 2013 http://www.hiperfit.dk/fhpc13.html Early Registration Deadline: August 22, 2013 Registration: https://regmaster3.com/2013conf/ICFP13/register.php Co-located with the International Conference on Functional Programming (ICFP 2013) ===================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where large-scale computations arise naturally and high performance is essential. Modern highly parallel systems, such as manycore multi-processor systems, large-scale compute clusters, and graphics accelerators (GPGPUs) as well as reconfigurable hardware (FPGAs), are complex to program, and declarative languages present a nice sweet spot between expressiveness and efficiency when programming such systems, to address their inherent complexity and to reconcile execution performance with programming productivity. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as highly transparent, maintainable, and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. Papers and Invited Talks: ========================= The accepted papers cover different topics related to FHPC: declarative parallel programming models, optimising compilation of declarative languages, libraries and bespoke runtime management which take advantage of declarative constructs for better performance and productivity. FHPC'13 features two invited talks and one panel discussion. In the morning session, Matthew Fluet from Rochester Institute of Technology will provide an overview of the Manticore project. In the late afternoon session, Manuel Chakravarty from the University of New South Wales will present his work in data-parallel computing, Data-Parallel Haskell and Accelerate. The topic of data-parallelism and GPU computing will be further deepened in a panel discussion. Schedule: ========= 9:00 RUNTIME TECHNIQUES FOR PARALLEL FUNCTIONAL PROGRAMMING o Chairs' welcome o Matthew Fluet. The Manticore Project (invited talk) o Sylvain Henry. ViperVM: a Runtime System for Parallel Functional High-Performance Computing on Heterogeneous Architectures 11:00 PARALLEL PROGRAMMING MODELS AND APPLICATION CLASSES o Frederik M. Madsen and Andrzej Filinski. Towards a Streaming Model for Nested Data Parallelism o Qi Wang, Meixian Chen, Yu Liu and Zhenjiang Hu. Towards Systematic Parallel Programming of Graph Problems via Tree Decomposition and Tree Parallelism o Josef Svenningsson, Joel Svensson and Mary Sheeran. Counting and Occurrence sort for GPUs using an Embedded Language 13:30 OPTIMIZING COMPILATION OF FUNCTIONAL PROGRAMS o Troels Henriksen and Cosmin E. Oancea. A T2 Graph-Reduction Approach To Fusion o Artjoms Sinkarovs and Sven-Bodo Scholz. Sematics-Preserving Data Layout Transformations for Improved Vectorisation 14:30 LIBRARIES AND RUNTIME TECHNIQUES FOR PARALLEL FUNCTIONAL PROGRAMMING o Lindsey Kuper and Ryan R. Newton. LVars: Lattice-based Data Structures for Deterministic Parallelism o Mauro Blanco, Pablo Perdomo, Pablo Ezzatti, Alberto Pardo and Marcos Viera. Towards a functional run-time for dense NLA domain 16:00 FUNCTIONAL DATA PARALLELISM o Manuel Chakravarty. Data Parallelism in Haskell (invited talk) o Panel discussion: Data Parallelism and GPU Computing Workshop organisation ===================== Programme Committee: Umut Acar (co-chair), Carnegie Mellon U., PA, USA Arvind, MIT, MA, USA Jost Berthold (co-chair), U. of Copenhagen, Denmark Guy Blelloch, Carnegie Mellon U., PA, USA Hassan Chafi, Oracle Labs, CA, USA Dan Spoonhower, Google, CA, USA Sergei Gorlatch, U. Münster, Germany Clemens Grelck, U. of Amsterdam, Netherlands Vinod Grover, NVidia, USA Torsten Grust, U.Tübingen, Germany Zhenjiang Hu, National Inst. of Informatics, Tokyo, Japan Gabriele Keller, U.New South Wales, Sydney, Australia Jens Palsberg, U.California, CA, USA Leaf Peterson, Intel, USA Mike Rainey, MPI-SWS,Kaiserslautern, Germany Suresh Jaganathan, Purdue U., USA Sven-Bodo Scholz, Heriot-Watt U., Edinburgh, UK Guy Steele, Oracle Labs, Burlington, MA, USA Yaron Minsky, Jane Street Capital, NY, USA General Chairs: Clemens Grelck, University of Amsterdam, NL Fritz Henglein, University of Copenhagen, DK

1 0

Call for participation: CUFP 2013
by Simon Marlow 13 Aug '13

13 Aug '13

Commercial Users of Functional Programming (CUFP) 2013 at ICFP 2013; Boston, MA, Sep 22-24. Call for Participation Functional programming has been at the forefront of a new generation of programming technologies: Companies employing functional programming use it to enable more effective, robust, and flexible software development. The annual CUFP workshop is designed to serve the growing community of commercial users of functional programming: Practitioners meet and collaborate; language designers and users can share ideas about the future of their languages; experts share their expertise on practical functional programming. CUFP 2013 begins with a day of talks about industrial applications of functional programming, followed by two days of tutorials by top-notch language experts including advanced tutorials on special topics. More information about CUFP 2013 is available on the CUFP web site at http://cufp.org/conference/schedule Registration is available at: https://regmaster3.com/2013conf/ICFP13/register.php Note that early-registration discounts end August 22. TALKS, SEPTEMBER 22 Keynote: "Small Talk" Dave Thomas, TBA. Analyzing PHP statically (Julien Verlaguet, Facebook) Introducing Erlang to OpenX (Anthony Molinaro, OpenX) Redesigning the Computer for Security (Tom Hawkins, BAE Systems) End to end Reactive Programming (Jafar Husain, Netflix) Medical Device Automation using Message-Passing Concurrency in Scheme (Vishesh Panchal & BobBurger, Beckman Coulter Inc.) Enabling Microservice Architectures with Scala (Kevin Scaldeferri, Gilt Groupe) Functional Infrastructures (Antoni Batchelli, PalletOps) Realtime MapReduce at Twitter (Sam Ritchie, Twitter Inc) Functional Probabilistic Programming (Avi Pfeffer, Charles River Analytics) Building a commercial development platform Haskell, an experience report. (Gregg Lebovitz, FP Complete) Common Pitfalls of Functional Programming and How to Avoid Them: A Mobile Gaming Platform Case Study (Yasuaki Takebe, GREE, Inc) Building scalable, high-availability distributed systems in Haskell (Jeff Epstein, Parallel Scientific) Functional Reporting (Edward Kmett, S&P Capital IQ) Enterprise Appointment Scheduling with Haskell (Ryan Trinkle, skedge.me) Programming Map/Reduce in Mathematica (Paul-Jean Letourneau, Wolfram) TUTORIALS, SEPTEMBER 23 T1: Haskell Day 1 (Andres Löh) T2 - OCaml tutorial (Yaron Minsky & Anil Madhavapeddy) T3 - Erlang 101 - Your introduction to Concurrency and Multi-core (Francesco Cesarini & Simon Thompson) T4 - (Systematic generation of optimal code with MetaOCaml) Oleg Kiselyov T5 - (Erlang Web frameworks) Steve Vinoski TUTORIALS, SEPTEMBER 24 T6 - Haskell Day 2 (Simon Marlow) T7 - Clojure tutorial (Luke Vander Hart) T8 - The Seductions of Scala (Dean Wampler) T9 - Bending Clojure to your will: Macros and Domain Specific Languages (Leonardo Borges) T10 - Scalding - The Scala Tool for Data Analytics in Hadoop Systems (Dean Wampler)

1 0

CFP: PLPV 2014, Programming Languages meets Program Verification
by Nils Anders Danielsson 12 Aug '13

12 Aug '13

Call for papers: PLPV 2014 Programming Languages meets Program Verification San Diego, CA, USA Co-located with POPL 2014 http://www.cse.chalmers.se/~nad/plpv-2014/ Overview -------- The goal of PLPV is to foster and stimulate research at the intersection of programming languages and program verification, by bringing together experts from diverse areas like types, contracts, interactive theorem proving, model checking and program analysis. Work in this area typically attempts to reduce the burden of program verification by taking advantage of particular semantic or structural properties of the programming language. One example is provided by dependently typed programming languages, which make it possible to specify and check rich specifications using the languages' type systems. Another example is provided by extended static checking systems, which incorporate contracts with either static or dynamic contract checking. We invite submissions on all aspects, both theoretical and practical, of the integration of programming language and program verification technology. To encourage interaction between different communities, we seek a broad scope for PLPV. In particular, submissions may have diverse foundations for verification (based on types, Hoare-logic, abstract interpretation, etc.), target different kinds of programming languages (functional, imperative, object-oriented, etc.), and apply to diverse kinds of program properties (data structure invariants, security properties, temporal protocols, resource constraints, etc.). Important dates --------------- * Submission deadline: 2013-10-09T24:00-12 (midnight at the end of October 9, 2013, UTC-12) * Author notification: November 1, 2013 * Camera-ready papers due: November 17, 2013 * Workshop: January 21, 2014 Submissions ----------- For details about how to format submissions, where to send them, etc., see http://www.cse.chalmers.se/~nad/plpv-2014/call-for-papers.html. Programme committee ------------------- * Adam Chlipala, MIT * Nils Anders Danielsson, University of Gothenburg (co-chair) * Manuel Fähndrich, Microsoft Research * Philipp Haller, Typesafe * Bart Jacobs, Katholieke Universiteit Leuven (co-chair) * Chantal Keller, Aarhus University * Neelakantan R. Krishnaswami, Max Planck Institute for Software Systems * Andres Löh, Well-Typed LLP * Magnus O. Myreen, University of Cambridge * Alexander J. Summers, ETH Zurich

1 0

Call for Participation: Kiel Declarative Programming Days 2013
by mh＠informatik.uni-kiel.de 12 Aug '13

12 Aug '13

************************** * Call for Participation * ************************** Kiel Declarative Programming Days 2013 September 11-13, 2013 http://www-ps.informatik.uni-kiel.de/kdpd2013/ -------------------------------------------------------------------- Early registration (and hotel reservation) deadline: August 15, 2013 -------------------------------------------------------------------- The Kiel Declarative Programming Days 2013 unifies the following events: * 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013, http://www.dcc.fc.up.pt/INAP-2013/) * 22nd International Workshop on Functional and (Constraint) Logic Programming (WFLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/) * 27th Workshop on Logic Programming (WLP 2013, http://www-ps.informatik.uni-kiel.de/wflp2013/) All events will be jointly organized. Look at the web sites about detailed registration, accommodation, and travel information. ====================================================================== TECHNICAL PROGRAM The technical program includes: INVITED TALK: Tom Schrijvers (University of Ghent): Delimited Continuations for Prolog: An Overview ACCEPTED PAPERS: James Gil de Lamadrid: FOBS-X: An Extensible Hybrid Functional-Object-Oriented Scripting Language Marcus Ermler: Towards a Verification Framework for Haskell by Combining Graph Transformation Units and SAT Solving Nikita Danilenko: And... Action! - Monoid Acts and (Pre)orders Chiaki Sakama: Debate Games in Logic Programming Alexander Bau and Johannes Waldmann: Propositional Encoding of Constraints over Tree-Shaped Data Marcus Ermler: A SAT-Based Graph Rewriting and Verification Tool implemented in Haskell Carlos Alberto Martínez-Angeles, Ines Dutra, Vítor Santos-Costa and Jorge Buenabad-Chavez: A Datalog Engine for GPUs Mingmin Chen, Shizhuo Yu, Nico Franz, Shawn Bowers and Bertram Ludascher: uler/X: A Toolkit for Logic-based Taxonomy Integration Jomu George Mani Paret and Otmane Ait Mohamed: Coverage Driven Test Generation and Consistency Algorithm Alexander Šimko: Extension of Gelfond-Lifschitz Reduction for Preferred Answer Sets: Preliminary Report Christoph Beierle and Udo Lelitko: On an Approach to Implementing Exact Real Arithmetic in Curry Claus Zinn: Heuristic Search Over Program Transformations Baltasar Trancón Y Widemann and Markus Lepper: Some Experiments on Light-Weight Object-Functional-Logic Programming in Java with Paisley Ella Albrecht, Patrick Krümpelmann and Gabriele Kern-Isberner: Construction of Explanation Graphs from Extended Dependency Graphs for Answer Set Programs Mário Abrantes and Luís Moniz Pereira: An Abductive Paraconsistent Semantics -- MHp Benny Höckner, Petra Hofstedt, Peter Sauer, Thilo Voertler and Thomas Hinze: Constraint-based Approach for an Early Inspection of the Feasibility of Cyber Physical Systems Thomas Eiter, Michael Fink, Thomas Krennwallner and Christoph Redl: HEX-Programs with Existential Quantification Guohua Liu, Tomi Janhunen and Ilkka Niemela: Introducing Real Variables and MIP Objective Functions to Answer Set Programming Mikus Vanags, Arturs Licis and Janis Justs: Meta-set calculus as mathematical basis for creating abstract, structured data store querying technology Gerald Berger and Hans Tompits: On Axiomatic Rejection for the Description Logic ALC Rana Awada, Pablo Barcelo and Iluju Kiringa: Sharing and Exchanging Data Ludwig Ostermayer, Geng Sun and Dietmar Seipel: Simplifying Rules Creation Using Domain Specific Languages in Drools Danny Munera, Daniel Diaz and Salvador Abreu: Towards Parallel Constraint-Based Local Search with the X10 Language ---------------------------------------------------------------------- CONTACT Prof. Michael Hanus Institut fuer Informatik Christian-Albrechts-Universitaet zu Kiel D-24098 Kiel, Germany Phone: ++49-431-880-7271 or -7270 (Secr.) Fax : ++49-431-880-7613 Email: mh(a)informatik.uni-kiel.de ----------------------------------------------------------------------

1 0

Re: [Haskell] ANNOUNCE : heukarya, genetic programming library in Haskell
by He-chien Tsai 12 Aug '13

12 Aug '13

A example with comment is on the way

1 0

Postdoc Position at OSU on Variations to Support Exploratory Programming
by Martin Erwig 09 Aug '13

09 Aug '13

A position for a postdoctoral scholar is available in the School of Electrical Engineering and Computer Science at Oregon State University. The individual working in this position will be conducting and leading research in the area of language design and domain-specific languages. Specific duties will include research to support exploratory programming through variations. The position is supported by the National Science Foundation under grant number IIS-1314384. The specific goals of the research project are spelled out here: ExploratoryProgramming.org www.nsf.gov/awardsearch/showAward.do?AwardNumber=1314384 Some background information about the underlying theoretical framework of the choice calculus can be found here: ChoiceCalculus.org The successful candidate must demonstrate strong communication abilities and is expected to coordinate research with other members of the multi-university research team as well as help supervise junior members of the programming language group. Qualifications: * Education: Ph.D. in computer science * Experience: Strong background in programming language theory and functional programming * Skills: Leadership skills, the ability to coordinate research activities, excellent oral and written communication skills Availability: The position can be filled immediately and is renewable on an annual basis for a total of up to three years. Application: To apply, please email your CV to: erwig(a)eecs.oregonstate.edu For more information about the postdoc scholar appointment please see: gradschool.oregonstate.edu/postdocs

1 0