headers
Chris Casinghino | 2 May 2012 17:12
Picon

ANN: HacPhi 2012

Greetings,

I am very pleased to officially announce Hac Phi 2012, a Haskell
hackathon/get-together to be held August 3-5 at the University of
Pennsylvania in Philadelphia.  The hackathon will officially kick
off at 2:30 Friday afternoon, and go until 5pm on Sunday (with
breaks for sleep, of course).  Last year's Hac Phi was a lot of
fun, drawing more than 30 Haskellers, and many people have
already expressed interest in coming back this year.  Come meet
your Haskelly comrades-in-arms!  I want to stress that everyone
is welcome - you do not have to be a Haskell guru.  Helping hack
on someone else's project could be a great way to increase your
Haskell-fu.

If you plan on coming, please officially register [1].
Registration, travel, lodging and many other details can be found
on the Hac Phi wiki [2].  This year, we are making a public list
of attendees' names and nicks - please let us know if you'd
prefer not to be listed when you register.

We're also looking for a few people interested in giving
short (15-20 min.) talks, probably on Saturday afternoon.
Anything of interest to the Haskell community is fair game - a
project you've been working on, a paper, a quick tutorial.  If
you'd like to give a talk, add it on the wiki [3].

Hac Phi 2012 is supported by contributions from Amgen and Jane
Street.

Hope to see you in Philadelphia!
(Continue reading)

Permalink | Reply | 0 comments |
headers
Daniel Santa Cruz | 3 May 2012 04:25
Picon
Gravatar

Haskell Weekly News: Issue 225

  Welcome to issue 225 of the HWN, an issue covering crowd-sourced bits
  of information about Haskell from around the web. This issue covers the
  week of April 22 to 28, 2012.

Announcements

  Matthias Fischmann made a call for participation to the Hong Kong
  Haskell hackathon, with tentative dates of May 11-13 or 25-27. Follow
  to link for more information.
  [1] http://goo.gl/9sRLF

  HacPhi, the hackathon in Philadelphia, Pennsylvania, USA, will be
  held between August 3-5, 2012.
  [2] http://goo.gl/Rm2qH

Quotes of the Week

   * lambdabot was last seen on #haskell 1 hour, 37 minutes and 46
     seconds ago, saying: <IO ()>

   * elliott: oh, it's not haskell-cafe? that explains the reasonable
              responses ["it" = GHC mailing list]

   * Morandat: "The astute reader will have noticed that the above
               example clashes with our claim that R is lexically
               scoped. As is often the case, R is lexically scoped
               up to the point it is not."

   * quicksilver: lisp doesn't have equational reasoning so there is
                  nothing to lose :)
(Continue reading)

Permalink | Reply | 1 comment |
headers
Andres Löh | 7 May 2012 14:29
Favicon

CFP: Workshop on Generic Programming 2012 (co-located with ICFP)

======================================================================
                            CALL FOR PAPERS

                               WGP 2012

            8th ACM SIGPLAN Workshop on Generic Programming
                          Copenhagen, Denmark
                      Sunday, September 9th, 2012

                    http://www.wgp-sigplan.org/2012

                          Co-located with the
    International Conference on Functional Programming (ICFP 2012)
======================================================================

Goals of the workshop
---------------------

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
(Continue reading)

Permalink | Reply | 0 comments |
headers
Marco Morazan | 7 May 2012 19:44
Picon

FINAL CFP: TFPIE 2012

CALL FOR PAPERS/PRESENTATIONS TFPIE 2012
International Workshop on Trends in Functional Programming in Education 2012
June 11 2012
University of St Andrews, Scotland
http://www.cs.ru.nl/P.Achten/TFPIE_2012/TFPIE_2012_home.html

*** NEW: SUBMISSIONS ARE NOW OPENED!
***      The deadline to submit articles/abstracts to TFPIE is May 20
***      See the TFPIE 2012 website for instructions.

The first International Workshop on Trends in Functional Programming
in Education, TFPIE 2012, will be co-located with TFP 2012 at the
University of St Andrews in Scotland. The goal of TFPIE is to gather
researchers, professors, teachers, and all professionals that use or
are interested in the use of functional programming in education.
TFPIE aims to be a venue where novel ideas, classroom-tested ideas,
and work in progress on the use of functional programming in education
are discussed. The one-day workshop will foster a spirit of open
discussion by having a review process for publication after the
workshop.

The program chairs of TFPIE 2012 will screen submissions to ensure
that all presentations are within scope and are of interest to
participants. Potential presenters are invited to submit an extended
abstract (4-6 pages) or an article (up to 16 pages). The authors of
all accepted presentations will have their preprints and their slides
made available on the workshop's website/wiki. Any visitors to the
TFPIE 2012 website/wiki will be able to add comments. This includes
presenters who may respond to comments and questions as well as
provide pointers to improvements and follow-up work. After the
(Continue reading)

Permalink | Reply | 0 comments |
headers
Angus Comber | 9 May 2012 10:24
Picon

Creating a factorial function in GHC

I am trying to create a factorial function in GHC.  I am following the
online learnyouahaskell.com book (specifically types-and-typeclasses
page).

Bear in mind this is my day 1 of learning Haskell.

The book suggests:

factorial :: Integer -> Integer
factorial n = product [1..n]

But if I enter first line then press <Enter> I see:
<interactive>:1:1 Not in scope: 'factorial'

What am I doing wrong?

Angus
Permalink | Reply | 1 comment |
headers
Henning Thielemann | 9 May 2012 10:35
Picon

Re: Creating a factorial function in GHC


On Wed, 9 May 2012, Angus Comber wrote:

> I am trying to create a factorial function in GHC.  I am following the
> online learnyouahaskell.com book (specifically types-and-typeclasses
> page).
>
> Bear in mind this is my day 1 of learning Haskell.

Then beginners <at> haskell.org might be a better place to ask, since
haskell <at> haskell.org is for announcements.

> The book suggests:
>
> factorial :: Integer -> Integer
> factorial n = product [1..n]
>
> But if I enter first line then press <Enter> I see:
> <interactive>:1:1 Not in scope: 'factorial'
>
> What am I doing wrong?

The code you entered is intended to be the content of a text file that can 
be loaded into GHCi or Hugs. If you want to write it immediately into GHCi 
you may write:

Prelude> let factorial :: Integer -> Integer; factorial n = product [1..n]
Permalink | Reply | 0 comments |
headers
Makoto Hamana | 9 May 2012 14:45
Picon

Call for Participation: HOR'12, Nagoya

=====================================================================
                        Call for Participation
          6th International Workshop on Higher-Order Rewriting

                                HOR 2012

                       June 2, 2012, Nagoya, Japan
                          Colocated with RTA'12
                 http://www.cs.gunma-u.ac.jp/events/hor/
======================================================================

HOR is a forum to present work concerning all aspects of higher-order
rewriting. The aim is to provide an informal and friendly setting to discuss
recent work and work in progress concerning higher-order rewriting.

Invited speaker
---------------
* Zhenjiang Hu (National Institute of Informatics, Japan)
  Can Graph Transformation be Bidirectionalized? 
  -- Bidirectional Semantics of Structural Recursion on Graphs --

Special Session: Current Status of Higher-Order Termination Tools
-----------------------------------------------------------------
* Carsten Fuhs: Haskell termination tool
* Rene Thiemann: Isabelle termination tool
* Aoto,Yamada: Simply-typed TRS termination tool
* Cynthia Kop: WANDA, termination tool for AFS 

Accepted papers
---------------
(Continue reading)

Permalink | Reply | 0 comments |
headers
Daniel Santa Cruz | 10 May 2012 00:39
Picon
Gravatar

Haskell Weekly News: Issue 226

Welcome to issue 226 of the HWN, an issue covering crowd-sourced bits
of information about Haskell from around the web. This issue covers the
week of April 29 to May 5, 2012.

Quotes of the Week

   * acowley: I write the most complicated bottoms

   * Cale: OpenGL is the Rubik's Cube of graphics libraries. It's nearly
           impossible to change some things without affecting other things

Top Reddit Stories

   * HJ — Haskell-to-JavaScript compiler (WIP)
     Domain: chrisdone.com, Score: 74, Comments: 23
     On Reddit: [1] http://goo.gl/gP51N
     Original:  [2] http://goo.gl/g32rz

   * Life Without Objects
     Domain: skipoleschris.blogspot.co.uk, Score: 52, Comments: 17
     On Reddit: [3] http://goo.gl/LZmLC
     Original:  [4] http://goo.gl/NLhKH

   * New major release of the containers package
     Domain: blog.johantibell.com, Score: 52, Comments: 25
     On Reddit: [5] http://goo.gl/yjblJ
     Original:  [6] http://goo.gl/DKlmd

   * Haskell and the World: Encodings and the Common Misuse of ByteString
     Domain: a-dimit.blogspot.com, Score: 50, Comments: 27
     On Reddit: [7] http://goo.gl/WloCn
     Original:  [8] http://goo.gl/oeIIW

   * How to write hybrid CPU/GPU programs with Haskell
     Domain: parfunk.blogspot.com.au, Score: 48, Comments: 3
     On Reddit: [9] http://goo.gl/u9A9l
     Original: [10] http://goo.gl/s917R

   * phantom tainting with kind error messages
     Domain: article.gmane.org, Score: 35, Comments: 5
     On Reddit: [11] http://goo.gl/V9qRd
     Original:  [12] http://goo.gl/cx4cD

   * Annotated slides: Comparing Dynamic and Static Language Approaches to 
     Web Frameworks (Rails vs Yesod)
     Domain: cs.kent.ac.uk, Score: 32, Comments: 11
     On Reddit: [13] http://goo.gl/jE2iK
     Original:  [14] http://goo.gl/2dIjQ

   * SPJ talk: Towards Haskell in the Cloud
     Domain: skillsmatter.com, Score: 30, Comments: 16
     On Reddit: [15] http://goo.gl/fVc0e
     Original:  [16] http://goo.gl/NMtPD

   * hotswap -- a simple, high level interface to plugins for hotswapping code
     Domain: hackage.haskell.org, Score: 29, Comments: 8
     On Reddit: [17] http://goo.gl/kvhOS
     Original:  [18] http://goo.gl/VMAe0

   * Online Haskell typechecker
     Domain: haskellonline.org, Score: 29, Comments: 12
     On Reddit: [19] http://goo.gl/uV3HY
     Original:  [20] http://goo.gl/lSwhb

Top StackOverflow Questions

   * Algebraically interpreting polymorphism
     votes: 21, answers: 5
     Read on SO: [21] http://goo.gl/7krnc

   * Absolute value of negative zero - bug, or a part of the floating 
     point standard?
     votes: 16, answers: 3
     Read on SO: [22] http://goo.gl/HDpRc

   * how to implement doubly linked lists
     votes: 10, answers: 1
     Read on SO: [23] http://goo.gl/hXyDM

   * GHC type inference for higher rank types - assigning to monotypes
     votes: 10, answers: 1
     Read on SO: [24] http://goo.gl/TqYtX

   * Communication between Java and Haskell
     votes: 9, answers: 3
     Read on SO: [25] http://goo.gl/zMYwx

   * Default constraint kinds are ignored
     votes: 9, answers: 2
     Read on SO: [26] http://goo.gl/AElL4

   * Scrap Your Boilerplate equivalent in Scala?
     votes: 7, answers: 1
     Read on SO: [27] http://goo.gl/Cd7k4

   * Does the chain function in underscore.js create a monad?
     votes: 7, answers: 1
     Read on SO: [28] http://goo.gl/DUYkB

   * Why do Haskell list comprehensions with multiple generators treat the 
     rightmost generator as the tightest loop?
     votes: 6, answers: 3
     Read on SO: [29] http://goo.gl/BnndW

   * Haskell records, cleaner approach?
     votes: 6, answers: 1
     Read on SO: [30] http://goo.gl/MymyL

Until next time,
Daniel Santa Cruz

References


_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Permalink | Reply | 0 comments |
headers
Clemens Grelck | 10 May 2012 05:59
Picon
Picon
Favicon

FHPC 2012: Workshop on Functional High Performance Computing

========================================================================
                            CALL FOR PAPERS

                               FHPC 2012

                        ACM SIGPLAN Workshop
                                  on
                Functional High Performance Computing

                           Copenhagen, Denmark
                           September 15th, 2012

                      http://www.hiperfit.dk/fhpc12/

  Co-located with the International Conference on Functional Programming
                               (ICFP 2012)
========================================================================

The FHPC workshop aims at bringing together researchers exploring uses
of functional (or more generally, declarative or high-level) programming
technology in application domains where large-scale computations arise
naturally and high performance is essential. Such computations would
typically -- but not necessarily -- involve execution on highly parallel
systems ranging from multi-core multi-processor systems to graphics
accelerators (GPGPUs), reconfigurable hardware (FPGAs), large-scale
compute clusters or any combination thereof. It is becoming apparent
that radically new and well founded methodologies for programming such
systems are required to address their inherent complexity and to
reconcile execution performance with programming productivity.

The aim of the meeting is to enable sharing of results, experiences,
and novel ideas about how high-level, declarative specifications of
computationally challenging problems can serve as highly transparent,
maintainable, and portable code that approaches (or even exceeds) the
performance of machine-oriented imperative implementations.

The 2012 FHPC workshop comes with a particular theme motivated by
geographic co-location with the newly established HIPERFIT Research
Centre for Functional High-Performance Computing for Financial
Information Technology (www.hiperfit.dk) at the University of
Copenhagen. Hence, we particularly encourage submissions with a
background in computational finance. Notwithstanding, the workshop
welcomes submissions from other application domains as much as
general-purpose work on the theory and practice of declarative
approaches to high-performance computing.

Proceedings:
============

Accepted papers will be published by the ACM and will appear in the
ACM Digital Library.

* Submission Deadline:  6th June 2012, anywhere on earth
* Author Notification: 27th June 2012
* Final Papers Due   : 10th July 2012

Submitted papers must be in portable document format (PDF), formatted
according to the ACM SIGPLAN style guidelines (double column, 9pt format).
See http://www.sigplan.org/authorInformation.htm for more information
and style files. The page limit is 12 pages. Any paper submitted must
adhere to ACM SIGPLAN's republication policy. Submission deadlines and
page limit are firm.

Travel Support:
===============

Student attendees with accepted papers can apply for a SIGPLAN PAC grant
to help cover travel expenses. 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 (http://www.sigplan.org/PAC.htm).

Workshop Organizers:
====================

Andrzej Filinski                Clemens Grelck
DIKU                            Informatics Institute
University of Copenhagen        University of Amsterdam
Universitetsparken 1            Science Park 904
2100 Copenhagen                 1098XH Amsterdam
Denmark                         Netherlands
andrzej <at> diku.dk                 c.grelck <at> uva.nl

Tentative Programme Committee:
==============================

Marco Aldinucci     University of Torino, Italy
Manuel Chakravarty  University of New South Wales, Australia
Andrzej Filinski    University of Copenhagen, Denmark (chair)
Clemens Grelck      University of Amsterdam, Netherlands (chair)
Gaetan Hains        University of Paris Est, France
Zhenjiang Hu        National Institute of Informatics, Japan
Mike Giles          Oxford University, UK
Neal Glew           Intel Inc., USA
Ryan Newton         University of Indiana, USA
Satnam Singh        Microsoft Research/University of Birmingham, UK
Phil Trinder        Heriot-Watt Unversity, UK
Viktoria Zsok       Eotvos Lorand University Budapest, Hungary

Workshop Organizers:
====================

Andrzej Filinski                Clemens Grelck
DIKU                            Informatics Institute
University of Copenhagen        University of Amsterdam
Universitetsparken 1            Science Park 904
2100 Copenhagen                 1098XH Amsterdam
Denmark                         Netherlands
andrzej <at> diku.dk                 c.grelck <at> uva.nl

h
--

-- 
----------------------------------------------------------------------
Dr Clemens Grelck                                     Science Park 904
University Lecturer                                   1098XH Amsterdam
                                                            Netherlands
University of Amsterdam
Institute for Informatics                        T +31 (0) 20 525 8683
Computer Systems Architecture Group              F +31 (0) 20 525 7490

Office C3.105                               www.science.uva.nl/~grelck
----------------------------------------------------------------------
Permalink | Reply | 0 comments |
headers
Santiago Escobar | 10 May 2012 16:24
Picon

6th International School on Rewriting (ISR), Valencia, July 16-20, 2012


                   Call for Participation

                          ISR 2012
            6th International School on Rewriting

               http://www.dsic.upv.es/~isr2012

                      July 16th - 20th 
                       Valencia, Spain

          Early registration before June 15, 2012!

Rewriting is a branch of computer science whose origins go back 
to the origins of computer science itself (with Thue, Church, 
Post, and many other prominent researchers). It has strong links 
with mathematics, algebra, and logic, and it is the basis of 
well-known programming paradigms like functional and equational 
programming, which are taught at the universitary level in many 
countries. In these programming paradigms and corresponding 
languages, the notions of reduction, pattern matching, 
confluence, termination, strategy, etc., are essential. 
Rewriting provides a solid framework for understanding, using, 
and teaching all these notions. Rewriting techniques are also 
used in many other areas of software engineering (scripting, 
prototyping, automated transformation of legacy systems, 
refactoring, web services, etc.) and are implemented in popular 
systems like Mathematica, Autocad, and others. Rewriting 
techniques play a relevant role in computing research, 
education, and industry.

Two tracks are offered, including the lectures and the courses:

- Track A: for newcomers in the field, or just for people 
         who want to obtain a new, updated exposure.

* Jose Meseguer. Introduction to Term Rewriting
* Albert Rubio. Termination of Rewriting: Foundations and 
  Automation
* Santiago Escobar. A Rewriting-Based Specification and 
  Programming Language: Maude
* Beatriz Alarcon & Raul Gutierrez. Exercises on Term 
  Rewriting

- Track B: for those who want to get deeper in the most 
         recent developments and applications of rewriting.

* Maria Alpuente: Narrowing Techniques and Applications 
* Temur Kutsia: Matching, unification, and generalizations 
* Pierre Lescanne: Lambda Calculus: extensions and 
  applications 
* Narciso Marti-Oliet: Rewriting Logic and Applications 
* Georg Moser: Automated Complexity Analysis of Term 
  Rewriting Systems 
* Albert Oliveras: SAT and SMT techniques in Proof and 
  Verification 
* Sophie Tison: Tree Automata, Turing Machines and Term 
  Rewriting 
* Xavier Urbain: Certification of Rewriting Properties 
* Andrei Voronkov: Automated Reasoning and Theorem Proving 

For more information, please contact
Salvador Lucas <slucas <at> dsic.upv.es>
Permalink | Reply | 0 comments |

Gmane