headers
TFP 2010 | 2 Apr 2010 19:18
Picon
Favicon

TFP 2010 - Final Call: Submission deadline one week away, April 9

TFP 2010: 11th SYMPOSIUM ON TRENDS IN FUNCTIONAL PROGRAMMING
   May 17-19, 2010
   University of Oklahoma
   http://www.cs.ou.edu/tfp2010/    (web search: "tfp 2010")

TFP 2010 is an international forum for researchers with interests in any 
aspect of functional programming.

Papers must be submitted by April 9, one week from today.
Acceptance notifications will go out April 15.
Early (reduced rate) registration closes April 16, two weeks from today.

SUBMISSION and REGISTRATION DEADLINES
   April 9:  Submission deadline
   April 15: Acceptance notification
   April 16: Early registration closes ($350, $200 for students)
   May 7: Late registration deadline ($425)
   May 17-19: TFP Symposium

POST-SYMPOSIUM PROCEEDINGS
   Springer series: Lecture Notes in Computer Science

Details about the event schedule, symposium scope, submissions, and 
registration may be found on the symposium website.
   http://www.cs.ou.edu/tfp2010/   (Web search: "tfp 2010")

In addition to the symposium's stimulating presentations and discussions, 
highlights include an invited talk by J Strother Moore, an outing to view 
the superb collection of art of the American West at the Cowboy Hall of 
Fame, and a festive banquet.
(Continue reading)

Permalink | Reply | 0 comments |
headers
Temur Kutsia | 2 Apr 2010 20:28
Picon

LOPSTR'10: New deadline for extended abstract submission

=========================================================================

              20th International Symposium on
      Logic-Based Program Synthesis and Transformation
                        LOPSTR 2010

   http://www.risc.uni-linz.ac.at/conferences/lopstr2010/
           Hagenberg, Austria, July 23-25, 2010
                 (co-located with PPDP 2010)

=========================================================================

New deadline for extended abstract submission: April 7, 2010
Permalink | Reply | 0 comments |
headers
Venanzio Capretta | 3 Apr 2010 10:06
Picon

MSFP: last call for papers

FINAL CALL FOR PAPERS

Third Workshop on
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
25 September 2010,  Baltimore, USA
A satellite workshop of ICFP 2010

PRESENTATION
The workshop on Mathematically Structured Functional Programming is
devoted to the derivation of functionality from structure. It is a
celebration of the direct impact of Theoretical Computer Science on
programs as we write them today. Modern programming languages, and in
particular functional languages, support the direct expression of
mathematical structures, equipping programmers with tools of remarkable
power and abstraction. Monadic programming in Haskell is the
paradigmatic example, but there are many more mathematical insights
manifest in programs and in programming language design:
Freyd-categories in reactive programming, symbolic differentiation
yielding context structures, and comonadic presentations of dataflow, to
name but three. This workshop is a forum for researchers who seek to
reflect mathematical phenomena in data and control.

The first MSFP workshop was held in Kuressaare, Estonia, in July 2006.
Selected papers were published as a special issue of the Journal of
Functional Programming (volume 19, issue 3-4).
The second MSFP workshop was held in Reykjavik, Iceland as part of ICALP
2008.

INVITED SPEAKERS
Martin Escardo, University of Birmingham, UK
(Continue reading)

Permalink | Reply | 0 comments |
headers
Huibiao Zhu | 3 Apr 2010 10:40
Picon

Call for Papers (UTP 2010)

UTP 2010 - First CALL FOR PAPERS

 

******************************************

* 3rd International Symposium on

* Unifying Theories of Programming

* (UTP 2010)

* 15-16 November 2010, Shanghai, China

* http://www.sei.ecnu.edu.cn/utp2010

*

* For more information email: utp2010 <at> sei.ecnu.edu.cn

******************************************************

 

 

Following on the success of UTP 2006 (County Durham, UK) and

UTP 2008 (Dublin, Ireland), we are pleased to announce the UTP

symposium 2010, to be held in Shanghai, China in November 2010,

co-located with the 12th International Conference on Formal

Engineering Methods (ICFEM 2010).

 

Based on the pioneering work on Unifying Theories of Programming

by Tony Hoare, He Jifeng, and others, the aims of the UTP Symposium

series are to continue to reaffirm the significance of the ongoing

UTP project, to encourage efforts to advance it by providing a

focus for the sharing of results by those already actively

contributing, and to raise awareness of the benefits of such

unifying theoretical frameworks among the wider computer science

and software engineering communities.

 

Of particular interest is how unification may be used to meet the

goals and difficulties to be encountered in the Grand Challenges

of Computing, with particular reference to the UK's "GC6:

Dependable Systems Evolution", its international cousin the

"Verified Software Initiative", and their plan to develop a Verified

Software Repository.

 

To this end the UTP2010 Symposium welcomes contributions on the above

themes as well as others which can be related to them. Such additional

themes include, but are not limited to, relational semantics,

relational algebra, healthiness conditions, normal forms, linkage of

theories, algebraic descriptions, incorporation of probabilistic

programming, timed calculi and object-based descriptions, as well as

alternative programming paradigms such as functional, logical,

data-flow, and beyond. In all cases, the UTP approach should be

compared and advantages/disadvantages discussed.

 

Accepted papers are envisaged to be published in the symposium

proceedings by Springer as a volume of the Lecture Notes in Computer

Sciences.  We are also planning to have a special journal issue of

Formal Aspects of Computing for selected best papers from the UTP 2010

symposium.

 

Papers should be written in English and not exceed 20 pages in LNCS

format (http://www.springer.de/comp/lncs/authors.html). Paper

submission will be done online via the easychair submission system.

 

 

Program Chair

---------------

Shengchao Qin                   (Durham Univeristy, UK)

 

 

 

Important Dates

---------------

June 4,  2010:           Title and abstract submission deadline

June 11, 2010:                   Paper submission deadline

July 30, 2010:            Acceptance/rejection notification

August 13, 2010:     Camera-ready version due

Nov 15-16, 2010:     UTP 2010

 

 

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Permalink | Reply | 0 comments |
headers
Philippe Narbel | 4 Apr 2010 17:45
Picon

MPOOL 2010 (ECOOP) : Call for Papers


--------------------------------------------------------------------------

            SECOND CALL FOR CONTRIBUTIONS AND PARTICIPATION

                              Workshop on
        MULTIPARADIGM PROGRAMMING WITH OO LANGUAGES (MPOOL 2010)
                                 at the
    EUROPEAN CONFERENCE ON OBJECT-ORIENTED PROGRAMMING (ECOOP 2010)
                     21 or 22 July 2010, Maribor, Slovenia

While OO has become ubiquitously employed for design, implementation, and
even conceptualization, many practitioners recognize the concomitant need
for other programming paradigms according to problem domain.  We seek
answers to the question of how to address the need for other programming
paradigms--or even domain specific languages--in the general context of OO
languages.

Can OO programming languages effectively support other programming
paradigms or the embedding of other languages?  The answer seems to be
affirmative, at least for some paradigms.  For example, significant
progress has been made for the case of functional programming in C++.
Additionally, several efforts have been made to integrate support for
other paradigms as a front-end for OO languages (the Pizza language,
extending Java, is a prominent example). Libraries and extensions for
concurrency are also being developed for new and upcoming multi-core and
heterogeneous architectures.

This workshop seeks to bring together practitioners and researchers in
this developing field to `compare notes' on their work--describe existing,
developing, or proposed techniques, idioms, methodologies, language
extensions, or software for expressing non-OO paradigms in OO languages;
or theoretical work supporting or defining the same. High-level
presentations of position are welcome, and reports of work in progress,
are welcome.

Specific areas of interest include, but are not limited to:

  - non-OO programming with OO languages;
  - merging functional/logic/OO/other programs (language crossbinding);
  - non-OO programming at the meta level (e.g. template metaprogramming);
  - techniques for language embeddings (e.g. multistage programming);
  - language embedding in OO languages (domain specific languages - DSLs)
  - module systems vs. object systems;
  - OO design patterns and their relation to functional patterns;
  - multiparadigm and multilingual programming in the .NET framework;
  - type system relationships across languages;
  - theoretical foundations of multiparadigm programming with OO languages;
  - multiparadigm approaches to support emerging hardware architectures (e.g.
    multi/many-core CPUs, GPGPUs, IBM Cell, etc).

The workshop will consist of short presentations with interspersed
discussion sessions, and longer general discussions of themes or topics
derived from some common element of subsets of presentations. We expect
the majority of the participants to give presentations.

Prospective participants may submit either presentation abstracts or full
papers. All accepted materials will be distributed at the workshop, made
available at the MPOOL 2010 Web site and will nbe published by the ACM
Digital Library. Papers need to be formatted accordingly -- see
http://www.acm.org/sigs/publications/proceedings-templates for details.

For authors of accepted presentations who require justification for travel
the organizers can provide official letters of invitation.

SUBMISSION PROCEDURE

Prospective authors are invited to submit abstracts or full papers in PDF,
postscript, or Microsoft Word. Authors of accepted papers are responsible
for submitting the final version using an appropriate ACM template to
ensure inclusion in the proceedings. Submission and email correspondence
to mpool10 <at> multiparadigm.net .

AUTHORS' SCHEDULE

May  4th,  2008:  Abstracts due.
May 19th,  2008:  Notification of acceptance.

ORGANIZATION

This workshop is a joint organization by the University of Applied
Sciences, Regensburg, Germany, and the Los Alamos National Laboratory,
USA.

ORGANIZERS / PROGRAMME COMMITTEE

Gerald Baumgartner (Louisiana State University, Louisiana, USA)
Gavin Bierman (Microsoft Research, UK)
Kei Davis (Los Alamos National Laboratory, New Mexico, USA)
Zoltan Horvath (University Eotvos Lorand of Sciences, Budapest, Hungary)
Jaakko Jarvi (Texas A&M University, Texas, USA)
Herbert Kuchen (University of Muenster, Germany)
Philippe Narbel (University of Bordeaux I, France)
Joerg Striegnitz (University Of Applied Sciences Regensburg, Germany)

FURTHER INFORMATION

More information is available at

   http://www.multiparadigm.net
Permalink | Reply | 0 comments |
headers
Tom Hawkins | 5 Apr 2010 16:34
Picon

Re: [Haskell-cafe] Re: ANN: spec2code

On Mon, Apr 5, 2010 at 4:00 AM, Heinrich Apfelmus
<apfelmus <at> quantentunnel.de> wrote:
>> Does it scale?  Absolutely, spec2code is not confined to
>> specifications for which optimized algorithms are already known.
>> spec2code can be used to implement operation systems, device drivers,
>> build systems, package management tools, and even do your shirt
>> laundry.  spec2code will change your job from programmer to
>> specification author, giving you more time for meetings, managing
>> email, and browsing the web.  Say goodbye to those dirty Perl scripts,
>> broken C code, and ultimately, your job.  spec2code is the future of
>> programming and the beginning of the end of mankind.
>>
>> Looking forward to obsoleting you soon,
>
> Awesome! Given the great potential of the new  spec2code  compiler, the
> reception seems to be somewhat chilly. But maybe that's because no one
> likes to be obsoleted...

Or it could just be that time of year.  (Apr 1st)
Permalink | Reply | 0 comments |
headers
Kwanghoon Choi | 6 Apr 2010 10:31
Picon

ANNOUNCE: GenSmsPdu-0.1

Dear Haskeller,
 
I like to annouce GenSmsPdu, an automatic SMS message generator.
 
http://hackage.haskell.org/package/GenSmsPdu-0.1
 
GenSmsPdu is a library for random generation of 3GPP SMS messages. It defines a big data type for 3GPP defined SMS message formats such as SMS-SUBMIT and SMS-DELIVER [1]. Using generator functions offered by QuickCheck, it can generate arbitrary SMS messages in the data type automatically.

GenSmsPdu also offers an encoder to convert an SMS message  in the data type into an SMS PDU (Protocol Data Unit) in bytes, and a decoder to do the reverse. Currently, GenSmsPdu generates single-pages SMS messages.

[1] 3GPP TS 23.040 V6.7.0, 3rd Generation Partnership Project Technical Specification Group Core Network and Terminals; Technical Realization of the Short Message Service (SMS) (Release 6), March 2006. http://www.3gpp.org.

Best regards,

Kwanghoon

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Permalink | Reply | 0 comments |
headers
Simon Peyton-Jones | 7 Apr 2010 23:31
Picon
Favicon
Gravatar

FP jobs

Friends

 

Did you know that CUFP has a jobs board

 

                http://cufp.org/jobs

 

There’s a Haskell vacancy advertised recently (along with lots of F#)!

 

Simon

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Permalink | Reply | 0 comments |
headers
Chris Casinghino | 8 Apr 2010 00:00
Picon

ANNOUNCE: Hac phi 2010

Greetings,

I am very pleased to officially announce Hac phi 2010, a Haskell
hackathon/get-together to be held May 21-23 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, and many
people have already expressed interest in coming back this year.  I
want to stress that everyone is welcome---you do not have to be a
Haskell guru to attend!  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].  Note that we're in a different space this year and may have
to cap attendance, so register early.

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].

Hope to see you in Philadelphia!

-The Hac φ team

[1] http://haskell.org/haskellwiki/Hac_φ/Register
[2] http://haskell.org/haskellwiki/Hac_φ
[3] http://haskell.org/haskellwiki/Hac_φ/Talks
Permalink | Reply | 2 comments |
headers
Garrett Mitchener | 8 Apr 2010 16:20
Picon

trouble with the random number generator

Hi, I'm having some trouble with the standard random number generator.  I re-implemented it for speed, but the same problem seems to be present in the original.  The problem I'm having is in the generation of a random Double.  If you go down to the function randomIvalDouble in Random.hs (and I'm looking at the one from http://darcs.haskell.org/packages/random), here's where something is going wrong:

       case (randomIvalInteger (toInteger (minBound::Int32), toInteger (maxBound::Int32)) rng) of
         (x, rng') -> 
   let
    scaled_x = 
fromDouble ((l+h)/2) + 
                fromDouble ((h-l) / realToFrac int32Range) *
fromIntegral (x::Int32)
   in
   (scaled_x, rng')

...
int32Range = toInteger (maxBound::Int32) - toInteger (minBound::Int32)

I use essentially the same calculation in my implementation with l = 0 and h = 1, that is, I want to generate a random Double in the interval [0,1].  int32Range comes out to be 2^32-1.  But if the pseudo-random integer x happens to be minBound, which is -2^31, then the scaled_x comes out

1/2 - 2^31/(2^32-1)  = 2^31( 1/2^32 - 1/(2^32-1) ) = -1.164e-10 < 0

which is outside the required range.  One of my simulations, which has been running for weeks, actually hit this, and I'd like to know if I'm just missing something or if this is a real bug.  It breaks my simulation because it triggers an attempt to access element -1 of an array whose minimum index is 0, by the way.

My trouble at this point is that I'd really like for my simulation results to be completely reproduceable, and I'm going to be unhappy if I have to re-implement the random generation and change it so that I have to throw out all the results I have so far.  I'm also going to be unhappy if I have to insert some check that slows everything down...

At any rate, if I'm right, this bug affects GHC and Hugs.  But this code has surely been around long enough that someone would have found this already?  But there's not a bug in hackage's trac system.

Help!

-- Garrett Mitchener
_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell
Permalink | Reply | 1 comment |

Gmane