From m.konecny at aston.ac.uk Wed Jul 2 10:50:14 2014 From: m.konecny at aston.ac.uk (Michal =?utf-8?B?S29uZcSNbsO9?=) Date: Wed, 2 Jul 2014 11:50:14 +0100 Subject: [Haskell] PhD studentship on interval computation in Haskell Message-ID: <1557331.lJacbyWpk4@mik> ------------------------------------------------- PhD studentship - Interval Computation in Haskell ------------------------------------------------- * Applicants should have a strong background in real analysis and functional programming. * The closing date for applications is 18th July 2014. * The project will be supervised by Michal Kone?n?, Aston University. * The student will receive a 3-year studentship of ?15,500/year. * UK/EU student's fee is covered, non-EU student's fee is ?10,914 in 2014/2015. * The student will act as a teaching assistant for a distance learning course approx. 7h/week. * For more information, use the following links: o Description of the potential project topics[1] o AERN - a Haskell interval computation library[2] o Supervisor's home page[3] o Department research home page[4] o Details of the studentship and links to application forms[5] (The above advert is also available at http://duck.aston.ac.uk/konecnym/studentship-201406-advert) -------- [1] http://www.aston.ac.uk/EasySiteWeb/GatewayLink.aspx?alId=186698 [2] http://michalkonecny.github.io/aern/_site/index.html [3] http://www.aston.ac.uk/eas/staff/a-z/dr-michal-konecny/ [4] http://www.aston.ac.uk/eas/about-eas/academic-groups/computer-science/research/ [5] http://duck.aston.ac.uk/konecnym/studentship-201406.pdf -------------- next part -------------- A non-text attachment was scrubbed... Name: signature.asc Type: application/pgp-signature Size: 198 bytes Desc: This is a digitally signed message part. URL: From bruno at ropas.snu.ac.kr Wed Jul 2 14:15:57 2014 From: bruno at ropas.snu.ac.kr (Bruno Oliveira) Date: Wed, 2 Jul 2014 22:15:57 +0800 Subject: [Haskell] Haskell-related PhD Scholarships in Hong Kong In-Reply-To: <1557331.lJacbyWpk4@mik> References: <1557331.lJacbyWpk4@mik> Message-ID: <74E59C90-55CF-4E1B-B6A4-4B06DC7FA153@ropas.snu.ac.kr> The University of Hong Kong has a special early-recruitment program for graduate studies starting next year (September 2015). Anyone interested in coming to Hong Kong and doing a PhD in the area of Programming Languages and Functional Programming is very welcome to apply! A strong Haskell background is definitely a plus, but experience with other Functional Languages and/or Theorem Provers (Scala, ML, OCaml, Agda, Idris, Coq, Isabelle ?) is equally valued. There are a number of projects available on the areas of compiler implementation, programming language design, dependent types, property-based testing (think Quickcheck) and various other FP-related topics. For more details please contact me (bruno at cs.hku.hk). General information about HKU?s early recruitment program can be found here: http://www.cs.hku.hk/programme/mphil-phd/admission_2015.jsp Some information about my research can be found here: http://i.cs.hku.hk/~bruno/ Best Regards, Bruno Oliveira From dstcruz at gmail.com Thu Jul 3 05:59:23 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 2 Jul 2014 23:59:23 -0600 Subject: [Haskell] Haskell Weekly News: Issue 298 Message-ID: Welcome to issue 298 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from June 15 to 28, 2014 Quotes of the Week * Kinnison * imagines a radio station playing only things like 'Life tru a Lens', stuff by 'Dire States' or 'Monadonna' Top Reddit Stories * Today I published an introductory book on Haskell Data Analysis Domain: haskelldata.com, Score: 99, Comments: 26 Original: [1] http://goo.gl/R2kRFu On Reddit: [2] http://goo.gl/Ka0oP5 * Backpack: An ML-like module system for Haskell Domain: plv.mpi-sws.org, Score: 76, Comments: 44 Original: [3] http://goo.gl/7Zkxbg On Reddit: [4] http://goo.gl/78H37f * Cgrep, a context-aware grep for source code. Domain: awgn.github.io, Score: 67, Comments: 13 Original: [5] http://goo.gl/q1VdEA On Reddit: [6] http://goo.gl/2NNTrO * Teenage Haskell Domain: twdkz.wordpress.com, Score: 63, Comments: 7 Original: [7] http://goo.gl/cvJ0ap On Reddit: [8] http://goo.gl/aISHlG * GHC 7.10 gains -XBinaryLiterals language syntax extensions Domain: github.com, Score: 63, Comments: 14 Original: [9] http://goo.gl/qfWvAg On Reddit: [10] http://goo.gl/NOVgme * Haskelier - Haskell for the Advanced Layman Domain: haskelier.tumblr.com, Score: 59, Comments: 26 Original: [11] http://goo.gl/pLsRB1 On Reddit: [12] http://goo.gl/5HBSWD * Barely Functional: Writing a Real Program in Haskell Domain: ben.kirw.in, Score: 57, Comments: 36 Original: [13] http://goo.gl/4yWLuL On Reddit: [14] http://goo.gl/B1LX8f * hmatrix 0.16 now BSD3 and with static dimension checking Domain: github.com, Score: 51, Comments: 10 Original: [15] http://goo.gl/C5zKzk On Reddit: [16] http://goo.gl/A94AkD * Formatting: type-safe printf-like library by chrisdone Domain: hackage.haskell.org, Score: 51, Comments: 24 Original: [17] http://goo.gl/DHM0Yn On Reddit: [18] http://goo.gl/zUQN02 * Haskell 2014 accepted papers, with links (pull requests welcome) Domain: github.com, Score: 50, Comments: 5 Original: [19] http://goo.gl/B2f434 On Reddit: [20] http://goo.gl/XSmJGo * Real World Haskell - Outdated Parts? Domain: self.haskell, Score: 50, Comments: 12 Original: [21] http://goo.gl/5YhIOT On Reddit: [22] http://goo.gl/5YhIOT * I'm trying my hardest to learn this language and only get more and more discouraged. Domain: self.haskell, Score: 48, Comments: 111 Original: [23] http://goo.gl/9vuPBe On Reddit: [24] http://goo.gl/9vuPBe * Using f-algebras to produce a statically typed functional programming language Domain: burz.github.io, Score: 47, Comments: 19 Original: [25] http://goo.gl/9YCz4k On Reddit: [26] http://goo.gl/DvWBPS * 'ghc-make' released Domain: neilmitchell.blogspot.de, Score: 47, Comments: 19 Original: [27] http://goo.gl/JlMS1a On Reddit: [28] http://goo.gl/kO2FQP * A simple alternative to De Bruijn indexing, from ICFP 2013 Domain: pchiusano.io, Score: 46, Comments: 24 Original: [29] http://goo.gl/7PBIM2 On Reddit: [30] http://goo.gl/PGmQ6W * Haskoin: A Haskell implementation of the Bitcoin protocol. Domain: github.com, Score: 44, Comments: 0 Original: [31] http://goo.gl/n0eCEI On Reddit: [32] http://goo.gl/bvsE24 * What is the state of "The JavaScript Problem"? What is the currently preferred way to solve in a real world application? Domain: self.haskell, Score: 42, Comments: 55 Original: [33] http://goo.gl/dIww4i On Reddit: [34] http://goo.gl/dIww4i * ANNOUNCE: STM-Containers. A hash map and hash set for STM Domain: hackage.haskell.org, Score: 41, Comments: 13 Original: [35] http://goo.gl/6nuWAc On Reddit: [36] http://goo.gl/rAzIYr Top StackOverflow Questions * Why does flooring infinity does not throw some error? votes: 14, answers: 1 Read on SO: [37] http://goo.gl/f7gUB8 * How long can the name of a type constructor be? votes: 12, answers: 1 Read on SO: [38] http://goo.gl/mGiblp * Difference between $ and () votes: 11, answers: 5 Read on SO: [39] http://goo.gl/lTB24e * Need advice on optimising Haskell data processing votes: 11, answers: 3 Read on SO: [40] http://goo.gl/NnEqgn * Reconciling lens usage with database access votes: 11, answers: 1 Read on SO: [41] http://goo.gl/Zczjjf * Why constraints on data are a bad thing? votes: 11, answers: 3 Read on SO: [42] http://goo.gl/l0WXtP * Can I use template haskell to define missing functions? votes: 10, answers: 2 Read on SO: [43] http://goo.gl/AFFS2T * Is there a reason we can't populate types with DataKinds? votes: 10, answers: 2 Read on SO: [44] http://goo.gl/1gpZej * Why is a built-in function applied to too few arguments considered to be in weak head normal form? votes: 10, answers: 2 Read on SO: [45] http://goo.gl/6iFG8a Until next time, [46]+Daniel Santa Cruz References 1. http://haskelldata.com/ 2. http://www.reddit.com/r/haskell/comments/296l80/today_i_published_an_introductory_book_on_haskell/ 3. http://plv.mpi-sws.org/backpack/ 4. http://www.reddit.com/r/haskell/comments/28v6c9/backpack_an_mllike_module_system_for_haskell/ 5. http://awgn.github.io/cgrep/ 6. http://www.reddit.com/r/haskell/comments/28moo0/cgrep_a_contextaware_grep_for_source_code/ 7. http://twdkz.wordpress.com/2014/06/26/teenage-haskell/ 8. http://www.reddit.com/r/haskell/comments/29abyz/teenage_haskell/ 9. https://github.com/ghc/ghc/commit/1c0b5fdc9f2b6ea8166cc565383d4cd20432343c 10. http://www.reddit.com/r/haskell/comments/29b2jj/ghc_710_gains_xbinaryliterals_language_syntax/ 11. http://haskelier.tumblr.com/ 12. http://www.reddit.com/r/haskell/comments/28d7ma/haskelier_haskell_for_the_advanced_layman/ 13. http://ben.kirw.in/2014/06/24/barely-functional-1-rlp/ 14. http://www.reddit.com/r/haskell/comments/28zwoc/barely_functional_writing_a_real_program_in/ 15. https://github.com/albertoruiz/hmatrix 16. http://www.reddit.com/r/haskell/comments/28peug/hmatrix_016_now_bsd3_and_with_static_dimension/ 17. http://hackage.haskell.org/package/formatting 18. http://www.reddit.com/r/haskell/comments/291wel/formatting_typesafe_printflike_library_by/ 19. https://github.com/yallop/haskell2014-papers 20. http://www.reddit.com/r/haskell/comments/28yu1f/haskell_2014_accepted_papers_with_links_pull/ 21. http://www.reddit.com/r/haskell/comments/2938yb/real_world_haskell_outdated_parts/ 22. http://www.reddit.com/r/haskell/comments/2938yb/real_world_haskell_outdated_parts/ 23. http://www.reddit.com/r/haskell/comments/288egd/im_trying_my_hardest_to_learn_this_language_and/ 24. http://www.reddit.com/r/haskell/comments/288egd/im_trying_my_hardest_to_learn_this_language_and/ 25. http://burz.github.io/2014/06/15/feval.html 26. http://www.reddit.com/r/haskell/comments/28rbwr/using_falgebras_to_produce_a_statically_typed/ 27. http://neilmitchell.blogspot.de/2014/06/announcing-ghc-make.html 28. http://www.reddit.com/r/haskell/comments/28tttf/ghcmake_released/ 29. http://pchiusano.io/2014-06-20/simple-debruijn-alternative.html 30. http://www.reddit.com/r/haskell/comments/28vfd0/a_simple_alternative_to_de_bruijn_indexing_from/ 31. https://github.com/haskoin/haskoin 32. http://www.reddit.com/r/haskell/comments/28y454/haskoin_a_haskell_implementation_of_the_bitcoin/ 33. http://www.reddit.com/r/haskell/comments/28o7my/what_is_the_state_of_the_javascript_problem_what/ 34. http://www.reddit.com/r/haskell/comments/28o7my/what_is_the_state_of_the_javascript_problem_what/ 35. http://hackage.haskell.org/package/stm-containers 36. http://www.reddit.com/r/haskell/comments/295lbr/announce_stmcontainers_a_hash_map_and_hash_set/ 37. http://stackoverflow.com/questions/24338673/why-does-flooring-infinity-does-not-throw-some-error 38. http://stackoverflow.com/questions/24335869/how-long-can-the-name-of-a-type-constructor-be 39. http://stackoverflow.com/questions/24271129/difference-between-and 40. http://stackoverflow.com/questions/24278006/need-advice-on-optimising-haskell-data-processing 41. http://stackoverflow.com/questions/24462070/reconciling-lens-usage-with-database-access 42. http://stackoverflow.com/questions/24465586/why-constraints-on-data-are-a-bad-thing 43. http://stackoverflow.com/questions/24233346/can-i-use-template-haskell-to-define-missing-functions 44. http://stackoverflow.com/questions/24439618/is-there-a-reason-we-cant-populate-types-with-datakinds 45. http://stackoverflow.com/questions/24447324/why-is-a-built-in-function-applied-to-too-few-arguments-considered-to-be-in-weak 46. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From brucker at spamfence.net Thu Jul 3 15:15:19 2014 From: brucker at spamfence.net (Achim D. Brucker) Date: Thu, 3 Jul 2014 17:15:19 +0200 Subject: [Haskell] Final Call for Papers: OCL 2014 Submissions Due in One Week Message-ID: <20140703151519.GA27822@fujikawa.home.brucker.ch> (Apologies for duplicates) CALL FOR PAPERS 14th International Workshop on OCL and Textual Modeling Applications and Case Studies (OCL 2014) Co-located with ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems (MODELS 2014) September 28-30 (tbc), 2014, VALENCIA, SPAIN http://www.software.imdea.org/OCL2014/ Modeling started out with UML and its precursors as a graphical notation. Such visual representations enable direct intuitive capturing of reality, but some of their features are difficult to formalize and lack the level of precision required to create complete and unambiguous specifications. Limitations of the graphical notations encouraged the development of text-based modeling languages that either integrate with or replace graphical notations for modeling. Typical examples of such languages are OCL, textual MOF, Epsilon, and Alloy. Textual modeling languages have their roots in formal language paradigms like logic, programming and databases. The goal of this workshop is create a forum where researchers and practitioners interested in building models using OCL or other kinds of textual languages can directly interact, report advances, share results, identify tools for language development, and discuss appropriate standards. In particular, the workshop will encourage discussions for achieving synergy from different modeling language concepts and modeling language use. The close interaction will enable researchers and practitioners to identify common interests and options for potential cooperation. Topics of interest include (but are not limited to) =================================================== - Mappings between textual modeling languages and other languages/formalisms - Algorithms, evaluation strategies and optimizations in the context of textual modeling languages for -- validation, verification, and testing, -- model transformation and code generation, -- metamodeling and DSLs, and -- query and constraint specifications - Alternative graphical/textual notations for textual modeling languages - Evolution, transformation and simplification of textual modeling expressions - Libraries, templates and patterns for textual modeling languages - Complexity results for textual modeling languages - Quality models and benchmarks for comparing and evaluating textual modeling tools and algorithms - Successful applications of textual modeling languages - Case studies on industrial applications of textual modeling languages - Experience reports -- usage of textual modeling languages and tools in complex domains, -- usability of textual modeling languages and tools for end-users - Empirical studies about the benefits and drawbacks of textual modeling languages - Innovative textual modeling tools - Comparison, evaluation and integration of modeling languages - Correlation between modeling languages and modeling tasks This year, we particularly encourage submissions describing applications and case studies of textual modeling as well as test suites and benchmark collections for evaluating textual modeling tools. Venue ===== The workshop will be organized as a part of MODELS 2014 Conference in Valencia, Spain. It continues the series of OCL workshops held at UML/MODELS conferences: York (2000), Toronto (2001), San Francisco (2003), Lisbon (2004), Montego Bay (2005), Genova (2006), Nashville (2007), Toulouse (2008), Denver (2009), Oslo (2010), Zurich (2011, at the TOOLs conference), 2012 in Innsbruck, and 2013 in Miami. Similar to its predecessors, the workshop addresses both people from academia and industry. The aim is to provide a forum for addressing integration of OCL and other textual modeling languages, as well as tools for textual modeling, and for disseminating good practice and discussing the new requirements for textual modeling. Workshop Format =============== The workshop will include short (about 15 min) presentations, parallel sessions of working groups, and sum-up discussions. Submissions =========== Two types of papers will be considered: * short papers (6 pages) and * full papers (10 pages) in LNCS format. Submissions should be uploaded to EasyChair (https://www.easychair.org/conferences/?conf=ocl2014). The program committee will review the submissions (minimum 2 reviews per paper, usually 3 reviews) and select papers according to their relevance and interest for discussions that will take place at the workshop. Accepted papers will be published online in a pre-conference edition of CEUR (http://www.ceur-ws.org). Authors of selected papers will be invited to submit an extended version of their workshop paper to a special issue of the Electronic Communications of the EASST (http://journal.ub.tu-berlin.de/eceasst) Important Dates =============== Submission of papers: July 11, 2014 Notification: August 8, 2014 Workshop date: one day during September 28-30, 2014 Organizers ========== Achim D. Brucker, SAP AG, Germany Carolina Dania, IMDEA Software Institute, Madrid, Spain Geri Georg, Colorado State University, Fort Collins, Colorado, USA Martin Gogolla, University of Bremen, Germany Programme Committee (partly confirmation pending) =================== Michael Altenhofen, SAP AG, Germany Thomas Baar, University of Applied Sciences Berlin, Germany Mira Balaban, Ben-Gurion University of the Negev, Israel Tricia Balfe, Nomos Software, Ireland Fabian Buettner, Ecole des Mines de Nantes, France Achim D. Brucker, SAP AG, Germany Jordi Cabot, INRIA-Ecole des Mines de Nantes, France Yoonsik Cheon, University of Texas, USA Dan Chiorean, Babes-Bolyai University, Romania Robert Clariso, Universitat Oberta de Catalunya, Spain Tony Clark, Middlesex University, UK Manuel Clavel, IMDEA Software Institute, Madrid, Spain Carolina Dania, IMDEA Software Institute, Madrid, Spain Birgit Demuth, Technische Universitat Dresden, Germany Marina Egea, Atos Research, Madrid, Spain Geri Georg, Colorado State University, Fort Collins, Colorado, USA Martin Gogolla, University of Bremen, Germany Pieter Van Gorp, Eindhoven University of Technology, The Netherlands Heinrich Hussmann, LMU Munchen, Germany Tihamer Levendovszky, Vanderbilt University, USA Shahar Maoz, Tel Aviv University, Israel Istvan Rath, Budapest University of Technology and Economics, Hungary Bernhard Rumpe, RWTH Aachen, Germany Shane Sendall, Snowie Research SA, Switzerland Michael Wahler, ABB Switzerland Ltd Corporate Research, Switzerland Claas Wilke, Technische Universitat Dresden, Germany Edward Willink, Willink Transformations Ltd., UK Burkhart Wolff, Univ Paris-Sud, France Steffen Zschaler, King?s College, London, UK -- Dr. Achim D. Brucker, SAP AG, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch/ From jv at informatik.uni-bonn.de Fri Jul 4 14:11:26 2014 From: jv at informatik.uni-bonn.de (Janis Voigtlaender) Date: Fri, 04 Jul 2014 16:11:26 +0200 Subject: [Haskell] HART 2014 - deadline extended Message-ID: <53B6B60E.5070501@informatik.uni-bonn.de> We extended the deadline until 12th July. ========================================= CALL FOR PAPERS Second Workshop on Haskell And Rewriting Techniques (HART 2014) http://www.program-transformation.org/HART14/ To be held on September 5, co-located with ICFP 2014, the Haskell Symposium, etc., in Gothenburg. Haskell is an advanced purely-functional programming language. Pure functional programming is programming with equations, often defined by pattern-matching. Rewriting is the science of replacing equals by equals and thus a very powerful method for dealing with equations, often constructor-based. There are strong connections between Haskell (or generally, pure functional) programming and rewriting. The purpose of the HART workshop is to foster those connections. In addition to an invited talk by Oleg Kiselyov, we plan a half day of discussions, in an informal setting, on how Haskell (and related languages) and rewriting techniques and theories can cross-fertilize each other. Topics of interest are, for example: ==================================== - equational reasoning and other rewriting techniques for program verification and analysis; - lambda calculi and type systems for functional programs and higher-order rewrite systems; - rewriting of type expressions in the type checker; - rewriting of programs by refactoring tools, optimizers, code generators; - execution of programs as a form of graph rewriting (terms with sharing); - Template Haskell, generally introducing a rewriting-like macro language into the compilation process. This list of topics is non-exclusive. If you have a contribution that connects Haskell and rewriting, then submit. Also, the workshop is deliberately open for discussion of rewriting-related aspects of languages like Agda, Clean, ... When in doubt, please contact a member of the PC (see below). Dates: ====== July 12: deadline (extended) for submissions July 21: notification of acceptance September 5: workshop Submission and proceedings: =========================== We solicit two types of submissions: - Extended abstracts. Presenting original research, and also preliminary reports of work in progress. Will be included in the proceedings. - Presentation-only papers. Describing work recently published or submitted. Only abstract will be included in the proceedings. Papers should be at most 5 pages in length, and should use the easychair.cls style. Submission is electronically at https://www.easychair.org/conferences/?conf=hart2014 In line with the informal style of the workshop, the reviewing of submissions will be light. Proceedings will be made available electronically. Program committee: ================== Bertram Felgenhauer Carsten Fuhs Andy Gill Makoto Hamana Bastiaan Heeren Femke van Raamsdonk Tiark Rompf Kristoffer Rose (co-chair) Christian Sternagel Janis Voigtl?nder (co-chair) Johannes Waldmann From liyuanfang at gmail.com Sat Jul 5 01:44:14 2014 From: liyuanfang at gmail.com (liyuanfang at gmail.com) Date: Fri, 04 Jul 2014 18:44:14 -0700 (PDT) Subject: [Haskell] CFP: PRDC2014 Call for Fast Abstracts / Industry Track Papers / Posters Message-ID: <53b7586e.49de420a.4a76.ffffdce5@mx.google.com> PRDC2014 Call for Fast Abstracts / Industry Track Papers / Posters Singapore Nov.18-21,2014 http://prdc.dependability.org/PRDC2014/index.html --------------------------------- Call for Fast Abstracts http://prdc.dependability.org/PRDC2014/cffa.html --------------------------------- Fast Abstracts at PRDC are short oral presentations, either on new ideas or work in progress, or opinion pieces that can address any issue relevant to dependable systems and networks. Because they are brief and have a later deadline, Fast Abstracts enable their authors to: .Summarise work that is not yet complete .Put forward novel or challenging ideas .State positions on controversial issues .Suggest new approaches to the solution of open problems Thus, they provide an excellent opportunity to introduce new work, or present radical opinions, and receive early feedback from the community. Contributions are particularly solicited from industrial practitioners and academics that may not have been able to prepare full papers due to time and work pressures, but nevertheless seek an opportunity to engage with the PRDC community. Submission Guidelines Fast Abstracts should be at most two pages in length, must be formatted using standard two-column IEEE format. The submitted Fast Abstracts must be in .pdf format and completely ready for printing. To upload your paper, please use the submission site. Selection and Notification Submissions will be lightly-reviewed primarily on the basis of relevance to PRDC, but also on their capacity to stimulate and intrigue the reader. An author of an accepted contribution will deliver a short talk (five to ten minutes) in the Fast Abstracts track at the conference. Submission of a contribution to the track indicates agreement to have one author present the work, if accepted, at the conference. Important Dates Fast Abstract Deadline: July 4, 2014 Notification of Acceptance for Fast Abstract: July 28, 2014 --------------------------------- Call for Industry Track Papers http://prdc.dependability.org/PRDC2014/cfit.html --------------------------------- The Industry Track provides a forum for researchers and practitioners from industry to present and debate R&D challenges, practical solutions, case studies, and share field reliability data. Industry track submissions should be a maximum of 6 pages using standard two-column IEEE format. To upload your paper, please use the submission site. Selection and Notification Submissions will be reviewed by the Industry Track program committee and evaluated for their relevance to PRDC, the probably interest to the community, and their potential for stimulating further research. Submission of a contribution to the track indicates agreement to have one author present the work, if accepted, at the conference. Important Dates Submission Deadline: July 4, 2014 Notification of Acceptance for Industry Track: July 28, 2014 --------------------------------- Call for Posters http://prdc.dependability.org/PRDC2014/cfposters.html --------------------------------- The poster session provides a forum to present and discuss works-in-progress with topics related to dependable systems. A poster paper should use the same format as a regular paper but with a maximum of 2 pages. To upload your paper, please use the submission site. Selection and Notification Submissions will be reviewed by the Poster program committee and evaluated for their relevance to PRDC, the probably interest to the community, and their potential for stimulating further research. Submission of a contribution to the track indicates agreement to have one author present the work, if accepted, at the conference. Important Dates Submission Deadline:July 4, 2014 Notification of Acceptance for Posters: July 28, 2014 From oleg at okmij.org Mon Jul 7 01:41:32 2014 From: oleg at okmij.org (oleg at okmij.org) Date: Sun, 6 Jul 2014 21:41:32 -0400 (EDT) Subject: [Haskell] ML Family workshop: First Call for Participation Message-ID: <20140707014132.6DF62C3878@www1.g3.pair.com> Higher-order, Typed, Inferred, Strict: ACM SIGPLAN ML Family Workshop Thursday September 4, 2014, Gothenburg, Sweden Call For Participation http://okmij.org/ftp/ML/ML14.html Early registration deadline is August 3. Please register at https://regmaster4.com/2014conf/ICFP14/register.php This workshop specifically aims to recognize the entire extended ML family and to provide the forum to present and discuss common issues, both practical (compilation techniques, implementations of concurrency and parallelism, programming for the Web) and theoretical (fancy types, module systems, metaprogramming). We also encourage presentations from related languages (such as Scala, Rust, Nemerle, ATS, etc.), to exchange experience of further developing ML ideas. The workshop is conducted in close cooperation with the OCaml Users and Developers Workshop http://ocaml.org/meetings/ocaml/2014/ taking place on September 5. Program * Andreas Rossberg 1ML -- core and modules as one (Or: F-ing first-class modules) * Jacques Garrigue and Leo White Type-level module aliases: independent and equal * Felix Klock and Nicholas Matsakis Demo: The Rust Language and Type System * Tomas Petricek and Don Syme Doing web-based data analytics with F# * Thomas Braibant, Jonathan Protzenko and Gabriel Scherer Well-typed generic smart-fuzzing for APIs * Ramana Kumar, Magnus O. Myreen, Michael Norrish and Scott Owens Improving the CakeML Verified ML Compiler * Leo White and Frederic Bour Modular implicits * Nada Amin and Tiark Rompf Implicits in Practice * Anil Madhavapeddy, Thomas Gazagnaire, David Scott and Richard Mortier Metaprogramming with ML modules in the MirageOS * Katsuhiro Ueno and Atsushi Ohori Compiling SML# with LLVM: a Challenge of Implementing ML on a Common Compiler Infrastructure * Akinori Abe and Eijiro Sumii A Simple and Practical Linear Algebra Library Interface with Static Size Checking * John Reppy SML3d: 3D Graphics for Standard ML In addition, the joint poster session with the OCaml workshop will take place in the afternoon on September 5. The session will include posters: * Nicolas Oury Core.Sequence: a unified interface for sequences * Thomas Gazagnaire, Amir Chaudhry, Anil Madhavapeddy, Richard Mortier, David Scott, David Sheets, Gregory Tsipenyuk, Jon Crowcroft Irminsule: a branch-consistent distributed library database * Michel Mauny and Benoit Vaugon Nullable Type Inference * Edwin Toeroek LibreS3: design, challenges, and steps toward reusable libraries * Fabrice Le Fessant A Case for Multi-Switch Constraints in OPAM Program Committee Kenichi Asai Ochanomizu University, Japan Matthew Fluet Rochester Institute of Technology, USA Jacques Garrigue Nagoya University, Japan Dave Herman Mozilla, USA Stefan Holdermans Vector Fabrics, Netherlands Oleg Kiselyov (Chair) University of Tsukuba, Japan Keiko Nakata Tallinn University of Technology, Estonia Didier Remy INRIA Paris-Rocquencourt, France Zhong Shao Yale University, USA Hongwei Xi Boston University, USA From Graham.Hutton at nottingham.ac.uk Tue Jul 8 13:45:36 2014 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Tue, 8 Jul 2014 14:45:36 +0100 Subject: [Haskell] Nottingham Research Fellowships Message-ID: <496A8553-BD0C-48FD-A260-7858783A6D44@exmail.nottingham.ac.uk> Dear all, The University of Nottingham is seeking applications for a number of Nottingham Research Fellowships: http://tinyurl.com/notts-fellows These are highly prestigious three-year fellowships, which are normally expected to lead into permenant academic positions. Candidates should have no more than 8 years postdoctoral experience, and fellowships normally start in October 2015. The deadline for submission of initial Expressions of Interest is ** 20th October 2014 **. Applicants in the area of the Functional Programming (FP) lab would be most welcome. The FP lab is keen to receive applications from outstanding candidates with an excellent publication record, experience in combining theory with practice, and the ability to secure external funding to support their research. Further information about the FP lab is available from http://fp.cs.nott.ac.uk As an approximate guideline, candidates in the area of the FP lab would normally be expected to have at least 3 years postdoc experience, and a number of strong publications in leading international venues such as ICFP, POPL, LICS, JFP, Haskell Symposium, etc. Best wishes, Graham Hutton -- Prof Graham Hutton Functional Programming Lab School of Computer Science University of Nottingham, UK http://www.cs.nott.ac.uk/~gmh This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From rasfar at gmail.com Wed Jul 9 03:31:54 2014 From: rasfar at gmail.com (Andrew Seniuk) Date: Tue, 8 Jul 2014 21:31:54 -0600 Subject: [Haskell] ANNOUNCE: sai-shape-syb Generic mapping to homogeneous types (etc.) Message-ID: This package provides some support for dealing with polytypic data. It lets you escape from the generics world and work with a homogeneous rose tree, which can sometimes be convenient. I realise a more experienced programmer would probably do this differently, but anyhow it was useful to me and I've uploaded it. http://hackage.haskell.org/package/sai-shape-syb There are some examples at http://fremissant.net/shape-syb In particular, it supports GHC staged traversals, so for those trying to work with the GHC AST this might be a helpful tool for filtering, debugging, and suchlike. Kind Regards, Andrew Seniuk rasfar on #haskell -------------- next part -------------- An HTML attachment was scrubbed... URL: From jv at informatik.uni-bonn.de Thu Jul 10 05:43:31 2014 From: jv at informatik.uni-bonn.de (Janis Voigtlaender) Date: Thu, 10 Jul 2014 07:43:31 +0200 Subject: [Haskell] PEPM 2015: Call for papers Message-ID: <53BE2803.7050608@informatik.uni-bonn.de> PEPM 2015 Paper Submission Deadline: September 12 (FIRM) Note: deadline is significantly earlier than previous years. Hope to see you in Mumbai, India! ----------------------------- C A L L F O R P A P E R S ----------------------------- ======= PEPM 2015 =========== ACM SIGPLAN 2015 WORKSHOP ON PARTIAL EVALUATION AND PROGRAM MANIPULATION Tue-Wed, January 13-14, 2015, Mumbai, India, co-located with POPL'15 http://conf.researchr.org/home/pepm2015 Sponsored by ACM SIGPLAN SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2015 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue last years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'15 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses and other support. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. Accepted papers will be included in the ACM Digital Library. Following the practice of recent PEPMs, we are planning a special issue of a journal for a selection of papers presented at the PEPM'15 workshop. PEPM has also established a Best Paper award. The winner will be announced at the workshop. SUBMISSION CATEGORIES AND GUIDELINES Regular Research Papers must not exceed 12 pages in ACM Proceedings style (including appendix). Tool demonstration papers and short papers must not exceed 6 pages in ACM Proceedings style (including appendix). At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research tool demonstration papers will be made available on the PEPM'15 Web-site soon. Papers should be submitted electronically via the workshop web site. Authors using LaTeX to prepare their submissions should use the new improved SIGPLAN proceedings style (sigplanconf.cls, 9pt template). IMPORTANT DATES Abstract submission: Tue, September 9, 2014 Paper submission: Fri, September 12, 2014 (FIRM) Author notification: Mon, October 13, 2014 Workshop: Tue, January 13 and Wed, January 14, 2015 Note: The paper submission deadline is firm. Because the VISA application to India can take long, all the schedule is set earlier than previous years. The above schedule is tight: we have absolutely no time to wait for late submissions and we will have no deadline extension. So, please plan ahead. INVITED SPEAKERS to be announced PROGRAM CHAIRS Kenichi Asai (Ochanomizu University, Japan) Kostis Sagonas (Uppsala University, Sweden / NTUA, Greece) PROGRAM COMMITTEE to be announced From brucker at spamfence.net Fri Jul 11 05:25:31 2014 From: brucker at spamfence.net (Achim D. Brucker) Date: Fri, 11 Jul 2014 07:25:31 +0200 Subject: [Haskell] OCL 2014: Submission Deadline Extended by One Week Message-ID: <20140711052531.GA17319@fujikawa.home.brucker.ch> (Apologies for duplicates) ************************************************************** ** Submission Deadline Extended to July 18th, 2014 ** ************************************************************** CALL FOR PAPERS 14th International Workshop on OCL and Textual Modeling Applications and Case Studies (OCL 2014) Co-located with ACM/IEEE 17th International Conference on Model Driven Engineering Languages and Systems (MODELS 2014) September 30, 2014, VALENCIA, SPAIN http://www.software.imdea.org/OCL2014/ Modeling started out with UML and its precursors as a graphical notation. Such visual representations enable direct intuitive capturing of reality, but some of their features are difficult to formalize and lack the level of precision required to create complete and unambiguous specifications. Limitations of the graphical notations encouraged the development of text-based modeling languages that either integrate with or replace graphical notations for modeling. Typical examples of such languages are OCL, textual MOF, Epsilon, and Alloy. Textual modeling languages have their roots in formal language paradigms like logic, programming and databases. The goal of this workshop is create a forum where researchers and practitioners interested in building models using OCL or other kinds of textual languages can directly interact, report advances, share results, identify tools for language development, and discuss appropriate standards. In particular, the workshop will encourage discussions for achieving synergy from different modeling language concepts and modeling language use. The close interaction will enable researchers and practitioners to identify common interests and options for potential cooperation. Topics of interest include (but are not limited to) =================================================== - Mappings between textual modeling languages and other languages/formalisms - Algorithms, evaluation strategies and optimizations in the context of textual modeling languages for -- validation, verification, and testing, -- model transformation and code generation, -- metamodeling and DSLs, and -- query and constraint specifications - Alternative graphical/textual notations for textual modeling languages - Evolution, transformation and simplification of textual modeling expressions - Libraries, templates and patterns for textual modeling languages - Complexity results for textual modeling languages - Quality models and benchmarks for comparing and evaluating textual modeling tools and algorithms - Successful applications of textual modeling languages - Case studies on industrial applications of textual modeling languages - Experience reports -- usage of textual modeling languages and tools in complex domains, -- usability of textual modeling languages and tools for end-users - Empirical studies about the benefits and drawbacks of textual modeling languages - Innovative textual modeling tools - Comparison, evaluation and integration of modeling languages - Correlation between modeling languages and modeling tasks This year, we particularly encourage submissions describing applications and case studies of textual modeling as well as test suites and benchmark collections for evaluating textual modeling tools. Venue ===== The workshop will be organized as a part of MODELS 2014 Conference in Valencia, Spain. It continues the series of OCL workshops held at UML/MODELS conferences: York (2000), Toronto (2001), San Francisco (2003), Lisbon (2004), Montego Bay (2005), Genova (2006), Nashville (2007), Toulouse (2008), Denver (2009), Oslo (2010), Zurich (2011, at the TOOLs conference), 2012 in Innsbruck, and 2013 in Miami. Similar to its predecessors, the workshop addresses both people from academia and industry. The aim is to provide a forum for addressing integration of OCL and other textual modeling languages, as well as tools for textual modeling, and for disseminating good practice and discussing the new requirements for textual modeling. Workshop Format =============== The workshop will include short (about 15 min) presentations, parallel sessions of working groups, and sum-up discussions. Submissions =========== Two types of papers will be considered: * short papers (6 pages) and * full papers (10 pages) in LNCS format. Submissions should be uploaded to EasyChair (https://www.easychair.org/conferences/?conf=ocl2014). The program committee will review the submissions (minimum 2 reviews per paper, usually 3 reviews) and select papers according to their relevance and interest for discussions that will take place at the workshop. Accepted papers will be published online in a pre-conference edition of CEUR (http://www.ceur-ws.org). Authors of selected papers will be invited to submit an extended version of their workshop paper to a special issue of the Electronic Communications of the EASST (http://journal.ub.tu-berlin.de/eceasst) Important Dates =============== Submission of papers: July 18, 2014 (extended) Notification: August 8, 2014 Workshop date: September 30, 2014 Organizers ========== Achim D. Brucker, SAP AG, Germany Carolina Dania, IMDEA Software Institute, Madrid, Spain Geri Georg, Colorado State University, Fort Collins, Colorado, USA Martin Gogolla, University of Bremen, Germany Programme Committee =================== Michael Altenhofen, SAP AG, Germany Thomas Baar, University of Applied Sciences Berlin, Germany Mira Balaban, Ben-Gurion University of the Negev, Israel Tricia Balfe, Nomos Software, Ireland Fabian Buettner, Ecole des Mines de Nantes, France Achim D. Brucker, SAP AG, Germany Jordi Cabot, INRIA-Ecole des Mines de Nantes, France Yoonsik Cheon, University of Texas, USA Dan Chiorean, Babes-Bolyai University, Romania Robert Clariso, Universitat Oberta de Catalunya, Spain Tony Clark, Middlesex University, UK Manuel Clavel, IMDEA Software Institute, Madrid, Spain Carolina Dania, IMDEA Software Institute, Madrid, Spain Birgit Demuth, Technische Universitat Dresden, Germany Marina Egea, Atos Research, Madrid, Spain Geri Georg, Colorado State University, Fort Collins, Colorado, USA Martin Gogolla, University of Bremen, Germany Pieter Van Gorp, Eindhoven University of Technology, The Netherlands Heinrich Hussmann, LMU Munchen, Germany Tihamer Levendovszky, Vanderbilt University, USA Shahar Maoz, Tel Aviv University, Israel Istvan Rath, Budapest University of Technology and Economics, Hungary Bernhard Rumpe, RWTH Aachen, Germany Shane Sendall, Snowie Research SA, Switzerland Michael Wahler, ABB Switzerland Ltd Corporate Research, Switzerland Claas Wilke, Technische Universitat Dresden, Germany Edward Willink, Willink Transformations Ltd., UK Burkhart Wolff, Univ Paris-Sud, France Steffen Zschaler, King?s College, London, UK -- Dr. Achim D. Brucker, SAP SE, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch/ From austin at well-typed.com Fri Jul 11 13:40:54 2014 From: austin at well-typed.com (Austin Seipp) Date: Fri, 11 Jul 2014 08:40:54 -0500 Subject: [Haskell] ANNOUNCE: GHC version 7.8.3 Message-ID: ============================================================== The (Interactive) Glasgow Haskell Compiler -- version 7.8.3 ============================================================== The GHC Team is pleased to announce a new patchlevel release of GHC, 7.8.3. This is an important bugfix release relative to 7.8.2 (with over 50 defects fixed), so we highly recommend upgrading from the previous 7.8 releases. The full release notes are here: https://www.haskell.org/ghc/docs/7.8.3/html/users_guide/release-7-8-3.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: https://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://ghc.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://ghc.haskell.org/trac/ghc/wiki/Platforms http://ghc.haskell.org/trac/ghc/wiki/CodeOwners Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://ghc.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://ghc.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug Hashes & Signatures ~~~~~~~~~~~~~~~~~ Included in this email is a signed copy of the SHA256 hashes for the tarballs, using my GPG key (keyid 0x3B58D86F). -- Regards, Austin Seipp, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/ -------------- next part -------------- A non-text attachment was scrubbed... Name: SHA256SUMS Type: application/octet-stream Size: 2934 bytes Desc: not available URL: -------------- next part -------------- A non-text attachment was scrubbed... Name: SHA256SUMS.sig Type: application/octet-stream Size: 836 bytes Desc: not available URL: From cnn at cs.au.dk Fri Jul 11 22:00:54 2014 From: cnn at cs.au.dk (Jacob Johannsen) Date: Sat, 12 Jul 2014 00:00:54 +0200 Subject: [Haskell] PPDP 2014 Call for Participation Message-ID: <53C05E96.9030808@cs.au.dk> ====================================================================== CALL FOR PARTICIPATION: PPDP 2014 16th International Symposium on Principles and Practice of Declarative Programming Canterbury, Kent, September 8-10, 2014 http://users-cs.au.dk/danvy/ppdp14/ co-located with LOPSTR 2014 24th International Symposium on Logic-Based Program Synthesis and Transformation Canterbury, Kent, September 9-11, 2014 http://www.iasi.cnr.it/events/lopstr14/ ====================================================================== Registration is now open: http://www.cs.kent.ac.uk/events/2014/ppdp-lopstr-14/ A significant discount is available when registering to both events, especially as a student (until August 8). PPDP 2014 features * an invited talk by Roberto Giacobazzi, shared with LOPSTR: "Obscuring Code -- Unveiling and Veiling Information in Programs" * no fewer than 4 distilled tutorials by - Henrik Nilsson and Ivan Perez: "Declarative Game Programming" - Danko Ilik: "Proofs in Continuation-Passing Style: normalization of G?del's System T extended with sums and delimited control operators" - Jerzy Karczmarczuk: "On the Declarative Structure of Quantum Concepts: States and Observables" - Ralf Laemmel, Andrei Varanovich, and Martin Leinberger: "Declarative Software Development" * a rich program of 22 contributed research talks * the most influential paper 10-year award for PPDP 2004 Also, please note a change of dates: LOPSTR will start on September 9, rather than September 10 as previously announced. Hope to see you in Canterbury. From dreixel at gmail.com Sat Jul 12 09:59:49 2014 From: dreixel at gmail.com (=?UTF-8?Q?Jos=C3=A9_Pedro_Magalh=C3=A3es?=) Date: Sat, 12 Jul 2014 10:59:49 +0100 Subject: [Haskell] Call for participation: Workshop on Generic Programming Message-ID: ====================================================================== CALL FOR PARTICIPATION WGP 2014 10th ACM SIGPLAN Workshop on Generic Programming Gothenburg, Sweden Sunday, August 31, 2014 http://www.wgp-sigplan.org/2014 Co-located with the International Conference on Functional Programming (ICFP 2014) ====================================================================== Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. Schedule -------- 09:00 Welcome Session 1 09:10 Bruno C. d. S. Oliveira. Functional Programming, Object-Oriented Programming and Algebras! (invited talk) 10:00 Coffee break Session 2 10:30 Larry Diehl and Tim Sheard. Generic Constructors and Eliminators from Descriptions 11:00 Thomas Williams, Pierre-?variste Dagand and Didier R?my. Ornaments in Practice 11:30 Matthew Roberts and Tony Sloane. Type Inference for the Spine View of Data 12:00 Lunch Session 3 14:00 Alexander Slesarenko, Alexander Filippov and Alexey Romanov. First-class Isomorphic Specialization by Staged Evaluation 14:30 Sam Lindley. Algebraic Effects and Effect Handlers for Idioms and Arrows 15:00 Larisse Voufo, Marcin Zalewski and Andrew Lumsdaine. Scoping Rules on a Platter ? A Framework for Understanding and Specifying Name Binding 15:30 Tea break Session 4 16:00 Patrick Bahr. Composing and Decomposing Data Types ? A Closed Type Families Implementation of Data Types ? la Carte 16:30 Edsko de Vries and Andres L?h. True Sums of Products 17:00 End Registration ------------ You can register via the ICFP 2014 registration: https://regmaster4.com/2014conf/ICFP14/register.php Early registration deadline is 3 August. Program Committee ----------------- Jos? Pedro Magalh?es (co-chair), University of Oxford Tiark Rompf (co-chair), Oracle Labs & EPFL Peter Achten, Radboud University Nijmegen Nada Amin, Ecole Polytechnique F?d?rale de Lausanne (EPFL) Pierre-?variste Dagand, INRIA Paris-Rocquencourt Fritz Henglein, University of Copenhagen Andrew Lumsdaine, Indiana University Alexander Slesarenko, Huawei Labs & Keldysh Institute of Applied Mathematics (KIAM) Anthony M. Sloane, Macquarie University Wouter Swierstra, Utrecht University Meng Wang, Chalmers University of Technology WGP Steering Committee ---------------------- Shin-Cheng Mu (chair) Jaako J?rvi Andres L?h Ronald Garcia Jacques Carette Jeremiah Willcock Tim Sheard Stephanie Weirich Tarmo Uustalu -------------- next part -------------- An HTML attachment was scrubbed... URL: From erkokl at gmail.com Sat Jul 12 19:49:20 2014 From: erkokl at gmail.com (Levent Erkok) Date: Sat, 12 Jul 2014 12:49:20 -0700 Subject: [Haskell] [ANNOUNCE] New release of SBV (v3.1) Message-ID: I'm pleased to announce v3.1 release of SBV, a library for integrating SMT solvers into Haskell. This release coincides with GHC 7.8.3: A a prior bug in the 7.8 series caused SBV to crash under heavy load. GHC 7.8.3 fixes this bug; so if you're an SBV user, please upgrade to both GHC 7.8.3 and your version of SBV. Also new in this release are two oft-requested features: - Parallel solving capabilities: Using multiple SMT solvers at the same time to get the fastest result (speed), or get all results (to make sure they all behave the same way, safety). - A variant of symbolic if-then-else (called sBranch) that can call the external solver during simulation before it symbolically simulates "then" and "else" branches. This is useful for programming with recursive functions where termination depends on symbolic values. Full release notes: https://github.com/LeventErkok/sbv/blob/master/CHANGES.md SBV web page: http://leventerkok.github.io/sbv/ As usual, bug reports and feedback are most welcome! -Levent. -------------- next part -------------- An HTML attachment was scrubbed... URL: From erdweg at informatik.tu-darmstadt.de Mon Jul 14 14:30:23 2014 From: erdweg at informatik.tu-darmstadt.de (Sebastian Erdweg) Date: Mon, 14 Jul 2014 16:30:23 +0200 Subject: [Haskell] Call for Talk Proposals: Parsing@SLE Message-ID: <3F21C28C-E7B8-4423-BF63-0422B02A6171@informatik.tu-darmstadt.de> ********************************************************************* CALL FOR TALK PROPOSALS Second Workshop on Parsing at SLE 2014 September 14, 2014 V?ster?s, Sweden Co-located with ASE, SLE, and GPCE http://www.sleconf.org/2014/Parsing-at-SLE.html ********************************************************************* Deadline for talk proposals: July 25, 2014 The goal of this workshop is to bring together today's experts in the fields of parser construction and parser application from across the diverse application areas. Participants will present ongoing work as well as explore the challenges that lie ahead. By bringing the whole community together (a rare occurrence, given the diversity of domain-specific conferences/workshops), we aim to forge new collaborations inspired by a wide-ranging collection of talks on parsing-related topics. *** Topics *** While parsing and parser generation, both in theory and in practice, are mature topics, there are challenging problems with respect to the construction, maintenance, optimization, and application of parsers in real-world scenarios. Especially in the context of real programming languages there are ample theoretical as well as practical obstacles to be overcome. Contemporary parsing challenges are caused by programming-language evolution and diversity in the face of new application areas such as IDE construction, reverse engineering, software metrics, domain specific (embedded) languages, etc. What are modular meta-formalisms for parser generation? How to obtain (fast and correct) parsers for both legacy and new languages that require more computational power than context-free grammars and regular expressions can provide? How to enable the verified construction or prototyping of parsers for languages such as COBOL, C++ and Scala without years of effort? In addition to the traditional programming-language applications of parsing technology, several other areas of computing also depend heavily on parsers. Examples include computational linguistics, network traffic classification, network security, and bioinformatics. Those areas often have their own unusual requirements, such as: speed (e.g. in network algorithmics), memory efficiency (e.g. embedded devices for networks, but also computational linguistics), or rapid/dynamic parser construction (e.g. in network traffic classification and in bioinformatics) as grammars are adapted. We specifically encourage talk proposals on parsing challenges and solutions in these non-traditional areas. *** Call for Submissions *** We solicit talk proposals in the form of short abstracts (max. 2 pages in ACM 2-column format). A good talk proposal describes an interesting position, demonstration, or early achievement. The submissions will be reviewed on relevance and clarity, and used to plan the mostly interactive sessions of the workshop day. Publication of accepted abstracts and slides on the website is voluntary. * Deadline for talk proposals: July 25, 2014 * Workshop: September 14, 2014 * Notification: August 6, 2014 * Submission website: https://www.easychair.org/conferences/?conf=parsingsle2014 *** Workshop Organization *** Organizers * Sebastian Erdweg, TU Darmstadt, Germany * Bruce Watson, FASTAR, Stellenbosch University, South Africa From gautier.difolco at gmail.com Mon Jul 14 15:08:27 2014 From: gautier.difolco at gmail.com (Gautier DI FOLCO) Date: Mon, 14 Jul 2014 17:08:27 +0200 Subject: [Haskell] Call for participation: FOSDEM 2015 Message-ID: Hi all, I'm not a FOSDEM (maybe the biggest FOSS Developer meeting in Europe) organizer, but next year it will be the third time that I'll attend to it and I'd like to see a FP devroom. So, here is the CFP: https://fosdem.org/2015/news/2014-07-01-call-for-participation/ If there are any good willings, don't wait! For the moment, if I understand well, they are looking for dev room coordinators, so: 1. If you want to give a talk, say it here, it will give an overview to potential coordinators 2. If you want to be coordinator, say it here, it will motivate talks proposals 3. If you want to be a half-time coordinator, say it, maybe an other one will do the same 4. If there are talks but no or not enough coordinator, I'll complete the team What ever what will happen, See you there, Regards. -------------- next part -------------- An HTML attachment was scrubbed... URL: From stefan.wehr at gmail.com Mon Jul 14 15:15:27 2014 From: stefan.wehr at gmail.com (Stefan Wehr) Date: Mon, 14 Jul 2014 17:15:27 +0200 Subject: [Haskell] ANN: HacBerlin - Haskell Hackathon in Berlin, 26-28 Sep 2014 Message-ID: Dear Haskellers, another Haskell Hackathon is waiting for you! Where: Berlin, Germany When: Fri 26 - Sun 28 September 2014 Meet in Berlin, discuss, hack together and improve the Haskell infrastructure. We welcome all programmers interested in Haskell, beginners and experts! For all details, visit our wiki page (http://www.haskell.org/haskellwiki/HacBerlin2014) and make sure to register early. By the way: we are currently looking for one or two keynote talks. If you feel qualified, please let us know. Happy hacking, Stefan From dstcruz at gmail.com Thu Jul 17 03:30:06 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 16 Jul 2014 23:30:06 -0400 Subject: [Haskell] Haskell Weekly News: Issue 299 Message-ID: Welcome to issue 299 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from June 29 to July 12, 2014 Quotes of the Week * donri: maybe good thing Applicative isn't called StrongLaxSemimonoidalEndofunctor * ninja_code: haskell is used to debug thinking * johnw: the first rule of category theory club is to state your identity Top Reddit Stories * The new haskell.org design Domain: new-www.haskell.org, Score: 130, Comments: 95 Original: [1] http://new-www.haskell.org/ On Reddit: [2] http://goo.gl/qG7683 * GHC-7.8.3 is out! Domain: haskell.org, Score: 115, Comments: 40 Original: [3] http://goo.gl/fyHQZd On Reddit: [4] http://goo.gl/7bsDXj * Announcing rest - A Haskell REST framework Domain: engineering.silk.co, Score: 97, Comments: 41 Original: [5] http://goo.gl/F3W628 On Reddit: [6] http://goo.gl/VqWdi9 * GHC plans for 7.10.1 Domain: ghc.haskell.org, Score: 77, Comments: 54 Original: [7] http://goo.gl/YH6516 On Reddit: [8] http://goo.gl/g16PE3 * unagi-chan: Fast and scalable concurrent queues for x86, with a Chan-like API Domain: hackage.haskell.org, Score: 61, Comments: 17 Original: [9] http://goo.gl/7dE0e4 On Reddit: [10] http://goo.gl/zaMC6o * Come practice Haskell *and* make a difference in the world by helping us build a new Free/Libre/Open patronage economy Domain: snowdrift.coop, Score: 59, Comments: 19 Original: [11] http://goo.gl/vU2cx On Reddit: [12] http://goo.gl/PRkG3B * What's wrong with String Domain: haskell.org, Score: 55, Comments: 123 Original: [13] http://goo.gl/8etnBS On Reddit: [14] http://goo.gl/k2FZ9u * Why is package management so awful? Domain: self.haskell, Score: 55, Comments: 100 Original: [15] http://goo.gl/7h7cWn On Reddit: [16] http://goo.gl/7h7cWn * Re?ection without Remorse: Revealing a hidden sequence to speed up monadic re?ection [pdf] Domain: homepages.cwi.nl, Score: 49, Comments: 36 Original: [17] http://goo.gl/QgiwtW On Reddit: [18] http://goo.gl/BpYmcS * Mutable Algorithms in Immutable Languages, Part 1 Domain: tel.github.io, Score: 49, Comments: 27 Original: [19] http://goo.gl/hn6218 On Reddit: [20] http://goo.gl/apKO9f * Where is Haskell going in industry? Domain: self.haskell, Score: 47, Comments: 114 Original: [21] http://goo.gl/Io2hvy On Reddit: [22] http://goo.gl/Io2hvy * Why Dependently Typed Programming Will (One Day) Rock Your World Domain: ejenk.com, Score: 45, Comments: 154 Original: [23] http://goo.gl/d3zkiG On Reddit: [24] http://goo.gl/z3ZhDf * Using Phantom Types for Extra Safety Domain: blog.jakubarnold.cz, Score: 41, Comments: 19 Original: [25] http://goo.gl/WnZH0Z On Reddit: [26] http://goo.gl/EJTpxl * Designing Dependently Typed Languages - OPLSS '14 Domain: self.haskell, Score: 37, Comments: 11 Original: [27] http://goo.gl/P2mV1A On Reddit: [28] http://goo.gl/P2mV1A * Hackage update, part 3 Domain: lambda.xyz, Score: 37, Comments: 13 Original: [29] http://goo.gl/sLHVfX On Reddit: [30] http://goo.gl/G7dHLc * Announce: The most complete prelude formed from only the "base" package Domain: hackage.haskell.org, Score: 37, Comments: 55 Original: [31] http://goo.gl/lSoKVh On Reddit: [32] http://goo.gl/UeNUYL * New generic programming library (with paper accepted in WGP 2014) Domain: andres-loeh.de, Score: 34, Comments: 11 Original: [33] http://goo.gl/PgV7yV On Reddit: [34] http://goo.gl/qFOlLB * Ideal programming language for a new modern OS built from scratch? Domain: self.haskell, Score: 32, Comments: 63 Original: [35] http://goo.gl/eTkOFd On Reddit: [36] http://goo.gl/eTkOFd * Neil Mitchell's Haskell Blog: Optimisation with Continuations Domain: neilmitchell.blogspot.com.es, Score: 30, Comments: 15 Original: [37] http://goo.gl/lvo8Oa On Reddit: [38] http://goo.gl/haJyX4 * can we do better than cabal sandbox? Domain: self.haskell, Score: 30, Comments: 38 Original: [39] http://goo.gl/RS3j0s On Reddit: [40] http://goo.gl/RS3j0s Top StackOverflow Questions * Is there a monad that doesn't have a corresponding monad transformer (except IO)? votes: 37, answers: 1 Read on SO: [41] http://goo.gl/wBH70C * Arrows are exactly equivalent to applicative functors? votes: 21, answers: 3 Read on SO: [42] http://goo.gl/WRjQx0 * Why does GHC typecheck before desugaring? votes: 19, answers: 1 Read on SO: [43] http://goo.gl/EzaZVr * List of Functors votes: 15, answers: 3 Read on SO: [44] http://goo.gl/RmJvDC * Or-patterns in Haskell votes: 13, answers: 2 Read on SO: [45] http://goo.gl/ukvJm1 * What does this list permutations implementation in Haskell exactly do? votes: 12, answers: 2 Read on SO: [46] http://goo.gl/CXOCch * Should Latitude, Longitude and Elevation have their own type in Haskell? votes: 12, answers: 2 Read on SO: [47] http://goo.gl/fkElae * Haskell List Comprehension Speed Inconsistencies votes: 12, answers: 1 Read on SO: [48] http://goo.gl/0o4rwI * What are some examples of type-level programming? [closed] votes: 11, answers: 3 Read on SO: [49] http://goo.gl/fowZ6b * QuickCheck Gen is not a monad votes: 11, answers: 1 Read on SO: [50] http://goo.gl/hiJ0q8 Until next time, [51]+Daniel Santa Cruz References 1. http://new-www.haskell.org/ 2. http://www.reddit.com/r/haskell/comments/2a77f2/the_new_haskellorg_design/ 3. http://www.haskell.org/ghc/docs/7.8.3/html/users_guide/release-7-8-3.html 4. http://www.reddit.com/r/haskell/comments/2af4jf/ghc783_is_out/ 5. http://engineering.silk.co/post/90354057868/announcing-rest-a-haskell-rest-framework 6. http://www.reddit.com/r/haskell/comments/29h32i/announcing_rest_a_haskell_rest_framework/ 7. https://ghc.haskell.org/trac/ghc/wiki/Status/GHC-7.10.1 8. http://www.reddit.com/r/haskell/comments/29v4lj/ghc_plans_for_7101/ 9. http://hackage.haskell.org/package/unagi-chan-0.1.0.1 10. http://www.reddit.com/r/haskell/comments/2adh2f/unagichan_fast_and_scalable_concurrent_queues_for/ 11. https://snowdrift.coop/ 12. http://www.reddit.com/r/haskell/comments/29zw5j/come_practice_haskell_and_make_a_difference_in/ 13. http://www.haskell.org/pipermail/haskell-cafe/2014-June/114745.html 14. http://www.reddit.com/r/haskell/comments/29jw0s/whats_wrong_with_string/ 15. http://www.reddit.com/r/haskell/comments/2a9n0t/why_is_package_management_so_awful/ 16. http://www.reddit.com/r/haskell/comments/2a9n0t/why_is_package_management_so_awful/ 17. http://homepages.cwi.nl/~ploeg/papers/zseq.pdf 18. http://www.reddit.com/r/haskell/comments/29i94o/re%EF%ACection_without_remorse_revealing_a_hidden/ 19. http://tel.github.io/2014/07/12/mutable_algorithms_in_immutable_languges_part_1/ 20. http://www.reddit.com/r/haskell/comments/2ahorr/mutable_algorithms_in_immutable_languages_part_1/ 21. http://www.reddit.com/r/haskell/comments/2a310v/where_is_haskell_going_in_industry/ 22. http://www.reddit.com/r/haskell/comments/2a310v/where_is_haskell_going_in_industry/ 23. http://ejenk.com/blog/why-dependently-typed-programming-will-one-day-rock-your-world.html 24. http://www.reddit.com/r/haskell/comments/29kv2y/why_dependently_typed_programming_will_one_day/ 25. http://blog.jakubarnold.cz/2014/07/08/using-phantom-types-for-extra-safety.html 26. http://www.reddit.com/r/haskell/comments/2a5duv/using_phantom_types_for_extra_safety/ 27. http://www.reddit.com/r/haskell/comments/2a115h/designing_dependently_typed_languages_oplss_14/ 28. http://www.reddit.com/r/haskell/comments/2a115h/designing_dependently_typed_languages_oplss_14/ 29. http://lambda.xyz/blog/hackage-part-3/ 30. http://www.reddit.com/r/haskell/comments/2abi06/hackage_update_part_3/ 31. http://hackage.haskell.org/package/base-prelude 32. http://www.reddit.com/r/haskell/comments/2ahq11/announce_the_most_complete_prelude_formed_from/ 33. http://www.andres-loeh.de/TrueSumsOfProducts/ 34. http://www.reddit.com/r/haskell/comments/2a535x/new_generic_programming_library_with_paper/ 35. http://www.reddit.com/r/haskell/comments/29tgjd/ideal_programming_language_for_a_new_modern_os/ 36. http://www.reddit.com/r/haskell/comments/29tgjd/ideal_programming_language_for_a_new_modern_os/ 37. http://neilmitchell.blogspot.com.es/2014/06/optimisation-with-continuations.html 38. http://www.reddit.com/r/haskell/comments/29fjg4/neil_mitchells_haskell_blog_optimisation_with/ 39. http://www.reddit.com/r/haskell/comments/2a2ec7/can_we_do_better_than_cabal_sandbox/ 40. http://www.reddit.com/r/haskell/comments/2a2ec7/can_we_do_better_than_cabal_sandbox/ 41. http://stackoverflow.com/questions/24515876/is-there-a-monad-that-doesnt-have-a-corresponding-monad-transformer-except-io 42. http://stackoverflow.com/questions/24668313/arrows-are-exactly-equivalent-to-applicative-functors 43. http://stackoverflow.com/questions/24639279/why-does-ghc-typecheck-before-desugaring 44. http://stackoverflow.com/questions/24589995/list-of-functors 45. http://stackoverflow.com/questions/24700762/or-patterns-in-haskell 46. http://stackoverflow.com/questions/24484348/what-does-this-list-permutations-implementation-in-haskell-exactly-do 47. http://stackoverflow.com/questions/24521976/should-latitude-longitude-and-elevation-have-their-own-type-in-haskell 48. http://stackoverflow.com/questions/24690406/haskell-list-comprehension-speed-inconsistencies 49. http://stackoverflow.com/questions/24481113/what-are-some-examples-of-type-level-programming 50. http://stackoverflow.com/questions/24481648/quickcheck-gen-is-not-a-monad 51. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From hbzhu at sei.ecnu.edu.cn Mon Jul 21 19:45:54 2014 From: hbzhu at sei.ecnu.edu.cn (Huibiao Zhu) Date: Tue, 22 Jul 2014 03:45:54 +0800 Subject: [Haskell] =?gb2312?b?VEFTRSAyMDE0o7pDQUxMIEZPUiBQQVJUSUNJUEFUSU9O?= Message-ID: <004c01cfa51c$62def540$289cdfc0$@ecnu.edu.cn> ****************************************************************** CALL FOR PARTICIPATION TASE 2014: 8th Theoretical Aspects of Software Engineering Symposium 1-3 September 2014, Changsha, China http://www.nudt.edu.cn/tase2014/ ****************************************************************** ---------------- OVERVIEW ---------------- Modern society is increasingly dependent on software systems that are becoming larger and more complex. This poses new challenges to the various aspects of software engineering, for instance, software dependability in trusted computing, interaction with physical components in cyber physical systems, distribution in cloud computing applications, etc. Hence, new concepts and methodologies are required to enhance the development of software engineering from theoretical aspects. TASE 2014 aims to provide a forum for people from academia and industry to communicate their latest results on theoretical advances in software engineering. TASE 2014 is the 8th in the TASE series. The past TASE symposiums were successfully held in Shanghai ('07), Nanjing ('08), Tianjin ('09), Taipei ('10), Xi'an ('11), Beijing ('12), Birmingham ('13). The proceedings of the TASE 2014 symposium will be published by the IEEE Computer Society Press. ----------- VENUE ----------- TASE 2014 will be held at Yannian Century Hotel, Changsha, China. Changsha is the capital and largest city of Hunan province in south-central China, located on the lower reaches of the Xiang River, a branch of the Yangtze River. Read more about Changsha at: http://wikitravel.org/en/Changsha ----------------------- REGISTRATION ----------------------- Registration fees and deadlines are detailed below. Type Deadline Fees Early By July 10 RMB 4000(USD 650) Late After July 10 RMB 4600(USD 750) Student Anytime RMB 3000(USD 500) The details of registration can be found at: http://www.nudt.edu.cn/tase2014/reg.htm ------------------------------------ ORGANIZING COMMITTE ------------------------------------ GENERAL CHAIR Jifeng He (East China Normal University, China) PROGRAM CO-CHAIRS Ji Wang (National University of Defense Technology, China) Martin Leucker (University of Lubeck, Germany) STEERING COMMITTE Keijiro Araki (Kyushu University, Japan) Shengchao Qin (Teesside University, UK) Jifeng He (East China Normal University, China) Huibiao Zhu (East China Normal University, China) Michael Hinchey (Lero, Ireland) ORGANIZING CHAIR Wei Dong (National University of Defense Technology, China) ----------------------------- INVITED SPEAKERS ----------------------------- - Klaus Havelund (NASA JPL, USA) Data Automata in Scala - Axel Legay (INRIA, France) PLASMA-lab: a Flexible, Distributable Statistical Model Checking Library - Kwangkeun Yi (Seoul National University, Korea) Sound, Precise, and Scalable Static Analysis ------------------------------------ FURTHER INFORMATION ------------------------------------ More information about TASE 2014 is available from the symposium web site: http://www.nudt.edu.cn/tase2014/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From stefan.wehr at gmail.com Tue Jul 22 12:39:42 2014 From: stefan.wehr at gmail.com (Stefan Wehr) Date: Tue, 22 Jul 2014 14:39:42 +0200 Subject: [Haskell] Call for participation: Haskell tutorial at CUFP on 4 Sep 2014 Message-ID: Dear Haskellers, I'll be giving an advanced Haskell tutorial as part of the CUFP 2014 workshop. * Date/time: 4 Sep 2014, 9:00 AM - 12:30 PM * Place: Gothenburg, Sweden (affiliated with ICFP 2014) * Early registration deadline: 3 Aug 2014! The tutorial teaches important techniques for writing correct, robust, scalable, and fast Haskell programs. The topics covered are: network programming, serialization, persistence, logging, performance, scalability, testing, and concurrency. The tutorial aims at programmers with some Haskell experience. It is not necessary to be an Haskell expert, but you should know how to write functions and data types. For more details, see http://cufp.org/2014/t2-stefan-wehr-haskell-in-the-real-world.html Registration page: https://regmaster4.com/2014conf/ICFP14/register.php Please distribute this call for participation. See you in Gothenburg! Stefan From ms at chalmers.se Thu Jul 24 13:27:20 2014 From: ms at chalmers.se (Mary Sheeran) Date: Thu, 24 Jul 2014 15:27:20 +0200 Subject: [Haskell] FHPC 2014 (and reminder about ICFP early reg) Message-ID: The programme for the Workshop on Functional High Performance Computing (Sept. 4 immediately after ICFP) is available at https://sites.google.com/site/fhpcworkshops/fhpc-2014/programme It will be a very enjoyable workshop so please consider attending. This is also a reminder that the last day for early registration at ICFP and associated workshops is August 3. Online registration for both ICFP and FHPC starts here: https://regmaster4.com/2014/ICFP14/ic01code/regsystem.php?control=register with best wishes Mary Sheeran -------------- next part -------------- An HTML attachment was scrubbed... URL: From erdweg at informatik.tu-darmstadt.de Thu Jul 24 15:19:37 2014 From: erdweg at informatik.tu-darmstadt.de (Sebastian Erdweg) Date: Thu, 24 Jul 2014 17:19:37 +0200 Subject: [Haskell] Call for Talk Proposals: Domain-Specific Language Design and Implementation 2014 Message-ID: <3EB62709-212C-4BB3-A8DD-4B753213D74B@informatik.tu-darmstadt.de> ********************************************************************* CALL FOR TALK PROPOSALS DSLDI 2014 Second Workshop on Domain-Specific Language Design and Implementation October 20/21, 2014 Portland, USA Co-located with SPLASH/OOPSLA http://2014.splashcon.org/track/dsldi2014 ********************************************************************* Deadline for talk proposals: August 27, 2014 If designed and implemented well, domain-specific languages (DSLs) combine the best features of general-purpose programming languages (e.g., performance) with high productivity (e.g., ease of programming). *** Workshop Goal *** The goal of the DSLDI workshop is to bring together researchers and practitioners interested in sharing ideas on how DSLs should be designed, implemented, supported by tools, and applied in realistic application contexts. We are both interested in discovering how already known domains such as graph processing or machine learning can be best supported by DSLs, but also in exploring new domains that could be targeted by DSLs. More generally, we are interested in building a community that can drive forward the development of modern DSLs. *** Workshop Format *** DSLDI is a single-day workshop and will consist of a series of short talks whose main goal is to trigger exchange of opinion and discussions. The talks should be on the topics within DSLDI's area of interest, which include but are not limited to the following ones: * DSL implementation techniques, including compiler-level and runtime-level solutions * utilization of domain knowledge for driving optimizations of DSL implementations * utilizing DSLs for managing parallelism and hardware heterogeneity * DSL performance and scalability studies * DSL tools, such as DSL editors and editor plugins, debuggers, refactoring tools, etc. * applications of DSLs to existing as well as emerging domains, for example graph processing, image processing, machine learning, analytics, robotics, etc. * practitioners reports, for example descriptions of DSL deployment in a real-life production setting *** Call for Submissions *** We solicit talk proposals in the form of short abstracts (max. 2 pages). A good talk proposal describes an interesting position, demonstration, or early achievement. The submissions will be reviewed on relevance and clarity, and used to plan the mostly interactive sessions of the workshop day. Publication of accepted abstracts and slides on the website is voluntary. * Deadline for talk proposals: August 27, 2014 * Notification: September 12, 2014 * Workshop: October 19 or 20, 2014 * Submission website: https://www.easychair.org/conferences/?conf=dsldi2014 *** Workshop Organization *** Organizers * Sebastian Erdweg, TU Darmstadt, Germany * Adam Welc, Oracle Labs, USA Program committee * Martin Erwig, Oregon State University, USA * Matthew Flatt, University of Utah, USA * Klaus Ostermann, University of Marburg, Germany * Tiark Rompf, EPFL/Oracle Labs, Switzerland * Tijs van der Storm, CWI, Netherlands * Juha-Pekka Tolvanen, University of Jyv?skyl?/Metacase, Finland * Emina Torlak, University of California, Berkeley, USA * Laurence Tratt, King's College London, UK * Markus V?lter, itemis/independent, Germany * Guido Wachsmuth, TU Delft, Netherlands _______________________________________________ ecoop-info mailing list ecoop-info at ecoop.org http://web.satd.uma.es/mailman/listinfo/ecoop-info From hongseok00 at gmail.com Thu Jul 24 16:48:58 2014 From: hongseok00 at gmail.com (Hongseok Yang) Date: Thu, 24 Jul 2014 17:48:58 +0100 Subject: [Haskell] HOPE 2014 Call for Participation (with Workshop Program) Message-ID: ---------------------------------------------------------------------- CALL FOR PARTICIPATION HOPE 2014 The 3rd ACM SIGPLAN Workshop on Higher-Order Programming with Effects August 31, 2014 Gothenburg, Sweden (the day before ICFP 2014) https://www.mpi-sws.org/~neelk/hope2014/ ---------------------------------------------------------------------- HOPE 2014 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. ------------ Registration ------------ Deadline for early registration: 3 August 2014 Web site: https://regmaster4.com/2014conf/ICFP14/register.php This is the registration site for ICFP 2014 and all the affiliated workshops including HOPE 2014. ------------ Invited Talk ------------ Title: Verifying Security Properties of SES Programs Speaker: Philippa Gardner, Imperial College London ---------------------- List of Accepted Talks ---------------------- (1) Stevan Andjelkovic. Towards indexed algebraic effects and handlers (2) Kwok Cheung. Separating Entangled State (3) Filip Sieczkowski and Lars Birkedal. ModuRes: a Coq Library for Reasoning about Concurrent Higher-Order Imperative Programming Languages (4) Ohad Kammar. Graphical algebraic foundations for monad stacks (5) Paul Downen and Zena M. Ariola. Delimited control with multiple prompts in theory and practice (6) Carter Schonwald. A Type Directed model of Memory Locality and the design of High Performance Array APIs (7) Georg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Derek Dreyer and Viktor Vafeiadis. Compositional Compiler Verification via Parametric Simulation (8) Danel Ahman and Tarmo Uustalu. From stateful to stackful computation --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. --------------------- Workshop Organization --------------------- Program Co-Chairs: Neel Krishnaswami (University of Birmingham) Hongseok Yang (University of Oxford) Program Committee: Zena Ariola (University of Oregon) Ohad Kammar (University of Cambridge) Ioannis Kassios (ETH Zurich) Naoki Kobayashi (University of Tokyo) Paul Blain Levy (University of Birmingham) Aleks Nanevski (IMDEA) Scott Owens (University of Kent) Sam Staton (Radboud University Nijmegen) Steve Zdancewic (University of Pennsylvania) -------------- next part -------------- An HTML attachment was scrubbed... URL: From agocorona at gmail.com Sat Jul 26 01:34:17 2014 From: agocorona at gmail.com (Alberto G. Corona ) Date: Sat, 26 Jul 2014 03:34:17 +0200 Subject: [Haskell] ANNOUNCE: hplayground: haskell client-side web framework Message-ID: hplayground [1] is a haskell framework that compiles to JavaScript with the haste [5] compiler. It handles reactive effects under a applicative-monad that controls the modifications of the user interface. It is quite easy to create dynamic, composable applications using ordinary, beatiful, idiomatic haskell without special constructions. Rather than a framework, it is an EDSL. Full reinversion of control avoid spagetty event handlers and the monad confines the events and their effects to the subtree where they appear avoiding the problems of declarative reactive frameworks. There are examples running[4] the source code is in [1] And there is a todo reference application [3] running [2] too. There is also a blog post about that[7] Additionally, the syntax is almost identical to the formlet widgets in MFlow[6]. So most of the hplaygroud code could run also in a server if javascript is disabled. But MFlow and hplayground are completely independent projects. I hope that you enjoy it as much as I enjoyed the development of it. A big thanks to Anton Ekblad for his wonderful Haste compiler. [1] https://github.com/agocorona/hplayground [2] http://mflowdemo.herokuapp.com/todo.html [3] https://github.com/agocorona/hplay-todo [4] http://mflowdemo.herokuapp.com/noscript/wiki/browserwidgets [5] http://http://haste-lang.org/ [6] http://hackage.haskell.org/package/MFlow [7] http://haskell-web.blogspot.com.es/2014/07/hplayground-translate-your-console.html -- Alberto. From cnn at cs.au.dk Sun Jul 27 12:59:07 2014 From: cnn at cs.au.dk (Jacob Johannsen) Date: Sun, 27 Jul 2014 14:59:07 +0200 Subject: [Haskell] PPDP 2014: Program and 2nd Call for Participation Message-ID: <53D4F79B.7010704@cs.au.dk> ====================================================================== CALL FOR PARTICIPATION: PPDP 2014 16th International Symposium on Principles and Practice of Declarative Programming Canterbury, Kent, September 8-10, 2014 http://users-cs.au.dk/danvy/ppdp14/ co-located with LOPSTR 2014 24th International Symposium on Logic-Based Program Synthesis and Transformation Canterbury, Kent, September 9-11, 2014 http://www.iasi.cnr.it/events/lopstr14/ ====================================================================== Two weeks left for early registration (until August 8): http://www.cs.kent.ac.uk/events/2014/ppdp-lopstr-14/ A significant discount is available when registering to both events, especially as a student (until August 8). PPDP 2014 features * an invited talk by Roberto Giacobazzi, shared with LOPSTR: "Obscuring Code -- Unveiling and Veiling Information in Programs" * no fewer than 4 distilled tutorials by - Henrik Nilsson and Ivan Perez: "Declarative Game Programming" - Danko Ilik: "Proofs in Continuation-Passing Style: normalization of G?del's System T extended with sums and delimited control operators" - Jerzy Karczmarczuk: "On the Declarative Structure of Quantum Concepts: States and Observables" - Ralf Laemmel, Andrei Varanovich, and Martin Leinberger: "Declarative Software Development" * the most influential paper 10-year award for PPDP 2004 Tentative program: ========== Monday 8 September Welcome to PPDP 2014 - 08:45-09:00 Olaf Chitil and Andy King Distilled Tutorial - 9:00-10:00 Ralf Laemmel "Declarative Software Development" Break - 10:00-10:15 Session - 10:15-11:15 10:15-10:45 R?mi Douence and Nicolas Tabareau "Lazier Imperative Programming" 10:45-11:15 Stefan Mehner, Daniel Seidel, Lutz Stra?burger and Janis Voigtl?nder "Parametricity and Proving Free Theorems for Functional-Logic Languages" Break - 11:15-11:30 Session - 11:30-12:30 11:30:-12:00 Paul Tarau "Bijective Collection Encodings and Boolean Operations with Hereditarily Binary Natural Numbers" 12:00-12:30 Flavio Cruz, Ricardo Rocha and Seth Goldstein "Design and implementation of a multithreaded virtual machine for executing linear logic programs" Lunch break - 12:30-14:00 Distilled tutorial - 14:00-15:00 Danko Ilik "Proofs in Continuation-Passing Style: normalization of G?del's System T extended with sums and delimited control operators" Break - 15:00-15:15 Session - 15:15-16:15 15:15-15:45 Kenichi Asai, Luminous Fennell, Peter Thiemann and Yang Zhang "A Type Theoretic Specification for Partial Evaluation" 15:45-16:15 Paul Downen, Luke Maurer, Zena Ariola and Daniele Varacca "Continuations, Processes, and Sharing" Break - 16:15-16:30 Session - 16:30-17:30 16:30-17:00 Pierre Neron "Partial Inlining for Program Transformation" 17:00-17:30 Jean-Louis Giavitto and Jos? Echeveste "Real-Time Matching of Antescofo Temporal Patterns" Program-chair report - 17:30-17:45 Olivier Danvy ---------- Tuesday 9 September Distilled tutorial - 9:00-10:00 Jerzy Karczmarczuk "On the Declarative Structure of Quantum Concepts: States and Observables" Break - 10:00-10:15 Session - 10:15-11:15 10:15-10:45 Jos? Meseguer and Salvador Lucas "Proving Operational Termination of Declarative Programs in General Logics" 10:45-11:15 Fan Yang, Santiago Escobar, Catherine Meadows, Jos? Meseguer and Paliath Narendran "Theories of Homomorphic Encryption, Unification, and the Finite Variant Property" Break - 11:15-11:30 Session - 11:30-12:30 11:30:-12:00 Tzu-Chun Chen, Mariangiola Dezani-Ciancaglini and Nobuko Yoshida "On the Preciseness of Subtyping in Session Types" 12:00-12:30 Hugo Pacheco, Tao Zan and Zhenjiang Hu "BiFluX: A Bidirectional Functional Update Language for XML" Lunch break - 12:30-14:00 Distilled tutorial - 14:00-15:00 Henrik Nilsson "Declarative Game Programming" Break - 15:00-15:15 Session - 15:15-16:15 15:15-15:45 Francisco Ferreira and Brigitte Pientka "Bidirectional Elaboration of Dependently Typed Programs" 15:45-16:15 Steven Ramsay "Exact Intersection Type Abstractions for Safety Checking of Recursion Schemes" Break - 16:15-16:30 Session - 16:30-17:30 16:30-17:00 Julian Kranz and Axel Simon "Structure-Preserving Compilation: Efficient Integration of Functional DSLs into Legacy Systems" 17:00-17:30 Ulrich Sch?pp "Organising Low-Level Programs using Higher Types" ---------- Wednesday 10 September Invited talk - 9:00-10:00 Roberto Giacobazzi Obscuring Code -- Unveiling and Veiling Information in Programs Break - 10:00-10:15 Session - 10:15-11:15 10:15-10:45 R?my Haemmerl? "On Combining Backward and Forward Chaining in Constraint Logic Programming" 10:45-11:15 Nataliia Stulova, Jose F. Morales and Manuel V. Hermenegildo "Assertion-based Debugging of Higher-Order (C)LP Programs" Break - 11:15-11:30 Session - 11:30-12:30 11:30:-12:00 Takahito Aoto and Sorin Stratulat "Decision Procedures for Proving Inductive Theorems without Induction" 12:00-12:30 Joachim Jansen, Ingmar Dasseville, Jo Devriendt and Gerda Janssens "Experimental Evaluation of a State-of-the-Art Grounder" Lunch break - 12:30-13:30 Session - 13:30-14:30 13:30:-14:00 Tom Schrijvers, Nicolas Wu, Benoit Desouter and Bart Demoen "Heuristics entwined with handlers combined" 14:00-14:30 James Cheney, Amal Ahmed and Umut Acar "Database queries that explain their work" ========== Also, please note a change of dates: LOPSTR will start on September 9, rather than September 10 as previously announced. See you in Canterbury! From rvconference at gmail.com Mon Jul 28 19:16:42 2014 From: rvconference at gmail.com (Runtime Verification) Date: Mon, 28 Jul 2014 21:16:42 +0200 Subject: [Haskell] RV 2014: Call for Participation Message-ID: ****************************************************************** CALL FOR PARTICIPATION RV 2014: 14th International Conference on Runtime Verification September 22 - September 25, 2014, Toronto, Canada http://rv2014.imag.fr ****************************************************************** ***************** OVERVIEW ***************** Runtime verification is concerned with monitoring and analysis of software and hardware system executions. Runtime verification techniques are important for system correctness, reliability, and robustness; they are complementary to conventional testing, and more practical than exhaustive formal verification. Runtime verification can be used prior to deployment, for testing, verification, and debugging purposes, and after deployment for ensuring reliability, safety, and security and for providing fault containment and recovery as well as online system repair. Topics of interest to the conference include: - specification languages - specification mining - program instrumentation - monitor construction techniques - logging, recording, and replay - fault detection, localization, containment, recovery and repair - program steering and adaptation - metrics and statistical information gathering - combination of static and dynamic analyses - program execution visualization - monitoring techniques for safety/mission-critical systems - monitoring distributed systems, cloud services, and big data applications - monitoring security and privacy policies Application areas of runtime verification include safety/mission-critical systems, enterprise and systems software, autonomous and reactive control systems, health management and diagnosis systems, and system security and privacy. ***************** INVITED TALKS ***************** - *Kevin Driscoll* Fellow at Honeywell Labs, USA *Murphy Strikes Again* - *Assaf Schuster* Professor of Computer Science, Computer Science Department, Technion, Israel *Monitoring Big, Distributed, Streaming Data* - *Jeannette Wing* President's Professor of Computer Science, Computer Science Department, Carnegie Mellon University, USA *Formal Methods: An Industrial Perspective* ***************** INVITED TUTORIALS ***************** - *Vijay K. Garg & Neeraj Mittal* UT at Austin & UT at Dallas *A Lattice-Theoretic Approach to Monitoring Distributed Computations* - *David Basin & Felix Klaedtke* ETH-Zurich & NEC Labs, Europe *Runtime Monitoring and Enforcement of Security Policies* ***************** VENUE ***************** The Fields Institute for Research in Mathematical Sciences 222 College Street, Toronto, Ontario, Canada http://www.fields.utoronto.ca/ ***************** REGISTRATION ***************** Registration on line to Aug. 21, on site Sept. 22 Registration fees $575, after Aug. 21 $675 Student $350, after Aug. 21, $450 Fees include proceedings and 1x Conference banquet Additional banquet tickets $80 Registration link: http://www.fields.utoronto.ca/programs/scientific/14-15/RV2014/ ***************** ACCEPTED PAPERS ***************** - Pierre Fraigniaud, Sergio Rajsbaum and Corentin Travers. On the Number of Opinions Needed for Fault-Tolerant Run-Time Monitoring in Distributed Systems - Simon Varvaressos, Kim Lavoie, Sebastien Gaboury and Sylvain Hall?. Multiple Ways to Fail: Generalizing a Monitor's Verdict for the Classification of Execution Traces - Clemens Ballarin. Two Generalisations of Ro?u and Chen's Trace Slicing Algorithm A - Martin Hentschel, Richard Bubel and Reiner H?hnle. Symbolic Execution Debugger (SED) - Jiannan Zhai, Nigamanth Sridhar and Jason Hallstrom. Supporting the Specification and Runtime Validation of Asynchronous Calling Patterns in Reactive Systems - Emmanouil Koukoutos and Viktor Kuncak. Checking Data Structure Properties Orders of Magnitude Faster - Maria Christakis, Patrick Emmisberger and Peter M?ller. Dynamic Test Generation with Static Fields and Initializers - Aravind Sukumaran-Rajam, Juan Manuel Martinez Caamano, Willy Wolff, Alexandra Jimborean and Philippe Clauss. Speculative Program Parallelization with Scalable and Decentralized Runtime Verification - Christian Colombo and Yli?s Falcone. Organising LTL Monitors over Distributed Systems with a Global Clock - Erdal Mutlu, Vladimir Gajinov, Adrian Cristal, Serdar Tasiran and Osman Unsal. Dynamic Verification for Hybrid Concurrent Programming Models - Hsi-Ming Ho, Joel Ouaknine and James Worrell. Online Monitoring of Metric Temporal Logic - David Basin, Germano Caronni, Sarah Ereth, Mat?? Harvan, Felix Klaedtke and Heiko Mantel. Scalable Offline Monitoring - David Basin, Felix Klaedtke, Srdjan Marinovic and Eugen Zalinescu. On Real-time Monitoring with Imprecise Timestamps - Anand Yeolekar. Improving dynamic inference with variable dependence graph - Ming Chai and Holger Schlingloff. Monitoring Systems with Extended Live Sequence Charts - Laura Bozzelli and C?sar S?nchez. Foundations of Boolean Stream Runtime Verification - Mitra Tabaei Befrouei, Chao Wang and Georg Weissenbacher. Abstraction and Mining of Traces to Explain Concurrency-Bugs - Stefan Mitsch and Andr? Platzer. ModelPlex: Verified Runtime Validation of Verified Cyber-Physical System Models - Johannes Geist, Kristin Y. Rozier and Johann Schumann. Runtime Observer Pairs and Bayesian Network Reasoners On-board FPGAs: Flight-Certifiable System Health Management for Embedded Systems - Malte Isberner, Falk Howar and Bernhard Steffen The TTT Algorithm: A Redundancy-Free Approach to Active Automata Learning - Kim Lavoie, Corentin Leplongeon, Simon Varvaressos, Sebastien Gaboury and Sylvain Hall?. Portable Runtime Verification with Smartphones and Optical Codes - Adel Dokhanchi, Bardh Hoxha and Georgios Fainekos On-Line Monitoring for Temporal Logic Robustness - Jeff Huang, Cansu Erdogan, Yi Zhang, Brandon Moore, Qingzhou Luo, Aravind Sundaresan and Grigore Rosu. ROSRV: Runtime Verification for Robots - Qingzhou Luo, Yi Zhang, Choonghwan Lee, Dongyun Jin, Patrick Meredith, Traian Serbanuta and Grigore Rosu. RV-Monitor: Efficient Parametric Runtime Verification with Simultaneous Properties - Duc Hiep Chu, Joxan Jaffar and Vijayaraghavan Murali. Lazy Symbolic Execution for Enhanced Learning - Kuei Sun, Daniel Fryer, Ashvin Goel, Dai Qin and Angela Demke Brown. Robust Consistency Checking for Modern Filesystems - Ayoub Nouri, Balaji Raman, Marius Bozga, Axel Legay and Saddek Bensalem. Faster Statistical Model Checking by Means of Abstraction and Learning ***************** CHAIRS AND ORGANIZERS ***************** - General Chair: Sebastian Fischmeister (University of Waterloo, Canada). - PC co-Chairs: - Borzoo Bonakdarpour (McMaster University, Canada) - Scott Smolka (Stony Brook Universtiy, USA) - Tools Track Chair: Ezio Bartocci (TU Vienna, Austria) - Runtime Monitoring Competition Co-Chairs: - Ezio Bartocci (TU Vienna, Austria) - Borzoo Bonakdarpour (McMaster University, Canada) - Ylies Falcone (Universit? Joseph Fourier, France) - Publicity Chair: Ylies Falcone (Universit? Joseph Fourier, France) - Local Arrangements Chair: Patrick Lam (University of Waterloo, Canada) ***************** FURTHER INFORMATION ***************** More information about RV2014 is available from the conference web site: http://rv2014.imag.fr -------------- next part -------------- An HTML attachment was scrubbed... URL: From mark.lentczner at gmail.com Tue Jul 29 03:31:48 2014 From: mark.lentczner at gmail.com (Mark Lentczner) Date: Mon, 28 Jul 2014 20:31:48 -0700 Subject: [Haskell] early adopters rejoyce! Haskell Platform 2014.2.0.0 Release Candidate 2 Message-ID: The long anticipated Haskell Platform 2014.2 release, including GHC 7.8.3, and numerous updated packages, is almost here! We have created "Release Candidate 2" installers for OS X and Windows, and believe, barring show stopper issues, creepers exploding, or unexpected trips to the nether, these will likely be blessed as the final by the end of the week. If you would like to be an early adopter, please try 'em out... - source tarball: haskell-platform-2014.2.0.0-RC2.tar.gz - source repo: haskell/haskell-platform at 2014.2.0.0-RC2 - windows 32bit: hskellPlatform-2014.2.0.0-i386-RC2-setup.exe - windows 64bit:hskellPlatform-2014.2.0.0-x86_64-RC2-setup.exe - os x 64bit: Haskell Platform 2014.2.0.0 64bit RC2.signed.pkg - travis-ci build: haskell/haskell-platform *Short Notes for RC2, read these if nothing else:* *General* - includes GHC 7.8.3 - includes long awaited updates to OpenGL & GLUT packages - most other packages brought up to date (or nearly so) - website is still woefully out of date... will work on it this week *Windows* *Extra thanks to Randy Polen for burning the midnight-oil to get ths out* - removed unneeded python (et al) files from the GHC bindist for 64-bit Windows (referenced in GHC ticket #9014 ) - added HTML "view source" pages for the GHC packages that was missing from the GHC bindist for both 32- and 64-bit Windows. *Mac OS X* *If you installed RC1 or older versions of the platform, you can remove them first with the command *sudo uninstall-hs only 7.8.3 --remove *Run it without *--remove* to see what it will do first, it if you like. You can also just install this one right on top of RC1. If you have older 7.8.3 installs from other distributions (bindist, built from src, etc...) you may want to manually remove them first... YMMV.**. Yoda says: "When doubt you have, the $PATH examine, you must!"* - works on 10.6! and 10.7, 10.8, and 10.9; with gcc or clang based Xcodes - works on 10.10!!! (Yosemite, developer preview 4 release) - works with clang out of the box, and haddock build issues with clang, fixed. *N.B.: If you have hand installed cabal 1.20, please be sure it uses Cabal 1.20.0.2 to fix the haddock issue. The platform on OS X includes cabal 1.18, using 1.18.1.4, which fixes the problem.* *Source tarball* - uses new build machinery... all the kinks may not be worked out, and not all build featuers (notably a --prefix command) are implemented yet. This doesn't affect the content of the Platform, though. - generic *nix builds, and specific distribution builds are forth coming (though feel free to chip in and help!) *Longer Notes for RC2:* *General* - Built with the new shake based build system - cgi package not included as it doesn't build under 7.8, and no word from the maintainer in quite some time - hscolour is included as a tool, mostly as it is used to build the platform itself on win and mac... but technically it isn't part of the platform - the haskell-platform package itself is not in these releases... it never contained anything other than dependencies. *Windows* - The Haskell Platform now provides a native Windows 64-bit installation (haskell-platform issue #54 ) - All included packages built without --enable-split-objs (GHC 7.8 FAQ ) - All included packages built without --enable-shared (GHC ticket #8228 ) - If other Haskell Platform installations are detected during the installation of Haskell Platform 2014.2.0.0, a warning is displayed to the user that this is not recommended since problems will arise due to how the PATH is used in many cases to find ancillary build tools - Using ghci to build an executable that links against a DLL may result in numerous warnings about symbols (GHC ticket #9297 ) - The Haskell Platform for Windows, both 32-bit and 64-bit, now includes an updated version of the OpenGL Utility Toolkit (GLUT) from the FreeGLUT project, utilizing the pre-built distribution from http://www.transmissionzero.co.uk/software/freeglut-devel/ with the MinGW build (freeglut-MinGW-2.8.1-1.mp.zip). (haskell-platform issue #81 ) *Mac OS X* - file layout on the Mac has improved. In particular, executables are now installed directly in $prefix/bin dirs, rather than within the package dir - Distributed with a build of 7.8.3 that differs from the released bindist in two ways: a) it was built split-objs for smaller resulting executables, b) it includes Cabal-1.18.1.4 which fixes a particularly nasty problem with haddock, -XCPP, and clang based systems. This ghc-7.8.3 bindist is available as well: - ghc-7.8.3-x86_64-apple-darwin-r3.tar.bz2 - haddocks finally cross link between packages correctly - includes a new experimental activate-hs command that can switch between multiple installed versions of the platform - includes a slightly updated uninstall-hs command - the cabal command is wrapped to provide a smoother file layout on the Mac... the wrapping only updates the ~/.cabal/config file the first time you run it.. please pay attention to its output - if you have a custom config file, you'll want to update it, as Cabal's defaults have changed *Timetable* - End of this week (from my vacation, I'll point out), we'll declare success and rename the files. ? Mark *SHA-256 sums :* 62f39246ad95dd2aed6ece5138f6297f945d2b450f215d074820294310e0c48a Haskell Platform 2014.2.0.0 64bit RC2.signed.pkg 7c7d3585e89e1407461efea29dcaa9628c3be3c47d93a13b5a4978046375e4fd haskell-platform-2014.2.0.0-RC2.tar.gz 6eedd76aafb266d9a09baff80cd2973498ab59195c771f7cd64425d40be29c49 hskellPlatform-2014.2.0.0-i386-RC2-setup.exe b22115ed84d1f7e747d7f0b47e32e1489e4a24613d69c91df4ae32052f88b130 hskellPlatform-2014.2.0.0-x86_64-RC2-setup.exe -------------- next part -------------- An HTML attachment was scrubbed... URL: From tarmo at cs.ioc.ee Tue Jul 29 15:22:22 2014 From: tarmo at cs.ioc.ee (Tarmo Uustalu) Date: Tue, 29 Jul 2014 18:22:22 +0300 (EEST) Subject: [Haskell] ETAPS 2015 1st call for papers Message-ID: ****************************************************************** CALL FOR PAPERS: ETAPS 2015 18th European Joint Conferences on Theory And Practice of Software London, UK, 11-18 April 2015 http://www.etaps.org/2015 ****************************************************************** -- ABOUT ETAPS -- ETAPS is the primary European forum for academic and industrial researchers working on topics relating to software science. ETAPS, established in 1998, is a confederation of six main annual conferences, accompanied by satellite workshops. ETAPS 2015 is the eighteenth event in the series. -- MAIN CONFERENCES (13-17 April) -- * CC: Compiler Construction (PC chair Bj?rn Franke, University of Edinburgh, UK) * ESOP: European Symposium on Programming (PC chair Jan Vitek, Northeastern University, USA) * FASE: Fundamental Approaches to Software Engineering (PC chairs Alexander Egyed, Johannes Kepler U Linz, Austria, and Ina Schaefer, Technische Universit?t Braunschweig, Germany) * FOSSACS: Foundations of Software Science and Computation Structures (PC chair Andrew Pitts, University of Cambridge, UK) * POST: Principles of Security and Trust (PC chairs Riccardo Focardi, Universit? Ca' Foscari Venezia, Italy, and Andrew Myers, Cornell University, USA) * TACAS: Tools and Algorithms for the Construction and Analysis of Systems (PC chairs Christel Baier, Technische Univ Dresden, Germany, and Cesare Tinelli, The University of Iowa, USA) TACAS '14 hosts the 4rd Competition on Software Verification (SV-COMP). -- INVITED SPEAKERS -- * Unifying speakers: Robert Harper (Carnegie Mellon University, USA) Catuscia Palamidessi (INRIA Saclay and LIX, France) * CC invited speaker: Keshav Pingali (University of Texas, USA) * FoSSaCS invited speaker: Frank Pfenning (Carnegie Mellon University, USA) * TACAS invited speaker: Wang Yi (Uppsala Universitet, Sweden) -- IMPORTANT DATES -- * 10 October 2014: Submission deadline for abstracts * 17 October 2014: Submission deadline for full papers * 3-5 December 2014: Author response period (ESOP and FoSSaCS only) * 19 December 2014: Notification of acceptance * 16 January 2015: Camera-ready versions due -- SUBMISSION INSTRUCTIONS -- ETAPS conferences accept two types of contributions: research papers and tool demonstration papers. Both types will appear in the proceedings and have presentations during the conference. ESOP and FoSSaCS accept only research papers. TACAS has more paper categories (see http://www.etaps.org/2015/tacas). A condition of submission is that, if the submission is accepted, one of the authors attends the conference to give the presentation. Submitted papers must be in English presenting original research. They must be unpublished and not submitted for publication elsewhere. In particular, simultaneous submission of the same contribution to multiple ETAPS conferences is forbidden. The proceedings will be published in the Advanced Research in Computing and Software Science (ARCoSS) subline of Springer's Lecture Notes in Computer Science series. Papers must follow the formatting guidelines specified by Springer at http://www.springer.de/comp/lncs/authors.html and be submitted electronically in pdf through the EasyChair author interface of the respective conference (HotCRP for ESOP). Submissions not adhering to the specified format and length may be rejected immediately. - Research papers FASE, FOSSACS and TACAS have a page limit of 15 pages for research papers, whereas CC, POST allow at most 20 pages and ESOP 25 pages. Additional material intended for the referees but not for publication in the final version - for example, details of proofs - may be placed in a clearly marked appendix that is not included in the page limit. ETAPS referees are at liberty to ignore appendices and papers must be understandable without them. In addition to regular research papers, TACAS solicits also case study papers (at most 15 pages). Both TACAS and FASE solicit also regular tool papers (at most 15 pages). - Tool demonstration papers Submissions should consist of two parts: * The first part, at most 4 pages, should describe the tool presented. Please include the URL of the tool (if available) and provide information that illustrates the maturity and robustness of the tool. (This part will be included in the proceedings.) * The second part, at most 6 pages, should explain how the demonstration will be carried out and what it will show, including screen dumps and examples. (This part will be not be included in the proceedings, but will be evaluated. ESOP and FOSSACS do not accept tool demonstration papers. TACAS has a page limit of 6 pages for tool demonstrations. -- SATELLITE EVENTS (11-12 April, 18 April) -- Around 20 satellite workshops will take place before and after the main conferences. -- HOST CITY -- London, the capital city of England and the UK, is a leading global city, with strengths in the arts, commerce, education, entertainment, fashion, finance, healthcare, media, professional services, research and development, tourism and transport all contributing to its prominence. It is one of the world's leading financial centers and a world cultural capital. It is the world's most-visited city as measured by international arrivals and has the world's largest city airport system measured by passenger traffic. In 2012, London became the first city to host the modern Summer Olympic Games three times. -- HOST INSTITUTION -- ETAPS 2015 is hosted by the School of Electrical Engineering and Computer Science of the Queen Mary University of London. The main campus is located in the Mile End area of the East End of London. -- ORGANIZERS * General chairs: Pasquale Malacaria, Nikos Tzevelekos * Workshops chair: Paulo Oliva -- FURTHER INFORMATION -- Please do not hesitate to contact the organizers at p.malacaria at qmul.ac.uk, nikos.tzevelekos at qmul.ac.uk. From oleg at okmij.org Thu Jul 31 01:14:15 2014 From: oleg at okmij.org (oleg at okmij.org) Date: Wed, 30 Jul 2014 21:14:15 -0400 (EDT) Subject: [Haskell] The ML Family workshop: program and the 2nd call for participation Message-ID: <20140731011415.79099C381C@www1.g3.pair.com> Higher-order, Typed, Inferred, Strict: ACM SIGPLAN ML Family Workshop Thursday September 4, 2014, Gothenburg, Sweden Call For Participation and Program http://okmij.org/ftp/ML/ML14.html Early registration deadline is August 3. Please register at https://regmaster4.com/2014conf/ICFP14/register.php The workshop is conducted in close cooperation with the OCaml Users and Developers Workshop http://ocaml.org/meetings/ocaml/2014/ taking place on September 5. *** Program with short summaries *** (The online version links to the full 2-page abstracts) * Welcome 09:00 * Session 1: Module Systems 09:10 - 10:00 1ML -- core and modules as one (Or: F-ing first-class modules) Andreas Rossberg We propose a redesign of ML in which modules are first-class values. Functions, functors, and even type constructors are one and the same construct. Likewise, no distinction is made between structures, records, or tuples, including tuples over types. Yet, 1ML does not depend on dependent types, and its type structure is expressible in terms of plain System F-omega, in a minor variation of our F-ing modules approach. Moreover, it supports (incomplete) Hindley/Milner-style type inference. Both is enabled by a simple universe distinction into small and large types. Type-level module aliases: independent and equal Jacques Garrigue; Leo White We promote the use of type-level module aliases, a trivial extension of the ML module system, which helps avoiding code dependencies, and provides an alternative to strengthening for type equalities. * Session 2: Beyond Hindley-Milner 10:30 - 11:20 The Rust Language and Type System (Demo) Felix Klock; Nicholas Matsakis Rust is a new programming language for developing reliable and efficient systems. It is designed to support concurrency and parallelism in building applications and libraries that take full advantage of modern hardware. Rust's static type system is safe and expressive and provides strong guarantees about isolation, concurrency, and memory safety. Rust also offers a clear performance model, making it easier to predict and reason about program efficiency. One important way it accomplishes this is by allowing fine-grained control over memory representations, with direct support for stack allocation and contiguous record storage. The language balances such controls with the absolute requirement for safety: Rust's type system and runtime guarantee the absence of data races, buffer overflows, stack overflows, and accesses to uninitialized or deallocated memory. In this demonstration, we will briefly review the language features that Rust leverages to accomplish the above goals, focusing in particular on Rust's advanced type system, and then show a collection of concrete examples of program subroutines that are efficient, easy for programmers to reason about, and maintain the above safety property. Doing web-based data analytics with F# (Informed Position) Tomas Petricek; Don Syme With type providers that integrate external data directly into the static type system, F# has become a fantastic language for doing data analysis. Rather than looking at F# features in isolation, this paper takes a holistic view and presents the F# approach through a case study of a simple web-based data analytics platform. * Session 3: Verification 11:40 - 12:30 Well-typed generic smart-fuzzing for APIs (Experience report) Thomas Braibant; Jonathan Protzenko; Gabriel Scherer In spite of recent advances in program certification, testing remains a widely-used component of the software development cycle. Various flavors of testing exist: popular ones include unit testing, which consists in manually crafting test cases for specific parts of the code base, as well as quickcheck-style testing, where instances of a type are automatically generated to serve as test inputs. These classical methods of testing can be thought of as internal testing: the test routines access the internal representation of the data structures to be checked. We propose a new method of external testing where the library only deals with a module interface. The data structures are exported as abstract types; the testing framework behaves like regular client code and combines functions exported by the module to build new elements of the various abstract types. Any counter-examples are then presented to the user. Furthermore, we demonstrate that this methodology applies to the smart-fuzzing of security APIs. Improving the CakeML Verified ML Compiler Ramana Kumar; Magnus O. Myreen; Michael Norrish; Scott Owens The CakeML project comprises a mechanised semantics for a subset of Standard ML and a formally verified compiler. We will discuss our plans for improving and applying CakeML in four directions: optimisations, new primitives, a library, and verified applications. * Session 4: Implicits 14:00 - 14:50 Implicits in Practice (Demo) Nada Amin; Tiark Rompf Popularized by Scala, implicits are a versatile language feature that are receiving attention from the wider PL community. This demo will present common use cases and programming patterns with implicits in Scala. Modular implicits Leo White; Fr?d?ric Bour We propose a system for ad-hoc polymorphism in OCaml based on using modules as type-directed implicit parameters. * Session 5: To the bare metal 15:10 - 16:00 Metaprogramming with ML modules in the MirageOS (Experience report) Anil Madhavapeddy; Thomas Gazagnaire; David Scott; Richard Mortier In this talk, we will go through how MirageOS lets the programmer build modular operating system components using a combination of functors and metaprogramming to ensure portability across both Unix and Xen, while preserving a usable developer workflow. Compiling SML# with LLVM: a Challenge of Implementing ML on a Common Compiler Infrastructure Katsuhiro Ueno; Atsushi Ohori We report on an LLVM backend of SML#. This development provides detailed accounts of implementing functional language functionalities in a common compiler infrastructure developed mainly for imperative languages. We also describe techniques to compile SML#'s elaborated features including separate compilation with polymorphism, and SML#'s unboxed data representation. * Session 6: No longer foreign 16:30 - 18:00 A Simple and Practical Linear Algebra Library Interface with Static Size Checking (Experience report) Akinori Abe; Eijiro Sumii While advanced type systems--specifically, dependent types on natural numbers--can statically ensure consistency among the sizes of collections such as lists and arrays, such type systems generally require non-trivial changes to existing languages and application programs, or tricky type-level programming. We have developed a linear algebra library interface that guarantees consistency (with respect to dimensions) of matrix (and vector) operations by using generative phantom types as fresh identifiers for statically checking the equality of sizes (i.e., dimensions). This interface has three attractive features in particular. (i) It can be implemented only using fairly standard ML types and its module system. Indeed, we implemented the interface in OCaml (without significant extensions like GADTs) as a wrapper for an existing library. (ii) For most high-level operations on matrices (e.g., addition and multiplication), the consistency of sizes is verified statically. (Certain low-level operations, like accesses to elements by indices, need dynamic checks.) (iii) Application programs in a traditional linear algebra library can be easily migrated to our interface. Most of the required changes can be made mechanically. To evaluate the usability of our interface, we ported to it a practical machine learning library (OCaml-GPR) from an existing linear algebra library (Lacaml), thereby ensuring the consistency of sizes. SML3d: 3D Graphics for Standard ML (Demo) John Reppy The SML3d system is a collection of libraries designed to support real-time 3D graphics programming in Standard ML (SML). This paper gives an overview of the system and briefly highlights some of the more interesting aspects of its design and implementation. * Poster presentation, at the joint poster session with the OCaml workshop Nullable Type Inference Michel Mauny; Benoit Vaugon We present a type system for nullable types in an ML-like programming language. We start with a simple system, presented as an algorithm, whose interest is to introduce the formalism that we use. We then extend it as system using subtyping constraints, that accepts more programs. We state the usual properties for both systems. This is work in progress. Program Committee Kenichi Asai Ochanomizu University, Japan Matthew Fluet Rochester Institute of Technology, USA Jacques Garrigue Nagoya University, Japan Dave Herman Mozilla, USA Stefan Holdermans Vector Fabrics, Netherlands Oleg Kiselyov (Chair) University of Tsukuba, Japan Keiko Nakata Tallinn University of Technology, Estonia Didier Remy INRIA Paris-Rocquencourt, France Zhong Shao Yale University, USA Hongwei Xi Boston University, USA From dstcruz at gmail.com Thu Jul 31 03:40:34 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 30 Jul 2014 21:40:34 -0600 Subject: [Haskell] Haskell Weekly News: Issue 300 Message-ID: Welcome to issue 300 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from July 13 to 26, 2014 Looks like we are chuck-full of goodies this time around! Enjoy! Quotes of the Week * Cale: Functions aren't monads, the type constructor (->) e is a monad * glguy: There's no achievement for using all the operators * benmachine: adoption by lots of people may stunt progress of haskell, but it will probably help the progress of people Top Reddit Stories * Somehow, this happened. Haskell Ryan Gosling. Domain: haskellryangosling.tumblr.com, Score: 144, Comments: 31 Original: [1] http://goo.gl/IQ2f3s On Reddit: [2] http://goo.gl/H24aRa * Papers every haskeller should read Domain: self.haskell, Score: 104, Comments: 35 Original: [3] http://goo.gl/R7uGSB On Reddit: [4] http://goo.gl/R7uGSB * Strict Language Pragma Proposal Domain: ghc.haskell.org, Score: 86, Comments: 95 Original: [5] http://goo.gl/Yq28yt On Reddit: [6] http://goo.gl/BlmXpA * Announcing engine-io and socket-io for Haskell Domain: ocharles.org.uk, Score: 81, Comments: 7 Original: [7] http://goo.gl/PGW8Y8 On Reddit: [8] http://goo.gl/IsGRGi * The Haskell Cast #8 - Ollie Charles on 24 Days of Hackage and Nix Domain: haskellcast.com, Score: 70, Comments: 12 Original: [9] http://goo.gl/jBc9bk On Reddit: [10] http://goo.gl/syhwPd * Blazing Fast HTML - Virtual DOM in Elm Domain: elm-lang.org, Score: 60, Comments: 28 Original: [11] http://goo.gl/3luwtw On Reddit: [12] http://goo.gl/88zNkZ * Idris 0.9.14 released, with updated JavaScript backend, quasiquotes, and lots of internal cleanups and improvements Domain: idris-lang.org, Score: 55, Comments: 11 Original: [13] http://goo.gl/wmW3RM On Reddit: [14] http://goo.gl/fN28z6 * hoodle 0.3 released - free pen note taking program Domain: ianwookim.org, Score: 53, Comments: 15 Original: [15] http://goo.gl/jauFC On Reddit: [16] http://goo.gl/upMnf6 * This just in, from my local GHC/Cabal checkout... (re: Cabal Hell) Domain: self.haskell, Score: 52, Comments: 13 Original: [17] http://goo.gl/tD2yOg On Reddit: [18] http://goo.gl/tD2yOg * Haskell for all: Equational reasoning at scale Domain: haskellforall.com, Score: 52, Comments: 29 Original: [19] http://goo.gl/BZtZ4R On Reddit: [20] http://goo.gl/xKxCM3 * Complete roadmap from total novice to Haskell mastery? Domain: self.haskell, Score: 50, Comments: 74 Original: [21] http://goo.gl/5y1lXA On Reddit: [22] http://goo.gl/5y1lXA * Write webservices around databases with 0 boilerplate: announcing servant 0.1 Domain: alpmestan.com, Score: 50, Comments: 16 Original: [23] http://goo.gl/vzz8aT On Reddit: [24] http://goo.gl/qTty6u * Mutable Algorithms in Immutable Languages, Part 3 Domain: tel.github.io, Score: 49, Comments: 2 Original: [25] http://goo.gl/uG5Bds On Reddit: [26] http://goo.gl/qrdk6Y * Best Practices for Avoiding Cabal Hell Domain: softwaresimply.blogspot.com, Score: 47, Comments: 13 Original: [27] http://goo.gl/OqG241 On Reddit: [28] http://goo.gl/fapyz2 * Applicative (Make) vs Monadic (Shake) build systems Domain: neilmitchell.blogspot.co.uk, Score: 47, Comments: 7 Original: [29] http://goo.gl/CPyzpd On Reddit: [30] http://goo.gl/2eW8Ed * Nemnem - Haskell source hyperlinker Domain: robinp.github.io, Score: 41, Comments: 33 Original: [31] http://goo.gl/2msbLR On Reddit: [32] http://goo.gl/R6hBOl * Let me tell you about the types of data Domain: tel.github.io, Score: 41, Comments: 51 Original: [33] http://goo.gl/ZjJelo On Reddit: [34] http://goo.gl/bbmXSW * Lens Tutorial - Introduction (part 1) Domain: blog.jakubarnold.cz, Score: 39, Comments: 11 Original: [35] http://goo.gl/yQRoPY On Reddit: [36] http://goo.gl/fnbZ0F * Help - I wrote some Haskell code, it works, but it's slower than Python. What did I do wrong? Domain: self.haskell, Score: 39, Comments: 43 Original: [37] http://goo.gl/CG13CR On Reddit: [38] http://goo.gl/CG13CR * IntrinsicSuperclasses for Haskell (new proposal for default superclass instances by Conor McBride) Domain: ghc.haskell.org, Score: 37, Comments: 10 Original: [39] http://goo.gl/vDYUQh On Reddit: [40] http://goo.gl/vZjHXS * hackage-diff: Compare the public API of different versions of a Hackage library Domain: self.haskell, Score: 37, Comments: 32 Original: [41] http://goo.gl/y682CB On Reddit: [42] http://goo.gl/y682CB * How do you avoid the Cabal Hell?? Domain: self.haskell, Score: 36, Comments: 30 Original: [43] http://goo.gl/9uS54H On Reddit: [44] http://goo.gl/9uS54H * Edward Kmett on Hask Domain: youtu.be, Score: 35, Comments: 34 Original: [45] http://goo.gl/1lfywk On Reddit: [46] http://goo.gl/D0AuFQ * Mutable Algorithms in Immutable Languages, Part 2 Domain: tel.github.io, Score: 33, Comments: 1 Original: [47] http://goo.gl/g0ylvT On Reddit: [48] http://goo.gl/jwwr87 * Multi-instance packages status report Domain: permalink.gmane.org, Score: 32, Comments: 7 Original: [49] http://goo.gl/JSPx39 On Reddit: [50] http://goo.gl/2rzPJL * Slides from Conan Elliott's workshop on Denotational Design: from meanings to programs Domain: conal.net, Score: 32, Comments: 6 Original: [51] http://goo.gl/GwO4Fv On Reddit: [52] http://goo.gl/0u9KVl * Reactive-banana anti-tutorial Domain: gelisam.blogspot.ca, Score: 31, Comments: 23 Original: [53] http://goo.gl/D7mv4X On Reddit: [54] http://goo.gl/shMY0N * Intro to Machines & Arrows Part 2: 'Auto' as Category, Applicative & Arrow, ft. locally stateful compositions; Further down the road to an Arrowized FRP implementation. Domain: blog.jle.im, Score: 28, Comments: 9 Original: [55] http://goo.gl/xkwocR On Reddit: [56] http://goo.gl/phqXn8 Top StackOverflow Questions * Examples of histomorphisms in Haskell votes: 16, answers: 2 Read on SO: [57] http://goo.gl/ZmGzI6 * Plan B, or what's the opposite of Maybe's >>=? votes: 15, answers: 2 Read on SO: [58] http://goo.gl/rYWlzQ * Let-renaming function breaks code votes: 14, answers: 2 Read on SO: [59] http://goo.gl/R9CGyL * Pattern matching on rank-2 type votes: 14, answers: 3 Read on SO: [60] http://goo.gl/s0IszK * Haskell algorithm advice and suggestions for alternate solutions votes: 14, answers: 1 Read on SO: [61] http://goo.gl/2l23N8 * Why can't Haskell be tricked into performing IO operations by using strict evaluation? votes: 14, answers: 2 Read on SO: [62] http://goo.gl/Ey9795 * How does lifting (in a functional programming context) relate to category theory? votes: 14, answers: 1 Read on SO: [63] http://goo.gl/esTTbO Until next time, [64]+Daniel Santa Cruz References 1. http://haskellryangosling.tumblr.com/ 2. http://www.reddit.com/r/haskell/comments/2avnc0/somehow_this_happened_haskell_ryan_gosling/ 3. http://www.reddit.com/r/haskell/comments/2blsqa/papers_every_haskeller_should_read/ 4. http://www.reddit.com/r/haskell/comments/2blsqa/papers_every_haskeller_should_read/ 5. https://ghc.haskell.org/trac/ghc/wiki/StrictPragma 6. http://www.reddit.com/r/haskell/comments/2bi69g/strict_language_pragma_proposal/ 7. https://ocharles.org.uk/blog/posts/2014-07-13-announcing-socket-io-for-haskell.html 8. http://www.reddit.com/r/haskell/comments/2aks91/announcing_engineio_and_socketio_for_haskell/ 9. http://www.haskellcast.com/episode/008-ollie-charles-on-24-days-of-hackage-and-nix/ 10. http://www.reddit.com/r/haskell/comments/2bbc82/the_haskell_cast_8_ollie_charles_on_24_days_of/ 11. http://elm-lang.org/blog/Blazing-Fast-Html.elm 12. http://www.reddit.com/r/haskell/comments/2bam6p/blazing_fast_html_virtual_dom_in_elm/ 13. http://www.idris-lang.org/idris-0-9-14-released/ 14. http://www.reddit.com/r/haskell/comments/2aw6vl/idris_0914_released_with_updated_javascript/ 15. http://ianwookim.org/hoodle/ 16. http://www.reddit.com/r/haskell/comments/2aotln/hoodle_03_released_free_pen_note_taking_program/ 17. http://www.reddit.com/r/haskell/comments/2b7odl/this_just_in_from_my_local_ghccabal_checkout_re/ 18. http://www.reddit.com/r/haskell/comments/2b7odl/this_just_in_from_my_local_ghccabal_checkout_re/ 19. http://www.haskellforall.com/2014/07/equational-reasoning-at-scale.html 20. http://www.reddit.com/r/haskell/comments/2b7xwx/haskell_for_all_equational_reasoning_at_scale/ 21. http://www.reddit.com/r/haskell/comments/2ali12/complete_roadmap_from_total_novice_to_haskell/ 22. http://www.reddit.com/r/haskell/comments/2ali12/complete_roadmap_from_total_novice_to_haskell/ 23. http://alpmestan.com/posts/2014-07-26-announcing-servant.html 24. http://www.reddit.com/r/haskell/comments/2bs536/write_webservices_around_databases_with_0/ 25. http://tel.github.io/2014/07/15/mutable_algorithms_in_immutable_languages_part_3/ 26. http://www.reddit.com/r/haskell/comments/2ase1q/mutable_algorithms_in_immutable_languages_part_3/ 27. http://softwaresimply.blogspot.com/2014/07/haskell-best-practices-for-avoiding.html 28. http://www.reddit.com/r/haskell/comments/2ameew/best_practices_for_avoiding_cabal_hell/ 29. http://neilmitchell.blogspot.co.uk/2014/07/applicative-vs-monadic-build-systems.html 30. http://www.reddit.com/r/haskell/comments/2blex3/applicative_make_vs_monadic_shake_build_systems/ 31. http://robinp.github.io/nemnem/ 32. http://www.reddit.com/r/haskell/comments/2ata3n/nemnem_haskell_source_hyperlinker/ 33. http://tel.github.io/2014/07/23/types_of_data/ 34. http://www.reddit.com/r/haskell/comments/2bj7it/let_me_tell_you_about_the_types_of_data/ 35. http://blog.jakubarnold.cz/2014/07/14/lens-tutorial-introduction-part-1.html 36. http://www.reddit.com/r/haskell/comments/2ap02f/lens_tutorial_introduction_part_1/ 37. http://www.reddit.com/r/haskell/comments/2brxwp/help_i_wrote_some_haskell_code_it_works_but_its/ 38. http://www.reddit.com/r/haskell/comments/2brxwp/help_i_wrote_some_haskell_code_it_works_but_its/ 39. https://ghc.haskell.org/trac/ghc/wiki/IntrinsicSuperclasses 40. http://www.reddit.com/r/haskell/comments/2avs16/intrinsicsuperclasses_for_haskell_new_proposal/ 41. http://www.reddit.com/r/haskell/comments/2b5jfd/hackagediff_compare_the_public_api_of_different/ 42. http://www.reddit.com/r/haskell/comments/2b5jfd/hackagediff_compare_the_public_api_of_different/ 43. http://www.reddit.com/r/haskell/comments/2al3vx/how_do_you_avoid_the_cabal_hell/ 44. http://www.reddit.com/r/haskell/comments/2al3vx/how_do_you_avoid_the_cabal_hell/ 45. http://youtu.be/Klwkt9oJwg0 46. http://www.reddit.com/r/haskell/comments/2b3rk5/edward_kmett_on_hask/ 47. http://tel.github.io/2014/07/13/mutable_algorithms_in_immutable_languages_part_2/ 48. http://www.reddit.com/r/haskell/comments/2al4cw/mutable_algorithms_in_immutable_languages_part_2/ 49. http://permalink.gmane.org/gmane.comp.lang.haskell.ghc.devel/5413 50. http://www.reddit.com/r/haskell/comments/2bbys6/multiinstance_packages_status_report/ 51. http://conal.net/talks/lambdajam-2014.pdf 52. http://www.reddit.com/r/haskell/comments/2brioe/slides_from_conan_elliotts_workshop_on/ 53. http://gelisam.blogspot.ca/2014/07/reactive-banana-anti-tutorial.html 54. http://www.reddit.com/r/haskell/comments/2auswf/reactivebanana_antitutorial/ 55. http://blog.jle.im/entry/auto-as-category-applicative-arrow-intro-to-machines 56. http://www.reddit.com/r/haskell/comments/2aot3i/intro_to_machines_arrows_part_2_auto_as_category/ 57. http://stackoverflow.com/questions/24884475/examples-of-histomorphisms-in-haskell 58. http://stackoverflow.com/questions/24902463/plan-b-or-whats-the-opposite-of-maybes 59. http://stackoverflow.com/questions/24724738/let-renaming-function-breaks-code 60. http://stackoverflow.com/questions/24744294/pattern-matching-on-rank-2-type 61. http://stackoverflow.com/questions/24748750/haskell-algorithm-advice-and-suggestions-for-alternate-solutions 62. http://stackoverflow.com/questions/24775528/why-cant-haskell-be-tricked-into-performing-io-operations-by-using-strict-evalu 63. http://stackoverflow.com/questions/24856963/how-does-lifting-in-a-functional-programming-context-relate-to-category-theory 64. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From mark.lentczner at gmail.com Thu Jul 31 20:48:05 2014 From: mark.lentczner at gmail.com (Mark Lentczner) Date: Thu, 31 Jul 2014 16:48:05 -0400 Subject: [Haskell] Haskell Platform 2014.2.0.0 Release Candidate 3 Message-ID: Small update to the Haskell Platfrom 2014.2.0.0 release: We have new Release Candidate 3 versions of the source tarball... and a new generic-linux bindist of the platform! - source tarball: haskell-platform-2014.2.0.0-srcdist-RC3.tar.gz - generic linux: haskell-platform-2014.2.0.0-unknown-linux-x86_64-RC3.tar.gz *Windows and OS X users: There are no RC3 versions - as the RC2 versions seem to be holding up fine!* *General* - hptool (and hence ./platform.sh script) take a new --prefix parameter that is used for generic (non-OS X, non-Windows) builds: It sets the root under which haskell installations are located. Defaults to /usr/local/haskell. Everything will be placed in a directory named ghc-7.8.3- under this prefix. - activate-hs script for default Posix-like builds - small fixes to allow bootstrapping the platform with GHC 7.4 - README and LICENSE updated *Source Tarball* - all missing pieces now present - build platfrom from source tarball verified *Generic Linux Binary Dist* - Built from the GHC's generic Linux bindist for Deb 7 style systems - Complete tarball: this is all you need to install Haskell on a compatible system - Built on Ubuntu 12.04LTS - Tested on Ubuntu 14 - my system needed a symlink from libgmp.so to libgmp.so.10 - this seems to be an issue with the GHC bindist built components To install this: cd / sudo tar xvf ~/haskell-platform-2014.2.0.0-unknown-linux-x86_64-RC3.tar.gz sudo /usr/local/haskell/ghc-7.8.3-x8_64/bin/activate-hs This will finish the package registration, and install symlinks from /usr/local/bin for all the standard haskell command line tools. ? Mark *shasum -a 256:* ab759ec50618f2604163eca7ad07e50c8292398a2d043fdc1012df161b2eb89a haskell-platform-2014.2.0.0-srcdist-RC3.tar.gz 0da6879ae657481849e7ec4e5d3c4c035e090824167f97434b48af297ec17cf9 haskell-platform-2014.2.0.0-unknown-linux-x86_64-RC3.tar.gz -------------- next part -------------- An HTML attachment was scrubbed... URL: