Kenneth Adam Miller | 26 Nov 22:13 2014

OCamlMakefile troubles - change target in subproject

This is somewhat of a crosspost, so I suppose I'll go ahead and link this, but I'm having trouble figuring out how to get make to produce the right command when I'm using ocamlmakefile

basically, I want to define a subproject using make's "define", and I want that to be compiled as a library, a byte code library if the target is bc and a native code library if the target is nc.

With ocamlmakefile, if you want to make a subproject you use a define, as in the link; all I want to do is change the target:

make nc => make ncl
make bc => make bcl

*just* within the confines of the subproject. Meaning, some subprojects should be compiled as libraries, others just as normal binaries in the makefile, in order that it doesn't have to be attempted multiple times. How do I achieve that with subprojects? 
Thomas Braibant | 26 Nov 20:59 2014

Reminder: Next OCaml users in Paris meetup, 9th of december

[french version below]
Hi list,

This is a reminder that the next OCaml users in Paris (OUPS) meetup
will take place on the 9th of december at *Irill*, in Paris.

The program is:
- 19H: Introduction
- 19H05: Mihhail Aizatulin, Jane Street. "OCaml: the ultimate
configuration language?"
- 19H35: Frédéric Bour. "Modular implicits: réconcilier OCaml avec les
types classes"
- 20H05: Pierrick Couderc. "Gestion des namespaces en OCaml (depuis
4.02 et expérimentations)".
- 20h35: Vincent Balat. Tutoriel " Appli Web réactive client-serveur
avec Ocsigen"

There will be drinks and pizzas afterwards, thanks to Jane Street.

For more information, go to

As usual, registration via meetup is preferable. If you do not wish to
do so, please send me an email if you want to be counted for food.


------------------ Version française  ----------------

Ce mail est un bref rappel pour le prochain meetup OUPS. Celui-ci aura
lieu le 9 décembre à l'Irill.

Le programme est le suivant:
- 19H: Introduction
- 19H05: Mihhail Aizatulin, Jane Street. "OCaml: the ultimate
configuration language?"
- 19H35: Frédéric Bour. "Modular implicits: réconcilier OCaml avec les
types classes"
- 20H05: Pierrick Couderc. "Gestion des namespaces en OCaml (depuis
4.02 et expérimentations)".
- 20h35: Vincent Balat. Tutoriel " Appli Web réactive client-serveur
avec Ocsigen"

Nous terminerons la soirée par un pot avec pizzas et boissons, offerts
par Jane Street.

Pour plus d'information, je vous invite à aller voir la page suivante:

Comme d'habitude, il est préférable de vous inscrire via le site Si vous ne souhaitez pas le faire, envoyez moi un email si
vous voulez être compté pour le pot.

En espérant vous voir nombreux,
Thomas Braibant


Caml-list mailing list.  Subscription management and archives:
Beginner's list:
Bug reports:
John Whitington | 25 Nov 19:21 2014

Re: teaching OCaml


Robert Muller wrote:
> Thank you John. I will look at your graphics library, much appreciated.
> I didn't require it this first time through but many of my students
> bought your book:
> They tell me it is very helpful.
> To me, what is needed to get ML-in-101 off the ground is simplicity:
> 1. a simple implementation/IDE that is trivial to install and "just
> works" on macs, Windows (and linux, I suppose), I am thinking of
> something like the experience I had in the past with Dr. Java.
> 2. a simple, no fuss library for graphics, animation and audio something
> like Sedgewick & Wayne's stdlib (
> 3. decent error messages for both syntax errors and type errors.
> Ideally, I would prefer that both the IDE and the graphics/audio were
> hosted in a brower
> much like in Elm (

Have you seen this? I've not used it but I believe it's related:

> I am only dimly aware of other universities teaching ML. I know that
> some folks in Denmark are using F#. Do you know if any schools in Europe
> are using OCaml in intro courses?

Here's a list, to which you can add yourself:

We teach Standard ML at Cambridge, so we have even fewer tools :-) But
then we don't do anything graphical. Our first years do ML & Java, so
they get plenty of graphical / GUI work with Java.

Here's what our ML course looks like (and, basically, has done since 1994):

John Whitington
Director, Coherent Graphics Ltd


Caml-list mailing list.  Subscription management and archives:
Beginner's list:
Bug reports:

robert.muller2 | 25 Nov 17:03 2014

teaching OCaml

Greetings. Bob Muller here, in the CS dept. at Boston College. I've set out to
develop an intro CS course in ML that I hope will be well-suited for similar
universities in the US. My original plan was to teach the course in SML but
after talking with a few people at neighboring schools, I switched to OCaml. I
am now in the final weeks of the first run of the course.  I plan to document
my experience more fully at some point but I wanted to touch base with the
OCaml community because I'm teaching the course again in the spring and I am
leaning toward switching to F#.

While OCaml has in many respects been great and it's easy to see that my
students find the OCaml style of coding very compelling, there are significant
problems. Of course, OCaml wasn't designed for teaching but I'm hoping that
someone on this list might be able to advise me about solutions to some of
these that I just don't know about.

1. Error messages: It's difficult to give good type errors for ML but I was
hoping that the state-of-the-art of type error reporting had improved. When my
students receive a type error, they are utterly mystified,

2. GUIs: several of my problem sets work with simple graphics (e.g., rendering
tessellations) or animations (e.g., a maze walk or a simplified form of
tetris, or the game "Flow"). We have been hobbling along with the Graphics and
Labltk modules for this but it has been more pain than my students ought to
know. We also have some problem sets that work with audio so I would like
support for that.

Any thoughts, ideas and/or leads on either of these would be much appreciated.
I already plan to look at js_of_ocaml more closely.
Thank you,
Bob Muller


Caml-list mailing list.  Subscription management and archives:
Beginner's list:
Bug reports:

Kenneth Adam Miller | 24 Nov 18:42 2014

complications with Arg.parse_argv

So, I'm using a library that calls Arg.parse to build up it's inputs in another data structure. I don't want to rewrite any code, and I'm consuming the library in a different way than how the binary consumes it, which is just to feed it input from the command line. 

Not wanting to replicate code in two locations, I chose to use Arg.parse_argv, and supplied it with an array that would normally be on the command line. For some reason, supplying the exact same speclist as what was used in the original statement that works as a command line tool doesn't result in the parameters being parsed.

command line tool:
Arg.parse speclist anon usage;
get_program () (* consumes the mutable list that speclist modified *)

(* speclist modifies a mutable list used to hold arguments *)

my code that consumes speclist as a library:

Arg.parse_argv custom_arguments speclist anon usage
get_program () (* exact same function as above, exact same variables to Arg.parse* *)

For some reason, Arg.parse_argv seems to complete, but when get_program proceeds, it sees the mutable argument list as being empty. Why?
Announce Announcements | 22 Nov 14:03 2014

ISPDC 2015: First Call for Papers

*** First Call for Papers ***

The 14th International Symposium on Parallel and Distributed
Computing (ISPDC 2015)

29 June - 2 July, 2015, St. Raphael Resort 5*, Limassol, Cyprus

Following very successful previous editions since 2002, the 14th ISPDC
conference will be hosted in Limassol, a beautiful coastal Mediterranean city
on the south coast of Cyprus. The conference will be devoted to a highly
selective program with papers describing original and unpublished research
advancing the state of the art in the field of Parallel and Distributed
Computing paradigms and applications. The goal is to provide an interactive
and friendly, yet professional forum, for original research contributions
describing novel ideas, groundbreaking results and/or experiences.

We kindly invite you to submit original contributions to ISPDC 2015 on topics
including, but not limited to:

System Architectures for Parallel and Distributed Computing
- Multi-Cores, Virtualization
- Clusters and Grid Computing
- Methods and Tools for Parallel and Distributed Programming
- Embedded, Mobile and Networking Environments
- System Architecture and System Software for In-Memory Computing
- Innovative System Architecture for Big Data Processing
- System Architecture for Graph Computing/Processing
- Interconnect Architecture for HPC and Data Centers

High Performance Computing and Large Scale Applications
- Tools and Environments for Parallel Program Design/Analysis
- Scalable Algorithms and Applications
- Urban Networks and Applications, Vehicular Networks
- Parallel, Distributed and Mobile big-Data Management

Parallel Computing and Algorithms
- Parallel Programming Paradigms and APIs
- GPU Programming
- Bio-inspired Parallel Algorithms
- Big Data and Graph Analytics
- Algorithms, Models and Formal Verification

Cloud Computing
- Cloud Resource Provisioning and Allocation
- Pricing of Cloud Resources
- Cloud Performance, and Capacity Management
- Green Cloud Computing
- Mobile Clouds
- Security and Privacy in Clouds
- Cloud Computing Techniques for Big Data
- Storage Architectures for Clouds and Big Data Processing

Distributed and Embedded Computing
- Collaborative Computing, P2P Computing
- Mobile and Ubiquitous Computing
- Web Services and Internet Computing
- Distributed Software Components, Multi-agent Systems
- Parallel Embedded Systems Programming
- Highly Embedded Parallel Systems Support for Programming
- FPGA and SoC Solutions

Performance Modeling, Management and Optimization
- Scheduling and Load Balancing
- Performance Modeling, Analysis and Evaluation
- Optimisation, Security and Dependability

- Real-time Distributed and Parallel Systems
- Visualisation of Massively Parallel Data
- IoT, Social Networks

You are invited to submit original papers of up to 10 pages, written in English
and compliant with the IEEE standard (8.5"x11", two-column). The IEEE
Computer Society Press will publish the proceedings. A best paper award will
be presented to paper(s) receiving the highest quality rating from the
reviewers and the PC.

Key Dates
Submission of full papers: 15 January, 2015
Notification of authors: 15 March, 2015
Camera ready papers: 30 March, 2015
Authors and early registration deadline: 6 May, 2015
Symposium dates: 29 June - 2 July, 2015

General Chair
George A. Papadopoulos, University of Cyprus, Cyprus

Program Committee Co-Chairs
Daniel Grosu, Wayne State University, USA
Hai Jin, Huazhong University of Science and Technology, China

Steering Committee
Ioana Banicescu, Mississippi State University, USA
Hans-Joachim Bungartz, Technische Universität München, Germany
Valentin Cristea, University Politehnica of Bucharest, Romania
Bertil Folliot, University of Paris, France
Dan Grigoras, University College Cork, Ireland
John Morrison, University College Cork, Ireland
Traian Muntean, Aix Marseille University, France
Dana Petcu, Western Univ. of Timisoara and e-Austria, Timisoara, Romania
Marek Tudruj, Polish Acad. of Sciences and PJIIT, Warsaw, Poland

Program Committee

This is not SPAM. If you want to be removed from this list,
please send an email to [announce <at>] with the
single word 'remove' in the subject of the email.
Ashish Agarwal | 22 Nov 19:16 2014

Call for Presentations: Compose Conference [New York, Jan 30-Feb 1]

Compose is a new conference for typed functional programmers, focused specifically on Haskell, OCaml, F#, and related technologies. It will be held in New York from Jan 30-Feb 1, and registration is opening shortly.

Below is our call for presentations. We recognize the deadline is tight, so feel free to submit proposals and ideas on the less-polished side.

Call for Presentations and Speakers.


The audience for Compose is Haskell, OCaml, or F# developers who are looking to increase their skills or learn new technologies and libraries. Presentations should be aimed at teaching or introducing new ideas or tools. We are also interested in presentations aiming at taking complex concepts, such as program derivation, and putting them into productive use. However proposals on anything that you suspect our audience may find interesting are welcome. The following are some of the types of talks we would welcome:

Library/Tool Talks — Exploring the uses of a powerful toolkit or library, be it for parsing, testing, data access and analysis, or anything else.

Production Systems — Experience reports on deploying functional techniques in real systems; insights revealed, mistakes made, lessons learned.

Theory made Practical — Just because it’s locked away in papers doesn’t mean it’s hard! Accessible lectures on classic results and why they matter to us today. Such talks can include simply introducing the principles of a field of research so as to help the audience read up on it in the future; from abstract machines to program derivation to branch-and-bound algorithms, the sky’s the limit.

We also welcome proposals for more formal tutorials for the Sunday unconference. Such tutorials should be aimed at a smaller audience of beginner-to-novice understanding, and ideally include hands-on exercises.

The due date for submissions is November 30, 2014. We will send out notice of acceptance by 10 December. We prefer that submissions be via the EasyChair website ( Please suggest a title, and describe the topic you intend to speak on.

Additional information may be included on both your expertise and the interesting elements of your topic, going on what might be included in a public abstract. Furthermore, if your abstract doesn't feel "final"—don't worry! We'll work with you to polish it up. If you want to discuss your proposal(s) before submitting, or to further nail down what you intend to speak on, please feel free to contact us at info We're happy to work with you, even if you are a new or inexperienced speaker, to help your talk be great.


Geoff Sutcliffe | 21 Nov 23:20 2014

CFP for the 9th TESTS AND PROOFS (TAP 2015)

*  9th International Conference
*  on

*  Part of STAF 2015, L'Aquila, Italy, July 20-24, 2015

*  Call for Papers
*  Abstract submission: February 13, 2015
*  Paper submission:    February 20, 2015


The TAP conference is devoted to the synergy of proofs and tests, to
the application of techniques from both sides and their combination
for the advancement of software quality.

Testing and proving seem to be orthogonal techniques: Once a program
has been proven to be correct then additional testing seems pointless;
however, when such a proof in not feasible, then testing the program
seems to be the only option. This view has dominated the research
community for a long time, and has resulted in distinct communities
pursuing the different research areas.

The development of both approaches has led to the discovery of common
issues and to the realization of potential synergy. Perhaps the use of
model checking in testing was one of the first signs that a
counterexample to a proof may be interpreted as a test case. Recent
breakthroughs in deductive techniques such as satisfiability modulo
theories, abstract interpretation, and interactive theorem proving
have paved the way for new and practically effective methods of
powering testing techniques. Moreover, since formal, proof-based
verification is costly, testing invariants and background theories can
be helpful to detect errors early and to improve cost effectiveness.
Summing up, in the past few years an increasing number of research
efforts have encountered the need for combining proofs and tests,
dropping earlier dogmatic views of incompatibility and taking instead
the best of what each of these software engineering domains has to

The TAP conference aims to bring together researchers and
practitioners working in the converging fields of testing and proving
by offering a generous forum for the presentation of ongoing research,
for tutorials on established technologies and for informal

Topics of Interest

Topics of interest cover theory definitions, tool constructions and
experimentations, and include among others:

- Bridging the gap between concrete and symbolic techniques, e.g.
  using proof search in satisfiability modulo theories solvers to
  enhance various testing techniques
- Transfer of concepts from testing to proving (e.g., coverage
  criteria) and from proving to testing
- Program proving with the aid of testing techniques
- Verification and testing techniques combining proofs and tests
- Generation of test data, oracles, or preambles by deductive
  techniques such as: theorem proving, model checking, symbolic
  execution, constraint logic programming
- Model-based testing and verification
- Generation of specifications by deduction
- Automatic bug finding
- Debugging of programs combining static and dynamic analysis
- Case studies combining tests and proofs
- Domain specific applications of testing and proving to new
  application domains such as validating security protocols,
  vulnerability detection of programs, security
- Testing of verification environments and reasoning engines like
  solvers and theorem provers
- New approaches such as crowd-sourcing and serious games to
  infer intended semantics and assess correctness
- Formal frameworks
- Tool descriptions and experience reports

Important Dates:

Abstract submission:     February 13, 2015
Paper submission:         February 20, 2015
Notification:                   April 13, 2015
Camera-ready version: May 3, 2015
STAF conference:          July 20-24, 2015

Program Co-Chairs:

Jasmin C. Blanchette (TU Muenchen, Inria)
Nikolai Kosmatov (CEA LIST)

Program Committee:

Bernhard K. Aichernig
Dirk Beyer
Nikolaj Bjorner
Jasmin C. Blanchette
Achim D. Brucker
Koen Claessen
Robert Clariso
Marco Comini
Catherine Dubois
Juhan Ernits
Gordon Fraser
Angelo Gargantini
Christoph Gladisch
Martin Gogolla
Arnaud Gotlieb
Reiner Haehnle
Bart Jacobs
Thierry Jeron
Jacques Julliand
Gregory Kapfhammer
Nikolai Kosmatov
Victor Kuliamin
Panagiotis Manolios
Karl Meinke
Alexandre Petrenko
Andrew Reynolds
Martina Seidl
Nikolai Tillmann
T.H. Tse
Margus Veanes
Luca Vigano
Burkhart Wolff
Fatiha Zaidi


Please submit your papers via EasyChair:

TAP 2015 will accept three kinds of submissions:

- Regular research papers: full papers with at most 16 pages in LNCS
  format (PDF), which have to be original, unpublished and not
  submitted elsewhere. Research papers should clearly describe the
  addressed problem, the relevant state-of-the-art, the
  scientifically-founded solution, and the benefits of the presented

- Short contributions: work in progress, (industrial) experience
  reports or tool demonstrations, position statements; an extended
  abstract with at most 6 pages in LNCS format (PDF) is expected. The
  same evaluation criteria apply to short papers as to regular
  research papers. Short papers will be reviewed to the same standards
  of quality as regular research papers.

- Tutorial proposals: TAP 2015 further invites one-hour tutorial
  presentations surveying the state-of-the-art of any research field
  related to the topics of TAP. Tutorial proposals shall have a
  maximum length of 3 pages in LNCS format (PDF) and provide
  information about the content, a short outline, information about
  the speakers and previous related tutorials given by the speakers
  (if any).

Accepted full and short papers will be published in the Springer LNCS
series and will be available at the conference. Accepted tutorials
will be assigned a slot of 60 minutes during the conference.

The content of last year's proceedings is available at


Caml-list mailing list.  Subscription management and archives:
Beginner's list:
Bug reports:

Ashish Agarwal | 21 Nov 19:39 2014

OR-patterns with GADTs

The following works fine:

type foo
type bar
type _ t =
| Foo : string -> foo t
| Bar : string -> bar t

let to_string : type a . a t -> string = function
  | Foo x -> x
  | Bar x -> x

However, if you try to avoid the redundant code of the two branches, you get a compile error:

let to_string : type a . a t -> string = function
  | Foo x
  | Bar x -> x

Error: This pattern matches values of type foo t
       but a pattern was expected which matches values of type a t
       Type foo is not compatible with type a

Is there a real reason for this?

Announce Announcements | 19 Nov 17:50 2014

WIMS 2015: Call for Tutorials, Demos and Workshops

*** Call for Tutorials, Demos and Workshops ***

5th International Conference on Web Intelligence, Mining and Semantics

WIMS 2015

July 13-15, 2015, St. Raphael Resort, Limassol, Cyprus

The 5th International Conference on Web Intelligence, Mining and Semantics
(WIMS 2015) organization committee invites proposals for tutorials,
demonstrations (on new applications) and workshops providing in-depth
background on subjects that are of broad interest to the Web Mining and Web
Semantics community. The overall purpose of tutorials and workshops is to
provide participants with the opportunity to present and discuss novel
research ideas in areas of Web intelligence, Web mining and Web semantics,
with a particular emphasis on the fundamental interaction between these
vibrant fields of research and development. The purpose of demonstrations
is to provide developers with a place to showcase new practical and innovative
implementations of state-of-the-art systems in the areas of interest to the
Web Intelligence and Semantics community.

Tutorials and workshops provide a forum for an intensive and focused
scientific exchange amongst researchers and practitioners interested in a
particular topic and a meeting venue for the community. Organizers may
structure tutorials/workshops as they see fit, possibly including invited talks,
panel discussions, presentations of work in progress, peer-reviewed papers,
demonstrations or some combination. A tutorial/workshop could be
scheduled for a half a day or a full day, depending on potential interest and
organizers preference.

The proposals should address topics that satisfy the following criteria:

* The topic falls in the general scope of WIMS 2015
* There is a clear focus on a specific theme, technology, problem, or
* There is a sufficiently large audience interested in the topic.

The organizers of successful workshops will be responsible for their own
reviewing process, website, arranging invited speakers and coordinate the
collection and delivery of camera ready material. There is an opportunity for
papers accepted in workshops to be published in the WIMS 2015 proceedings
and disseminated through the ACM Digital Library, provided they follow the
ACM submission guidelines and template and adhere to camera-ready
submission and registration deadlines as those set for the main conference.
Selected extended papers will be invited to appear in a special issue of a
reputed journal in the field.

Important Dates

15.12.2014 Submission of proposals

12.01.2015 Notification of acceptance

Proposal Details

A proposal should be not more than 4 pages in length and should be in PDF
format. It should contain the following information:

* A title of the tutorial/demonstration/workshop
* Name, affiliation, postal address and email of contact person
* Names and affiliations of organisers
* A 150 word abstract
* Aims and scope
* Important dates (for tutorials/workshops)
* Description of the proposed tutorial/workshop
* Estimated duration of the tutorial/workshop (half day, full day, etc.)

Proposals should be submitted via email to the tutorial and
workshop chairs.

Submission Procedure – EasyChair

Submissions should be made electronically in PDF format via the electronic
submission system of the WIMS 2015 Conference Management system at:

If you do not have an EasyChair account, then register and once you get the
log-in information by mail, log into the system as an author. Enter all the
required data about your submission and finally upload your contributed
paper in PDF format.

WIMS 2015 Tutorial and Workshop Chairs

Monika Solanki, Aston University, United Kingdom
Freddy Lecue, IBM Research, Ireland

This is not SPAM. If you want to be removed from this list,
please send an email to [announce <at>] with the
single word 'remove' in the subject of the email.
CIE | 20 Nov 08:53 2014

Final Call - 12th Annual Conference on Theory and Applications of Models of Computation (TAMC 2015), Singapore 18-20 May, 2015

Final Call for Papers for the 12th Annual Conference on

  Theory and Applications of Models of Computation (TAMC 2015)
  18 - 20 May 2015 (Submission Deadline 27 November 2014)
  Deadline 27 November 2014

School of Computing, National University of Singapore

TAMC 2015 aims at bringing together a wide range of researchers with
interests in computational theory and applications. For more than 10
years, the conference series "Theory and Applications of Models of
Computing" has fostered interactions and collaborations between both
theoretical and applied researchers working on all aspects of
computations and the ways to model it.

Invited Speakers:
Lance Fortnow (Georgia Institute of Technology),
Miklos Santha (CNRS, Univ. Paris Diderot and CQT, Nat. Univ. of Singapore),
Alexandra Shlapentokh (East Carolina University).

Conference Chair: Sanjay Jain.
Programme Committee Chairs: Rahul Jain and Frank Stephan.
Programme Committee: Ajith Abraham, Anthony Bonato, Yijia Chen, Rodney
G. Downey, Henning Fernau, Dimitris Fotakis, Gopal T V, Steffen Lempp,
Jiamou Liu, Frederic Magniez, Klaus Meer, Mia Minnes, Philippe
Moser, Mitsunori Ogihara, Yota Otachi, Yicheng Pan, Pan Peng, Anil
Seth, Xiaoming Sun, Chaitanya Swamy, Hongan Wang, Wei Wang, Guohua Wu,
Yitong Yin, Mingsheng Ying, Neal Young, Thomas Zeugmann, Shengyu
Zhang, Conghua Zhou.

Submission due: Thu 27 November 2014 at 23:59 hrs GMT.
Notification: Tue 20 January 2015.
Final Version due: Tue 3 February 2015.
Conference: Mon 18 - Wed 20 May 2015

Proceedings: The proceedings of TAMC 2015 will appear in the
Springer LNCS series. Submissions should be 12 pages in llncs-format.
For details on submissions and other aspects, please consult the
TAMC 2015 homepage at

Topics: TAMC 2015 is open for all topics relating to the theory and
applications of models of computation. The topics include algebraic
computation, algorithmic coding and number theory, algorithmic
learning theory, approximation algorithms, automata theory, circuit
complexity, communication complexity, complex networks and their
theory, combinatorial algorithms, computability and recursion theory,
computational biology, computational complexity, computational
geometry, continuous and real computation, cryptography, data
structures, design and analysis of algorithms, distributed algorithms,
domain models, fixed parameter tractability, formal languages, game
theory, geometric algorithms, grammatical inference, graph algorithms,
graph mining, information theory, internet mathematics, memory
hierarchy tradeoffs, model theory for computing, natural computing,
network algorithms, network security and applications, online
algorithms, optimisation, parallel algorithms, philosophy of
computing, privacy and security, property testing, proof complexity,
process models, quantum computation, randomness, randomised
algorithms, space-time tradeoffs, streaming algorithms, systems
theory, VLSI models of computation.

TAMC in previous years: The conference series TAMC started in the year
2004 and has been held annually since then. The previous conferences
are the following: Beijing China 2004, Kunming China 2005, Beijing
China 2006, Shanghai China 2007, Xian China 2008, Changsha China 2009,
Prague Czech Republic 2010, Tokyo Japan 2011, Beijing China 2012, Hong
Kong China 2013, Chennai India 2014. 


Caml-list mailing list.  Subscription management and archives:
Beginner's list:
Bug reports: