caml-list - the Caml user's mailing list
 help / color / mirror / Atom feed
* OCaml Talks Wanted for CUFP 2008
@ 2008-05-22 18:17 Grundy, Jim D
  0 siblings, 0 replies; only message in thread
From: Grundy, Jim D @ 2008-05-22 18:17 UTC (permalink / raw)
  To: caml-list; +Cc: simonpj

[-- Attachment #1: Type: text/plain, Size: 5386 bytes --]

Hi All
 
The deadline for presentation proposals for the workshop for Commercial
Users of Functional Programming (CUFP) is almost upon us: June 2.  I
know there are a great many exciting and practical applications of
functional programming using OCaml in the works right now - and I'd like
to encourage all of your involved with such efforts to submit a
presentation proposal to CUFP, we'd love to hear what you are up to.
Proposals need not be too detailed, a couple of paragraphs is all that
is required.  For more information on CUFP you can check out
cufp.functionalprogramming.com.
 
Kind regards
 
Jim Grundy
 
--
Jim Grundy, Research Scientist. Intel Corporation, Strategic CAD Labs
Mail Stop RA2-451, 2501 NW 229th Ave, Hillsboro, OR 97124-5503, USA
Phone: +1 971 214-1709  Fax: +1 971 214-1771
Key Fingerprint: 5F8B 8EEC 9355 839C D777  4D42 404A 492A AEF6 15E2

      Commercial Users of Functional Programming Workshop (CUFP) 2008

               Functional Programming As a Means, Not an End

                           Call for Presentations

                          Sponsored by SIGPLAN
                        Co-located with ICFP 2008
     _________________________________________________________________

                 Presentation proposals due 2 June 2008

		 http://cufp.functionalprogramming.com
     _________________________________________________________________

   Functional languages have been under academic development for over 25
   years, and remain fertile ground for programming language research.
   Recently, however, developers in industrial, governmental, and open
   source projects have begun to use functional programming successfully
   in practical applications. In these settings, functional programming
   has often provided dramatic leverage, including whole new ways of
   thinking about the original problem.

   The goal of the CUFP workshop is to act as a voice for these users of
   functional programming. The workshop supports the increasing
viability
   of functional programming in the commercial, governmental, and
   open-source space by providing a forum for professionals to share
   their experiences and ideas, whether those ideas are related to
   business, management, or engineering. The workshop is also designed
to
   enable the formation and reinforcement of relationships that further
   the commercial use of functional programming. Providing user feedback
   to language designers and implementors is not a primary goal of the
   workshop, though it will be welcome if it occurs.

Speaking at CUFP

   If you use functional programming as a means, rather than as an end,
   we invite you to offer to give a talk at the workshop. Alternatively,
   if you know someone who would give a good talk, please nominate them!

   Talks are typically 30-45 minutes long, but can be shorter. They aim
   to inform participants about how functional programming played out in
   real-world applications, focusing especially on the re-usable lessons
   learned, or insights gained. Your talk does not need to be highly
   technical; for this audience, reflections on the commercial,
   management, or software engineering aspects are, if anything, more
   important. You do not need to submit a paper!

   If you are interested in offering a talk, or nominating someone to do
   so, send an e-mail to jim (dot) d (dot) grundy (at) intel (dot) com
or
   simonpj (at) microsoft (dot) com by 2 June 2008 with a short
   description of what you'd like to talk about or what you think your
   nominee should give a talk about. Such descriptions should be about
   one page long.

Program Plans

   CUFP 2008 will last a full day and feature an invited presentation
   from Michael Hopcroft, the product unit manager for the forthcoming
   release of Microsoft Visual Studio F#. Additionally, the program
   will include a mix of presentations and discussion sessions. Topics
   will range over a wide area, including:
     * Case studies of successful and unsuccessful uses of functional
       programming;
     * Business opportunities and risks from using functional languages;
     * Enablers for functional language use in a commercial setting;
     * Barriers to the adoption of functional languages, and
     * Mitigation strategies for overcoming limitations of functional
       programming.

   There will be no published proceedings, as the meeting is intended to
   be more a discussion forum than a technical interchange.
   
Program Committee

     * Lennart Augustsson <lennart (dot) augustsson (at) gmail (dot)
com>
     * Matthias Blume <blume (at) tti-c (dot) org>
     * Adam Granicz <granicz (dot) adam (at) intellifactory (dot) com>
     * Jim Grundy (co-chair) <jim (dot) d (dot) grundy (at) intel (dot)
com>
     * John Lalonde <lalonde (at) abstrax (dot) com>
     * Andy Martin <akmartin (at) us (dot) ibm (dot) com>
     * Yaron Minsky <yminsky (at) janestcapital (dot) com>
     * Simon Peyton Jones (co-chair) <simonpj (at) microsoft (dot) com>
     * Ulf Wiger <ulf (dot) wiger (at) ericsson (dot) com>

   This will be the fifth CUFP, for more information - including reports
   from attendees of previous events - see the workshop web site:
   http://cufp.functionalprogramming.com

[-- Attachment #2: Type: text/html, Size: 6395 bytes --]

^ permalink raw reply	[flat|nested] only message in thread

only message in thread, other threads:[~2008-05-22 18:18 UTC | newest]

Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2008-05-22 18:17 OCaml Talks Wanted for CUFP 2008 Grundy, Jim D

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).