- Haskell-Cafe - Haskell.org

[TFP2014] Final Call For Papers
by Peter Achten 11 Mar '14

11 Mar '14

--------------------------------- F I N A L C A L L F O R P A P E R S --------------------------------- ======== TFP 2014 =========== 15th Symposium on Trends in Functional Programming May 26-28, 2014 Utrecht University Soesterberg, The Netherlands http://www.cs.uu.nl/wiki/TFP2014/WebHome *** Submission for TFP 2014 is now open: please direct your browser to *** http://www.cs.uu.nl/wiki/TFP2014/PaperSubmission The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected revised papers will be published as a Springer Lecture Notes in Computer Science (LNCS) volume. TFP 2014 will be the main event of a pair of functional programming events. The other is the International Workshop on Trends in Functional Programming in Education (TFPIE). TFPIE will take place on May 25th. Its website is located at http://www.cs.uwyo.edu/~jlc/tfpie14/ The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, St. Andrews (UK) in 2012 and Provo (Utah, USA) in 2013. For further general information about TFP please see the TFP homepage. INVITED SPEAKERS TFP is pleased to announce talks by the following two invited speakers: John Hughes of Chalmers, Goteborg, Sweden, is well-known as author of Why Functional Programming Matters, and as one of the designers of QuickCheck (together with Koen Claessen); the paper on QuickCheck won the ICFP Most Influential Paper Award in 2010. Currently he divides his time between his professorship and Quviq, a company that performs property-based testing of software with a tool implemented in Erlang. Dr. Geoffrey Mainland received his PhD from Harvard University where he was advised by Greg Morrisett and Matt Welsh. After a two year postdoc with the Programming Principles and Tools group at Microsoft Research Cambridge, he is now an assistant professor at Drexel University. His research focuses on high-level programming language and runtime support for non-general purpose computation. SCOPE The symposium recognizes that new trends may arise through various routes. As part of the Symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarizing work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience-oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Topics suitable for the symposium include: Functional programming and multicore/manycore computing Functional programming in the cloud High performance functional computing Extra-functional (behavioural) properties of functional programs Dependently typed functional programming Validation and verification of functional programs Using functional techniques to reason about imperative/object-oriented programs Debugging for functional languages Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. Interoperability with imperative programming languages Novel memory management techniques Program analysis and transformation techniques Empirical performance studies Abstract/virtual machines and compilers for functional languages (Embedded) domain specific languages New implementation strategies Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2014 program chair, Jurriaan Hage at J.Hage(a)uu.nl. BEST PAPER AWARDS To reward excellent contributions, TFP awards a prize for the best paper accepted for the formal proceedings. TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. In both cases, it is the PC of TFP that awards the prize. In case the best paper happens to be a student paper, that paper will then receive both prizes. FINANCIAL SUPPORT TFP is financially supported by the Department of Information and Computing Sciences of Utrecht University, NWO (Netherlands Organisation for Scientific Research), Well-Typed and Erlang Solutions. PAPER SUBMISSIONS Acceptance of articles for presentation at the symposium is based on a lightweight peer review process of extended abstracts (4 to 10 pages in length) or full papers (16 pages). The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. In the case of a FULL STUDENT paper, the draft paper will receive additional feedback by one of the PC members shortly after the symposium has taken place. For the preproceedings, papers can be in any format (inclduing LNCS, IEEE and ACM style), but papers submitted to the postrefereeing process must be in LNCS style, and are bound by the limitations on paper length. We use EasyChair for the refereeing process. IMPORTANT DATES Submission of draft papers: March 17, 2014 Notification: March 24, 2014 Registration: April 7, 2014 TFP Symposium: May 26-28, 2014 Student papers feedback: June 9th, 2014 Submission for formal review: July 1st, 2014 Notification of acceptance: September 8th, 2014 Camera ready paper: October 8th, 2014 PROGRAM COMMITTEE Peter Achten Radboud University Nijmegen Emil Axelsson Chalmers Lucilia Camarao de Figueiredo Universidade Federal de Ouro Preto Laura Castro University of A Coruna Frank Huch Christian-Albrechts-University of Kiel Matthew Fluet Rochester Institute of Technology Jurriaan Hage (chair) University of Utrecht Yukiyoshi Kameyama University of Tsukuba Andrew Kennedy Microsoft Research Tamas Kozsik Eotvos Lorand University Ben Lippmeier University of New South Wales Luc Maranget INRIA Jay McCarthy (co-chair) Brigham Young University Marco T. Morazan Seton Hall University Ricardo Pena Universidad Complutense de Madrid Alexey Rodriguez LiquidM Sven-Bodo Scholz Heriot-Watt University Manuel Serrano INRIA Sophia Antipolis Simon Thompson University of Kent Tarmo Uustalu Inst of Cybernetics David Van Horn University of Maryland Janis Voigtlaender University of Bonn

1 0

Haskell Hackathon in NYC, April 4-6 (last reminder)
by MightyByte 11 Mar '14

11 Mar '14

Greetings, We're just under a month out from the first Hac NYC, so I wanted to send out one more reminder to the community. For the full details see the previous announcement. http://www.haskell.org/pipermail/haskell-cafe/2014-January/112362.html Once again, if you plan on coming, you must officially register by filling out our registration form [1]. Other details for travel, lodging, etc can be found on the Hac NYC wiki [2]. And if you would like to give a talk, please let us know [3] so we can schedule them. We're looking forward to seeing you here. -The Hac NYC Team [1] https://docs.google.com/forms/d/1taZtjgYozFNebLt1TR2VnKv-ovD2Yv5sOdSZzmi_xF… [2] http://www.haskell.org/haskellwiki/Hac_NYC [3] http://www.haskell.org/haskellwiki/Hac_NYC/Talks

2 1

ANNOUNCE: San Diego Haskell User Group.
by Cesar Lopez 11 Mar '14

11 Mar '14

Hello everyone: I would like to announce the creation and meeting of the *San Diego Haskell User Group*, the first meeting will be held on Wednesday March 19th. 2014 at 60:30PM at MindTouch, Inc's office in downtown San Diego. Please join us! *Information about the group:* The San Diego Haskell User Group aims to bring together academics, hobbyists, and software developers to discuss real world usage of the Haskell programming language. You can follow us on twitter @loshaskelleros<https://twitter.com/loshaskelleros> Information about the first meeting. *Unconference style Haskell meeting #1:* http://www.meetup.com/SanDiegoHUG/events/168606962/ Cheers cesar

1 0

Fwd: On Haskell IDEs
by Michal Antkiewicz 10 Mar '14

10 Mar '14

Vagif, it's all about separation of concerns and low coupling. There's no point adding all possible functionality into GHCi because it'll become too big and most users won't use most of it (ever used MSoft Word?). The ecosystem can be architected in some service-oriented way, in which some tools will be data providers and others will provide some added layers of functionality. That does not imply that all tools will need to maintain their own independent copies of information about the project. There largest overlap, as far as I can see, is between ghc-mod and hdevtools. Both are proofs of concept. Maybe parts could actually be incorporated into GHCi. hsdev seems to be specialized to source file editing and should remain separate but it can use the other ones as data sources (incl. Cabal and GHCi). Re: wasted effort. I don't agree. hdevtools was made to make a point that running a process in the background which maintains data and answers queries is much more responsive to the user than otherwise. And it has proven that point. Now, GHCi can learn that lesson and provide something similar, if that indeed belongs to GHCi's scope. Finally, all this is just speculation since I don't know exactly what the actual overlap among the tools is. It might be smaller than we think. Cheers, Michal On Mon, Mar 10, 2014 at 3:44 PM, Vagif Verdi <vagif.verdi(a)gmail.com> wrote: > Sorry, i meant ghci not cabal. > > As for hsdev, in order to provide its features it will have to load and > keep track of entire project information which is already done by ghc-mod > and hdevtools separately. So you ushould see how much effort is wasted on > doing the same thing again and again in each of 4 different tools (ghci, > ghc-mod, hdevtools and hsdev) > > > On Monday, March 10, 2014 12:32:25 PM UTC-7, Niklas Hambüchen wrote: > >> On 10/03/14 18:41, Vagif Verdi wrote: >> > This is an excellent illustration of how fragmentation in this specific >> > area hurts community. Not only you are forced to use 3 different tools >> > (ghc-mod, hdevtools, cabal) each of which basically provides the same >> > service but in an incompatible and incomplete way. But you decided to >> > create yet another one instead of contributing to the ones you already >> > use (they are all open source) >> >> I'm not sure what you mean to say; ghc-mod and cabal certainly do not do >> the same. Hsdev doesn't either, and claiming that we don't contribute to >> these projects is strange. >> _______________________________________________ >> Haskell-Cafe mailing list >> Haskel...@haskell.org >> http://www.haskell.org/mailman/listinfo/haskell-cafe >> > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > > <mantkiew(a)gsd.uwaterloo.ca> -- Michal Antkiewicz, M.Sc., Ph.D Research Engineer Network for the Engineering of Complex Software-Intensive Systems (NECSIS) University of Waterloo http://gsd.uwaterloo.ca/mantkiew mantkiew(a)gsd.uwaterloo.ca

1 0

[GSOC] haskell-type-exts?
by Andy Morris 10 Mar '14

10 Mar '14

On the GSOC ideas page for haskell.org is haskell-type-exts[1], which—as the name may suggest :)—is a proposal for a typechecker for haskell-src-exts. It doesn't seem to have got much attention, having only a single comment from two years ago, and I haven't seen anyone talking about it here or elsewhere. I guess this is still something that would be useful, so unless anyone has a reason why not, I'd like to apply to do it. I'll probably start working on the application later today unless some objections surface :) (Is Niklas Broberg subscribed to this list? If so: would you still be willing to mentor this project?) [1] https://ghc.haskell.org/trac/summer-of-code/ticket/1620

3 2

Extensible Binary-Meta-Language libraries
by Mateusz Kowalczyk 10 Mar '14

10 Mar '14

Greetings, Does anyone know if there are any libraries to work with Extensible Binary Meta-Language (used by Matroska)? I find mentions of such a thing in IRC logs from years ago by a person going by ‘ksf’ but he/she has disappeared from IRC about 5 weeks ago and I can not find their e-mail address. Is anyone interested in such a library? I am planning to implement it anyway but it'd be nice to know if there's any interest. Thanks -- Mateusz K.

1 0

New Functional Programming Job Opportunities
by Functional Jobs 10 Mar '14

10 Mar '14

Here are some functional programming job opportunities that were posted recently: Developer at Northwestern University http://functionaljobs.com/jobs/8690-developer-at-northwestern-university Cheers, Sean Murphy FunctionalJobs.com

1 0

Fwd: facebook exception
by Corentin Dupont 08 Mar '14

08 Mar '14

Hi, I am posting here in case one of you got this error. It's an old bug in my game that I was never able to solve. I use happstack-authenticate, but when I select facebook to login with, I get: FacebookException {fbeType = " ()", fbeMessage = ""} However, it seems well configured. I put: facebookAuth = Credentials {appName = "Nomyx", appId = "161007670738608", appSecret = <my secret>} On the facebook website, I have the application configured: application Id: 161007670738608 secret key: <my secret> Display Name: Nomyx NameSpace: nomyx-app App Domains: www.nomyx.net URL: http://www.nomyx.net:8000/ Do you have any hints? Thanks a lot!! Corentin <http://www.nomyx.net:8000>

1 0

Re: [Haskell-cafe] Overcome type restrictions?
by Dušan Kolář 07 Mar '14

07 Mar '14

Well, for the case, we even do not need RankNTypes, as the type of the list is known, so newtype Wrap = Wrap { unwrap :: [Wrap] -> Wrap } wself (h:t) = unwr $ unwr h t will work, which is not too far from encoding function into data :-) This solution saves space, of course. Best regards, Dušan On 03/07/2014 10:35 AM, Tobias Brandt wrote: > The problem is, that the type parameter 'a' of the functions in the > list is fixed. You can work around that with RankNTypes: > > newtype Wrap = Wrap { unwrap :: forall a. [a] -> a } > > unwrap $ (\(h:t) -> (unwrap h) t) [Wrap head, Wrap last] > > This specializes the type of the functions at every point of use > separately. > > > On 7 March 2014 09:14, Kolář Dušan <kolar(a)fit.vutbr.cz > <mailto:kolar@fit.vutbr.cz>> wrote: > > Well my fault, the example should have been like this: > > We have and error of infinite type for > Prelude> :t ((\(h:t) -> h t) [head, last, head, last, head, last]) > > Of course, head and tail are incompatible on type level... > > Dušan > > > > On Fri, 07 Mar 2014 07:57:09 +0100, Kolář Dušan > <kolar(a)fit.vutbr.cz <mailto:kolar@fit.vutbr.cz>> wrote: > > : > : > > But we have an error of infinite type construction for > > Prelude> :t ((\(h:t) -> h t) [head,tail, head, tail, head, > tail]) > > Well I can overcome this by encoding functions into data > types and then performing "conversion" back and forth, > nevertheless, is there any way how to overcome this? > > > It seems like you need heterogenous collections[0] > > Regards, > Henk-Jan van Tuyl > > > [0] http://www.haskell.org/haskellwiki/Heterogenous_collections > > > -- > Folding@home > What if you could share your unused computer power to help > find a cure? In just 5 minutes you can join the world's > biggest networked computer and get us closer sooner. Watch the > video. > http://folding.stanford.edu/ > > > http://Van.Tuyl.eu/ > http://members.chello.nl/hjgtuyl/tourdemonad.html > Haskell programming > -- > > > > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org <mailto:Haskell-Cafe@haskell.org> > http://www.haskell.org/mailman/listinfo/haskell-cafe > >

1 0

SystemF, universal quantification, and rigid type variables
by David Rush 07 Mar '14

07 Mar '14

In short, I'm trying to decide if there is a real difference between the types: (forall a.a) -> b a -> b and frankly, I'm not seeing a difference. But ghc apparently does *SystemF.Tests> :t ((\u (x::forall a. a) y -> u x y) (\x y -> y)) True <interactive>:1:49: Couldn't match type `a' with `Bool' `a' is a rigid type variable bound by a type expected by the context: a at <interactive>:1:1 In the second argument of `\ u (x :: forall a. a) y -> u x y', namely `True' In the expression: ((\ u (x :: forall a. a) y -> u x y) (\ x y -> y)) True *SystemF.Tests> Since this is a 'rigid type variable' complaint, I am inclined to think that this is a limitation of ghc, rather than a particular issue with the logic of System F. I'd actually love to be wrong. Is there an actual difference between the types? - david rush

3 3