Call for Participation: HaL8 - Haskell in Leipzig (Germany), June 21

Hal8 - Haskell in Leipzig, June 21.

visit the workshop web site for program and registration:

http://www.bioinf.uni-leipzig.de/conference-registration/13haskell

See you - Johannes Waldmann.

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

[sven <at> tbi.univie.ac.at: Open PhD Position]

Hello everybody,

please find attached the description of a newly opened PhD position in
bioinformatics at our group in Vienna.

Mit freundlichem Gruss,
Christian

From: Sven Findeiss <sven <at> tbi.univie.ac.at>
Subject: Open PhD Position
Date: 2013-05-02 10:39:02 GMT

Dear Colleagues, Friends and Project Partners!

We have currently a three year PhD position open at Bioinformatics and
Computational Biology research group (which is one half of Ivo
Hofackers double professorship and integrated in the well known
TBI). The project is EU funded and starts in September this year. For
more information please find attached a detailed job description.

If you are interested please don't hesitate to contact me.

Please forward this message to everyone who might be looking for a PhD

Haskell programmer job / cloud content management

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

Haskell Weekly News: Issue 267

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

Invitation to connect on LinkedIn

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

recursion patterns?

Well, my question does not meet the standards for a question at stackoverflow:

(I am a haskell beginner)

This example is from LYAH:

    import System.Random

    finiteRandoms :: (RandomGen g, Random a, Num n) => n -> g -> ([a], g)  
    finiteRandoms 0 gen = ([], gen)  
    finiteRandoms n gen =   
        let (value, newGen) = random gen  
            (restOfList, finalGen) = finiteRandoms (n-1) newGen  
        in  (value:restOfList, finalGen)  

Looking at that function, I find it impossible to understand how that recursion works.  I have to pull out a
pencil and paper to figure it out.  If I was given the task of writing that function, I would write it like this:

    import System.Random

    finiteRands :: (RandomGen g, Random a) => Int -> g -> [a]
    finiteRands n gen = finiteRands' n gen []

    finiteRands' :: (RandomGen g, Random a) => Int -> g -> [a] -> [a]
    finiteRands' 0 _ acc = acc
    finiteRands' n gen acc = 
    	let (rand_num, new_gen) = random gen 
    	in finiteRands' (n-1) new_gen (rand_num:acc)

To me, it makes the function(s) simplistic to understand.  Is the first solution a known 'design pattern' in
recursion?  The first solution:

    import System.Random

    finiteRandoms :: (RandomGen g, Random a, Num n) => n -> g -> ([a], g)  
    finiteRandoms 0 gen = ([], gen)  
    finiteRandoms n gen =   
        let (value, newGen) = random gen  
            (restOfList, finalGen) = finiteRandoms (n-1) newGen  
        in  (value:restOfList, finalGen)  

seems to operate a bit like foldr: the recursion spins to the base case, and the base case's return value,
([], gen), is passed back through all the function calls.  Each function call modifies the tuple (the in
clause) before returning it to the previous function call.

Is one solution more efficient than the other?  I believe my solution is tail recursive, but it's my
understanding that compilers can now optimize just about anything into tail recursion.

Thanks.

ACM SIGPLAN Erlang Workshop 2013 Second Call For Papers

   Hello,

   Please find below the Second Call for Papers for the Twelfth ACM
SIGPLAN Erlang Workshop.

   Apologies for any duplicates you may receive.

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

Twelfth ACM SIGPLAN Erlang Workshop
-----------------------------------------------------------

Boston, Massachusetts, September 28, 2013 (tentative date, subject to change)
Satellite event of the 18th ACM SIGPLAN International Conference on
Functional Programming (ICFP 2013)
September 25-27, 2013

Erlang is a concurrent, distributed functional programming language
aimed at systems with requirements of massive concurrency, soft real
time response, fault tolerance, and high availability. It has been
available as open source for 15 years, creating a community that
actively contributes to its already existing rich set of libraries and
applications. Originally created for telecom applications, its usage
has spread to other domains including e-commerce, banking, databases,
and computer telephony and messaging.

Erlang programs are today among the largest applications written in
any functional programming language. These applications offer new
opportunities to evaluate functional programming and functional
programming methods on a very large scale and suggest new problems for
the research community to solve.

This workshop will bring together the open source, academic, and
industrial programming communities of Erlang. It will enable
participants to familiarize themselves with recent developments on new
techniques and tools tailored to Erlang, novel applications, draw
lessons from users' experiences and identify research problems and
common areas relevant to the practice of Erlang and functional
programming.

We invite three types of submissions.

1. Technical papers describing language extensions, critical
discussions of the status quo, formal semantics of language
constructs, program analysis and transformation, virtual machine
extensions and compilation techniques, implementations and interfaces
of Erlang in/with other languages, and new tools (profilers, tracers,
debuggers, testing frameworks, etc.). The maximum length for technical
papers is restricted to 12 pages.

2. Practice and application papers describing uses of Erlang in the
"real-world", Erlang libraries for specific tasks, experiences from
using Erlang in specific application domains, reusable programming
idioms and elegant new ways of using Erlang to approach or solve a
particular problem. The maximum length for the practice and
application papers is restricted to 12 pages. Note that this is a
maximum length; we welcome shorter papers also, and the program
committee will evaluate all papers on an equal basis independent of
their lengths.

3. Poster presentations describing topics related to the workshop
goals. Each includes a maximum of 2 pages of the abstract and summary.
Presentations in this category will be given an hour of shared
simultaneous demonstration time.

Workshop Chair
-----------------------
Steve Vinoski, Basho Technologies, USA

Program Chair
-------------------
Laura M. Castro, University of  A Coruña, Spain

Program Committee
-----------------------------
(Note: the Workshop and Program Chairs are also committee members)

Lars-Ake Fredlund, Universidad Politécnica de Madrid, Spain
Kevin Hammond, University of St. Andrews, UK
Torben Hoffman, Erlang Solutions Limited, UK
Zoltán Horváth, Eötvös Loránd University, Hungary
Kenneth Lundin, Ericsson AB, Sweden
Mickaël Rémond, ProcessOne, France
Kenji Rikitake, Basho Japan KK, Japan
Simon Thompson, University of Kent, UK

Important Dates
-----------------------
Submission deadline: Fri June 14, 2013
Author notification: Thu July 11, 2013
Final submission for the publisher: Thu July 25, 2013
Workshop date (tentative, subject to change): September 28, 2013

Instructions to authors
--------------------------------
Papers must be submitted online via EasyChair (via the "Erlang2013"
event). The submission page is
https://www.easychair.org/conferences/?conf=erlang2013

Submitted papers should be in portable document format (PDF),
formatted using the ACM SIGPLAN style guidelines.

Each submission must adhere to SIGPLAN's republication policy.
Violation risks summary rejection of the offending submission.
Accepted papers will be published by the ACM and will appear in the
ACM Digital Library.

Paper submissions will be considered for poster submission in the case
they are not accepted as full papers.

Venue & Registration Details
------------------------------------------
For registration, please see the ICFP 2013 web site at:
http://icfpconference.org/icfp2013/

Related Links
--------------------
ICFP 2013 web site: http://www.icfpconference.org/icfp2013/
Past ACM SIGPLAN Erlang workshops: http://www.erlang.org/workshop/
Open Source Erlang: http://www.erlang.org/
EasyChair submission site:
https://www.easychair.org/account/signin.cgi?conf=erlang2013
Author Information for SIGPLAN Conferences:
http://www.sigplan.org/authorInformation.htm

--
Laura M. Castro

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

Assistant Professor in Software Systems

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

ANNOUNCE: Haskell Communities and Activities Report (24th ed., May 2013)

On behalf of all the contributors, I am pleased to announce that the

            Haskell Communities and Activities Report
                   (24th edition, May 2013)

is now available in PDF and HTML formats:

   http://haskell.org/communities/05-2013/report.pdf
   http://haskell.org/communities/05-2013/html/report.html

Many thanks go to all the people that contributed to this report,
both directly, by sending in descriptions, and indirectly, by doing
all the interesting things that are reported. I hope you will find
it as interesting a read as I did.

If you have not encountered the Haskell Communities and Activities
Reports before, you may like to know that the first of these reports
was published in November 2001. Their goal is to improve the
communication between the increasingly diverse groups, projects, and
individuals working on, with, or inspired by Haskell. The idea behind
these reports is simple:

   Every six months, a call goes out to all of you enjoying Haskell to
   contribute brief summaries of your own area of work. Many of you
   respond (eagerly, unprompted, and sometimes in time for the actual
   deadline) to the call. The editor collects all the contributions
   into a single report and feeds that back to the community.

When I try for the next update, six months from now, you might want
to report on your own work, project, research area or group as well.
So, please put the following into your diaries now:

            ========================================
                    End of October 2013:
            target deadline for contributions to the
            November 2013 edition of the HC&A Report
            ========================================

Unfortunately, many Haskellers working on interesting projects are so
busy with their work that they seem to have lost the time to follow
the Haskell related mailing lists and newsgroups, and have trouble even
finding time to report on their work. If you are a member, user or
friend of a project so burdened, please find someone willing to make
time to report and ask them to "register" with the editor for a simple
e-mail reminder in October (you could point me to them as well, and I
can then politely ask if they want to contribute, but it might work
better if you do the initial asking). Of course, they will still have to
find the ten to fifteen minutes to draw up their report, but maybe we
can increase our coverage of all that is going on in the community.

Feel free to circulate this announcement further in order to
reach people who might otherwise not see it. Enjoy!

Janis Voigtlaender
<hcar at haskell.org>

Call for talk proposals: HOPE'13 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'13)

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

Formal Methods/Functional programming job position at Intel

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell