2011-07-30

[Caml-list] Time to register for CUFP

The talks and tutorials for CUFP are now up, and it's a really interesting protocols, covering a broad range of FP topics, and including quite a bit that touches on OCaml specifically.  

Note: The deadline for reduced-fee registrations is August 15th.

I hope to see a lot of you there!

y
 
_____________________________________________________________  

Commercial Users of Functional Programming Workshop (CUFP) 2011 Call for Participation Sponsored by SIGPLAN Co-located with ICFP 2011 _____________________________________________________________ September 22-24, 2011 Tokyo, Japan http://cufp.org/conference/schedule/2011 Reservation available through ICFP's website https://regmaster3.com/2011conf/ICFP11/register.php _____________________________________________________________ Functional programming languages have been a hot topic of academic research for over 35 years, and they have seen an ever larger practical impact in settings ranging from tech startups to financial firms to biomedical research labs. At the same time, a vigorous community of working programmers employing functional languages has come into existence. CUFP is designed to serve this community. The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. CUFP 2011 will feature two days of tutorials given by language experts, on the 22nd and 23rd, and a day of talks on the 24th. Attendees may register for any subset of the days. Day 1, Tutorials (September 22nd) ================================= Morning: - Building reliable Client-Server Applications in Erlang (Francesco Cesarini) - Jane Street's OCaml Core library (Yaron Minsky) Afternoon: - Building a functional OS (Anil Madhavapeddy, David Scott, Richard Mortier) - Collaborative Scientific Software (Ashish Agarwal) Day 2, Tutorials (September 23rd) ================================= Morning: - Parallel Programming in Haskell (Simon Peyton Jones, Simon Marlow, Manuel Chakravarty) - Systems Programming in Scala (Steven Jensen, Marius Eriksen) Afternoon: - The Snap framework for web applications in Haskell (Gregory Collins) - F# for the working functional programmer (Michael Sperber) Day 3, Talks (September 24th) ================================= Keynote Lennart Augustsson (Standard Chartered) Theorem-based derivation of an AES Implementation John Launchbury (Galois) Discrete Event Simulation using Erlang Olivier Boudeville (EDF) Model based testing of AUTOSAR automotive components Thomas Arts (Quviq) HTML5 web application development in OCaml Keigo Imai (IT Planning) Large-scale Internet Services in Scala at Twitter Steve Jenson and Wilhelm Bierbaum (Twitter) Applying Functional Programming to Build Platform-Independent Mobile Applications Adam Granicz (Intellifactory) Fourteen Days of Haskell: A Real Time Programming Project in Real Time Gregory Wright (Alcatel-Lucent) Disco: using Erlang to implement Mapreduce, Nokia Prashanth Mundkur and Ville Tuulos and Jared Flatow (Nokia) Functional mzScheme DSLs in Game Development Dan Liebgold (Naughty Dog) OCaml and Acunu Experience Report Tom Wilkie and Andrew Byde (Acunu) There will be no published proceedings, as the meeting is intended to be more a discussion forum than a technical interchange, but videos of all the talks will be placed online after the event. For more information, including presentation abstracts and the most recent schedule information, visit: http://cufp.org See you there!

2011-07-29

[Caml-list] CfPart: TIME'11

TIME 2011 Call for Participation

Eighteenth International Symposium on
Temporal Representation and Reasoning

Luebeck, Germany, September 12-14, 2011

http://www.isp.uni-luebeck.de/time11/


* DATES

Registration: 18 June - 14 August 2011
Late Registration: from 15 August 2011
TIME Symposium: 12 - 14 September 2011


* THE CONFERENCE

The TIME symposium series is a well-established annual event that
brings together researchers from all areas of computer science that
involve temporal representation and reasoning. This includes, but is
not limited to, artificial intelligence, temporal databases, and the
verification of software and hardware systems. In addition to fostering
interdisciplinarity, the TIME symposia emphasize bridging the gap
between theoretical and applied research. This year, TIME will
feature a special track on interval temporal logics.

The conference will span three days, and will be organized
as a combination of technical paper presentations, keynote lectures,
and tutorials.


* INVITED SPEAKERS

Nir Piterman (University of Leicester, UK)
p-Automata and Obligation Games

Gerhard Schellhorn (Universität Augsburg, Germany)
Extending ITL with Interleaved Programs for Interactive Verification

Kristen Brent Venable (Università di Padova, Italy)
Temporal Preferences

Jef Wijsen (Université de Mons, Belgium):
Towards a Foundation of Data Currency


* TOPICS

The main topics of the conference are:

Temporal Representation and Reasoning in AI
Temporal Database Management
Temporal Logic and Verification in Computer Science
Interval Temporal Logics


* FEES

Registration: 330 €
Late registration: 370 €


* CONFERENCE OFFICERS

General Chair:
Carlo Combi, University of Verona, Italy

Program Committee Chairs:
Martin Leucker, University of Luebeck, Germany
Frank Wolter, University of Liverpool, United Kingdom

Organization Chair:
Martin Leucker, Universitaet Luebeck, Germany


* PROGRAM COMMITTEE

Alessandro Artale (Free University of Bozen-Bolzano, Italy)
Philippe Balbiani (IRIT, CNRS, France)
Claudio Bettini (Università di Milano, Italy)
Benedikt Bollig (LSV, CNRS, France)
Luboš Brim (Masaryk University, Czech Republic)
Antonio Cau (De Montfort University, UK)
Dang Van Hung(VNU, Vietnam)
Clare Dixon (University of Liverpool, UK)
Rajeev Goré (ANU, Australia)
Dimitar Guelev (BAS, Bulgaria)
Peter Habermehl (University Paris Diderot, LIAFA , France)
Ian Hodkinson (Imperial College London, UK)
Roman Kontchakov (Birkbeck, University of London, UK)
Salvatore La Torre (Università di Salerno, Italy)
Ranko Lazic (University of Warwick, UK)
Martin Leucker (Universität zu Lübeck, Germany)
Kamal Lodaya (IMSc, India)
Nicolas Markey (CNRS, ENS Cachan, France)
Angelo Montanari (Università di Udine, Italy)
Ben Moszkowski (DMU, UK)
Dirk Nowotka (Universität Stuttgart, Germany)
Paritosh K. Pandya (Tata Institute of Fundamental Research, India)
Jean-Francois Raskin (Université Libre de Bruxelles, Belgium)
Peter Revesz (University of Nebraska-Lincoln, USA)
Mark Reynolds (University of Western Australia, Australia)
Martin Sachenbacher (TUM, Germany)
César Sánchez (IMDEA, CSIC, Spain)
Christian Schallhart (Oxford University, UK)
Stefan Wölfl (Albert-Ludwigs-Universität Freiburg, Germany)
Frank Wolter (University of Liverpool, UK)
Naijun Zhan (ISCAS, China)
Esteban Zimányi (Université Libre de Bruxelles, Belgium)


* FURTHER INFORMATION

Questions related to submission, reviewing, and program:
time11@isp.uni-luebeck.de

Questions related to local organization:
time11-org@isp.uni-luebeck.de

--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-07-28

[Caml-list] [VMCAI2012] VMCAI 2012 CALL FOR PAPERS

VMCAI 2012 CALL FOR PAPERS

13th International Conference on
Verification, Model Checking, and Abstract Interpretation (VMCAI)

http://lara.epfl.ch/vmcai2012/

January 22-24, 2012, Philadelphia, USA
Collocated with POPL 2012 ( http://www.cse.psu.edu/popl/12/ )
39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages

SCOPE

VMCAI provides a forum for researchers from the communities of
Verification, Model Checking, and Abstract Interpretation,
facilitating interaction, cross-fertilization, and advancement of
hybrid methods that combine these and related areas.

The program of VMCAI'12 will consist of refereed research papers and
tool demonstrations, as well as invited lectures and tutorials.
Research contributions can report new results as well as experimental
evaluations and comparisons of existing techniques. Topics include,
but are not limited to: program verification, model checking, abstract
interpretation and abstract domains, program synthesis, static
analysis, type systems, deductive methods, program certification,
debugging techniques, program transformation, optimization, hybrid and
cyberphysical systems.

Submissions can address any programming paradigm, including
concurrent, constraint, functional, imperative, logic and
object-oriented programming.

Papers must describe original work, be written and presented in
English, and must not overlap with papers that have been published or
that are simultaneously submitted to a journal or a conference with
refereed proceedings. Proceedings are published by Springer Verlag as
volumes in the Lecture Notes in Computer Science series.

IMPORTANT DATES

Abstract Submission: August 12, 2011
Paper Submission: August 19, 2011
Acceptance Notification: October 10, 2011
Conference: January 22-24, 2012 (right before POPL)

The submission system is now open and early submissions are welcome.
The deadlines are strict and will not be changed.

SUBMISSION INSTRUCTIONS

The VMCAI 2012 proceedings will be published as a volume in Springer's
Lecture Notes in Computer Science series. The page limit for
submissions is

15 pages in Springer's LNCS format.

Additional material may be placed in an appendix, to be read at the
discretion of the reviewers and to be omitted in the final
version. Formatting style files and further guidelines for formatting
can be found at
http://www.springer.de/comp/lncs/authors.html. Submissions deviating
from these guidelines risk summary rejection.

Please prepare your submission in accordance with the rules described
above and submit a pdf file via

http://www.easychair.org/conferences/?conf=vmcai2012

PROGRAM COMMITTEE

Josh Berdine
Nikolaj Bjorner
Bor-Yuh Evan Chang
Wei-Ngan Chin
Radhia Cousot
Sophia Drossopoulou
Philippa Gardner
Patricia Hill
Marieke Huisman
Radu Iosif
Daniel Kroening
Viktor Kuncak
Barbara Koenig
Francesco Logozzo
Rupak Majumdar
Greg Morrisett
Corina Pasareanu
Andreas Podelski
Sriram Rajamani
Andrey Rybalchenko
Mooly Sagiv
Sriram Sankaranarayanan
Helmut Veith
Heike Wehrheim
Eran Yahav
Lenore Zuck

PC CHAIRS

Viktor Kuncak, EPFL, Switzerland
Andrey Rybalchenko, TUM, Germany

VMCAI STEERING COMMITTEE

Agostino Cortesi, Universita' Ca' Foscari, Venice, Italy
Patrick Cousot, Ecole Normale Superieure, France
E. Allen Emerson, University of Texas at Austin, USA
Andreas Podelski, University of Freiburg, Germany
Thomas W. Reps, University of Wisconsin at Madison, USA
David Schmidt, Kansas State University, USA
Lenore Zuck, University of Illinois at Chicago, USA

ADDITIONAL INFORMATION

Please consult

http://lara.epfl.ch/vmcai2012/

or contact PC chairs.


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-07-26

[Caml-list] ICFP 2011: Call for participation

=====================================================================
Call for Participation

The 16th ACM SIGPLAN International Conference
on Functional Programming (ICFP 2011)

http://www.icfpconference.org/icfp2011/
Tokyo, Japan September 19-21, 2011
=====================================================================

ICFP provides a forum for researchers and developers to hear
about the latest work on the design, implementations, principles, and
uses of functional programming. The conference covers the entire
spectrum of work, from practice to theory, including its peripheries.

* Program:
http://www.icfpconference.org/icfp2011/program.html

* Registration link:
https://regmaster3.com/2011conf/ICFP11/register.php

* Local arrangements (including travel and accommodation):
http://www.biglab.org/icfp11local/index.html


Schedule including related events:

September 18
Workshop on Generic Programming (WGP)
Workshop on High-Level Parallel Programming and Applications (HLPP)
Workshop on ML
September 19-21
ICFP
September 22
Commercial Users of Functional Programming – Day 1 (CUFP Tutorials)
Haskell Symposium
September 23
Commercial Users of Functional Programming – Day 2 (CUFP Tutorials)
Erlang Workshop
Haskell Implementors' Workshop
September 24
Commercial Users of Functional Programming – Day 3 (CUFP Talks)
Continuation Workshop

Conference organizers:

* General Co-Chairs:
Manuel Chakravarty, University of New South Wales
Zhenjiang Hu, National Institute of Informatics
* Program Chair:
Olivier Danvy, Aarhus University
* Local Arrangements Chair:
Soichiro Hidaka, National Institute of Informatics
* Workshop Co-Chairs:
Gabriele Keller, University of New South Wales
Derek Dreyer, MPI-SWS
* Programming Contest Chair:
Eijiro Sumii, Tohoku University
* Publicity Chair:
Wouter Swierstra, Radboud Universiteit Nijmegen

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


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-07-25

[Caml-list] CSL call for participation

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

CALL FOR PARTICIPATION, EARLY REGISTRATION DEADLINE APPROACHING

TYPES 2011, 8-11 September, http://www.types.name/
CSL 2011, 12-15 September, http://www.eacsl.org/csl11

Bergen, Norway


GENERAL INFORMATION

Types for Proofs and Programs (TYPES) is a forum to present
new and on-going work in all aspects of type theory and its
applications, especially in computer programming and in formalized
and computer-assisted reasoning, see: http://www.types.name/

Computer Science Logic (CSL) is the annual conference of the
European Association for Computer Science Logic (EACSL).
The conference is intended for computer scientists whose
research activities involve logic, as well as for logicians
working on issues significant for computer science.
A preliminary program for CSL'11 is now available:
http://www.eacsl.org/csl11/program.pdf

The pre-conference workshop Epsilon Calculus and Constructivity
on Sunday 11 September is free for TYPES/CSL'11 participants

REGISTRATION for TYPES/CSL'11: https://registrer.app.uib.no/csl
Early registration deadline: 1 August 2011

BOOKING a hotel room at a reduced rate can be done via: booking@ght.no
NB limited availability, and the offer expires 1 August 2011,
see: http://www.eacsl.org/csl11/#accommodation

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


--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-07-19

[Caml-list] TLDI 2012 - Call for Papers and Contributed Talks

TLDI 2012
CALL FOR PAPERS AND CONTRIBUTED TALKS

The Seventh ACM SIGPLAN Workshop on
Types in Language Design and Implementation

Saturday, January 28, 2012

Philadelphia, PA, USA
To be held in conjunction with POPL 2012

Submission deadline: October 10th, 2011
Submission site: http://tldi12.cis.upenn.edu

IMPORTANT: This year TLDI is introducing a significant change to the
workshop organization. There will be two distinct submission
categories: full papers (with a published proceedings, as always) and
2-page proposals for talks on more speculative or unfinished work. The
aim is to foster a more informal atmosphere in which new ideas can be
discussed while maintaining the TLDI tradition of presentations of
polished technical work.

__________________________________________________________________

Scope

The role of types and proofs in all aspects of language design, compiler
construction, and software development has expanded greatly in recent
years. Type systems, type-based analyses and type-theoretic deductive
systems have been central to advances in compilation techniques for modern
programming languages, verification of safety and security properties of
programs, program transformation and optimization, and many other areas. The
ACM SIGPLAN Workshop on Types in Language Design and Implementation brings
researchers together to share new ideas and results concerning all aspects
of types and programming, and is now an annual event. TLDI 2012 is the
seventh workshop in the series and will be co-located with POPL in
Philadelphia, Pennsylvania in January 2012.

Submissions for TLDI 2012 are invited on all interactions of types with
language design, implementation, and programming methodology. This
includes both practical applications and theoretical aspects. TLDI 2012
specifically encourages papers from a broad field of programming
language and compiler researchers, including those working on
object-oriented or dynamic languages, systems programming, mobile-code
or security, as well as traditional fully-static type systems. Topics
of interest include:

* Typed intermediate languages and type-directed compilation
* Type-based language support for safety and security
* Types for interoperability
* Type systems for system programming languages
* Type-based program analysis, transformation, and optimization
* Dependent types and type-based proof assistants
* Types for security protocols, concurrency, and distributed
computing
* Type inference and type reconstruction
* Type-based specifications of data structures and program invariants
* Type-based memory management
* Proof-carrying code and certifying compilation
* Types and objects

This is not meant to be an exhaustive list; papers on novel aspects or
uses of types are welcome. Authors concerned about the suitability of a
topic are encouraged to inquire via electronic mail to the program
chair prior to submission.

__________________________________________________________________

Submission Guidelines

Full papers should be no more than 12 pages (including bibliography and
appendices). They will be judged on the usual criteria of novelty,
usefulness, correctness, and clarity of exposition.

Informal talk proposals should be no more than 2 pages (including
bibliography). These can be either technical or more general in nature;
they will be judged on their promise of leading to an exciting or
provocative talk.

The deadline for both submission categories is Monday, October 10,
2011. The submission deadline and length limitations are firm.
Submissions that do not meet these guidelines will not be considered.

All submissions should be in standard ACM SIGPLAN conference format: two
columns, nine-point font on a ten-point baseline. Detailed formatting
guidelines are available on the SIGPLAN Author Information page
(http://www.sigplan.org/authorInformation.htm), along with a LaTeX class
file and template.

Papers must be submitted electronically via the workshop website
(http://tldi12.cis.upenn.edu/) in Adobe Portable Document Format
(PDF) and must be formatted for printing on US Letter size (8.5"x11")
paper. Authors for whom this is a hardship should contact the program
chair before the deadline.

Submitted papers must adhere to the SIGPLAN Republication Policy
(http://www.sigplan.org/republicationpolicy.htm). Submissions should
contain original research not published or submitted for publication
elsewhere.

__________________________________________________________________

Publication

As in previous years, accepted full papers will be published by the ACM
and appear in the ACM digital library.

__________________________________________________________________

Important Dates

Submission deadline October 10, 2011 (Monday)
Notification November 10, 2011 (Thursday)
Workshop January 28, 2012 (Saturday)

__________________________________________________________________

Program Chair:

Benjamin C. Pierce
University of Pennsylvania
bcpierce atsign cis dot upenn dot edu

Program Committee:

Jonathan Aldrich CMU
Adam Chlipala MIT
Pierre-Malo Deniélou Imperial College London
Kathleen Fisher Tufts University
Chris Hawblitzel Microsoft Research (Redmond)
Dan Licata CMU
Greg Morrisett Harvard University
Benjamin C. Pierce University of Pennsylvania
Dimitrios Vytiniotis Microsoft Research (Cambridge)

Steering Committee:

Amal Ahmed Indiana University
Nick Benton Microsoft Research, Cambridge
Derek Dreyer MPI-SWS
Andrew Kennedy Microsoft Research, Cambridge
Francois Pottier INRIA Paris-Rocquencourt
Stephanie Weirich University of Pennsylvania

--
Caml-list mailing list. Subscription management and archives:
https://sympa-roc.inria.fr/wws/info/caml-list
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners
Bug reports: http://caml.inria.fr/bin/caml-bugs

2011-07-15

[Caml-list] Domain-Specific Languages: Call for Participation

DSL 2011: IFIP Working Conference on Domain-Specific Languages
6-8 September 2011, Bordeaux, France

**** Call for Participation: Online registration deadline July 30, 2011 ****

Details of the program and accommodation are available at http://dsl2011.bordeaux.inria.fr.

== Invited Speakers ==

- Jeremy Gibbons - University of Oxford, UK.
- Claude Kirchner - INRIA, France.

== Distilled Tutorials on Domain-Specific Languages ==

The purpose of these tutorials are not to give a general overview, but to make the attendees
aware of one point and to make them master it.

- Jerzy Karczmarczuk. Specific "scientific" data structures, and their processing.
- Oleg Kiselyov. Implementing explicit and finding implicit sharing in embedded DSL.
- Keiko Nakata. A total interpreter for While with interactive I/O.
- Josef Svenningsson. Combining deep and shallow embeddings for EDSLs.
- Walid Taha. Accurate programming: thinking about programs in terms of properties.
- William Cook. Build your own partial evaluator in 90 minutes.

== DSL Technical Papers ==

- Basile Starynkevitch. MELT a Translated Domain Specific Language Embedded in the GCC Compiler.
- Azer Bestavros and Assaf Kfoury. A Domain-Specific Language for the Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks.
- Tiark Rompf, Kevin J. Brown, Hassan Chafi, Hyoukjoong Lee, Arvind K. Sujeeth, Martin Odersky and Kunle Olukotun. Building-Blocks for Performance Oriented DSLs.
- Dominic Orchard and Alan Mycroft. Efficient and Correct Stencil Computation via Pattern Matching and Static Typing.
- Tim Bauer, Martin Erwig, Alan Fern and Jervis Pinto. Adaptation-Based Programming in Haskell.
- Eric Walkingshaw and Martin Erwig. A DSEL for Studying and Explaining Causation.
- Lucas Beyak and Jacques Carette. SAGA: A DSL for story management.