Mailing list for all users of the OCaml language and system.
 help / color / mirror / Atom feed
From: Alan Schmitt <alan.schmitt@polytechnique.org>
To: "lwn" <lwn@lwn.net>, caml-list@inria.fr
Subject: [Caml-list] Attn: Development Editor, Latest OCaml Weekly News
Date: Tue, 25 Jun 2024 15:58:43 +0200	[thread overview]
Message-ID: <m2bk3pceek.fsf@mac-03220211.irisa.fr> (raw)

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

Hello

Here is the latest OCaml Weekly News, for the week of June 18 to 25,
2024.

Table of Contents
─────────────────

First public editor tooling dev-meeting
First release of oma
Ppxlib dev meetings
CAISAR release 2.0, a platform for characterizing AI safety and robustness
First release of baby
Preview of Stripe client and mock server - DkStdRestApis
opam 2.2.0 rc1 release
Project wide occurrences
Other OCaml News
Old CWN


First public editor tooling dev-meeting
═══════════════════════════════════════

  Archive:
  <https://discuss.ocaml.org/t/ann-first-public-editor-tooling-dev-meeting/14824/1>


vds announced
─────────────

  We are organizing the first public dev-meeting about Merlin, OCaml-LSP
  and more generally editor support for OCaml. This meeting will take
  place on *Thursday, June 27th*, at 05:00 pm CEST. We plan to have
  these happen every last Thursday of the month.

  The goal of these meetings is to provide a place for all contributors
  of these projects to discuss their work together. Whether you are a
  long time maintainer, an occasional contributor, a new comer, or
  simply a curious passer-by, please feel free to join and participate!

  We also plan to have some short technical presentations to help
  contributors learn more about the projects involved. These won't be
  systematic, and if you are interested in a particular subject feel
  free to ask about it or to propose a presentation.

  The agenda for this first meeting, which will be focused on the
  burning topic of project-wide occurrences, is the following:

  • A tour-de-table to allow the participants that wish to do so to
    present themselves and mention issues / prs they are interested in.
  • A presentation of current on-going projects.
  • A focus on project-wide occurrences: how does it work, what are the
    tools that need to interact together and what are its current
    limitations and possible future improvements.
  • Discuss issues and pull requests that were tagged in advance or
    mentioned during the tour-de-table.
  • Informal discussion

  We looking forward to meeting you!

  Meeting link: <https://meet.google.com/imo-mkxi-hpt>


First release of oma
════════════════════

  Archive:
  <https://discuss.ocaml.org/t/ann-first-release-of-oma/13845/2>


François Pottier announced
──────────────────────────

  I have just published a new release of `oma' with the following fixes
  and changes:

  • New functions `invalidate_open_interval' and
    `invalidate_semi_open_interval'.
  • Fix a serious bug in `Unsafe.first' and `Unsafe.last', which would
    incorrectly return `None' when the region contains only one point.
  • Fix a serious bug in `Unsafe.iter', which would systematically omit
    the last point of the region.


Ppxlib dev meetings
═══════════════════

  Archive: <https://discuss.ocaml.org/t/ppxlib-dev-meetings/12441/25>


Nathan Rebours announced
────────────────────────

  Meeting notes are available here:
  <https://github.com/ocaml-ppx/ppxlib/wiki/Dev-Meeting-2024-06-18>.

  Thanks to everyone who attended!

  Our next meeting is scheduled for Tuesday July 16th, 6:00PM CET!


CAISAR release 2.0, a platform for characterizing AI safety and robustness
══════════════════════════════════════════════════════════════════════════

  Archive:
  <https://discuss.ocaml.org/t/ann-caisar-release-2-0-a-platform-for-characterizing-ai-safety-and-robustness/14831/1>


Julien Girard announced
───────────────────────

  On the occasion of the 34th birthday of the [abolition of the
  apartheid laws], we are honoured to release CAISAR version 2.0.

  The release source is available at our [public forge]. As our last
  releases, CAISAR will soon be available on [opam] and on [Dockerhub].

  A nix flake is available for building CAISAR directly in the
  repository. Try CAISAR with `nix build
  git+https://git.frama-c.com/pub/caisar'!

  Here are the prominent features for this 2.0 release:


[abolition of the apartheid laws]
<https://www.dw.com/fr/il-y-a-25-ans-la-fin-de-lapartheid/a-18523920>

[public forge] <https://git.frama-c.com/pub/caisar/-/releases/2.0>

[opam] <https://opam.ocaml.org/packages/caisar/>

[Dockerhub] <https://hub.docker.com/r/laiser/caisar>

Specification and verification of several neural networks at once
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  CAISAR specification language already allowed to write specifications
  that involved several neural networks at once. However, translating
  such specifications to actual prover queries was not possible. We
  added automated graph editing techniques to allow such verification to
  take place. Within particular patterns, CAISAR will generate an ONNX
  file that preserve the semantic of the different neural networks while
  encapsulating parts of the specification directly in the control flow
  of the new neural network. This feature allow the verification of
  properties with multiple neural networks, including their composition.

  This is quite a step forward, as it enables machine-learning dedicated
  verifiers to tackle a much wider range of properties.


SVM as first-class citizens for interpretation
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  CAISAR now fully integrate SVMs into the interpretation engine. Users
  can expect vector computations and applications on SVMs to be computed
  similarly as what exists already for neural networks.

  We also unified the theory of machine learning models. Now, SVMs and
  neural networks can be specified with only the `model' type. In the
  near future, SVMs will be parsed directly into CAISAR’s Neural
  Intermediate Representations, which will simplify the verification of
  systems with heterogeneous AI components.


First release of baby
═════════════════════

  Archive:
  <https://discuss.ocaml.org/t/ann-first-release-of-baby/14840/1>


François Pottier announced
──────────────────────────

  It is my pleasure to announce the first release of `baby'.

  `baby' is an OCaml library that offers several implementations of
  balanced binary search trees. At this time, `baby' offers a
  replacement for OCaml's `Set' module; it does not yet have a
  replacement for OCaml's `Map' module.

  Height-balanced and weight-balanced binary search trees are offered
  out of the box. Furthermore, to advanced users, the library offers a
  lightweight way of implementing other balancing strategies.

  The following points offer a comparison between `baby' and OCaml's
  `Set' library.


Better Performance
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  At the time of writing, `baby' offers generally better performance
  than OCaml's `Set' library. Its operations are generally faster
  (sometimes much faster; sometimes slightly faster; sometimes slightly
  slower) than those of the `Set' library, and its memory allocation
  rate is slightly lower.


Constant-Time Cardinal
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  In contrast with the `Set' library, `baby''s weight-balanced trees
  offer a `cardinal' function whose time complexity is *O(1)*. They also
  offer a family of random access functions (`get', `index', etc.) whose
  time complexity is *O(log n)*. Furthermore, by exploiting cardinality
  information, the functions `subset' and `equal' are sometimes able to
  return `false' in constant time.


Better Sharing
╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  `baby''s binary operations (`union', `inter', `diff') take advantage
  of (and preserve) physical equality in a more aggressive way. This
  allows them to (sometimes) be faster and allocate less memory.


Adaptive Conversions To Sets
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  `baby''s conversion functions `of_list', `of_array', and `of_seq' have
  adaptive complexity. If the input data is sorted, their complexity is
  *O(n)*; otherwise, their complexity gracefully degrades down to
  *O(n.log n)*.


More Operations
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  `baby' offers a few operations that do not exist in OCaml's `Set'
  library:

  ⁃ The symmetric difference, `xor';
  ⁃ The conversion functions `of_array' and `to_array';
  ⁃ The extremum-removal functions `remove_min_elt' and
    `remove_max_elt';
  ⁃ The enumeration API in the submodule `Enum'. Enumerations should be
    slightly faster than standard sequences, and are able to efficiently
    seek ahead, via the function `from'.


Documented Complexity
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  In `baby', the time complexity of every operation is documented.


Compatibility
╌╌╌╌╌╌╌╌╌╌╌╌╌

  `baby' is perfectly compatible with OCaml's Set library. In other
  words, using `Baby.W.Set' instead of `Set' is safe.

  As a word of warning, though, if the equivalence relation on elements
  is coarser than equality (that is, if `compare x y = 0' does not imply
  `x = y'), then `Baby.W.Set' and `Set' might behave differently when a
  choice must be made between two equivalent elements. This can occur in
  `union', `of_list', `of_array', `of_seq', `add_seq', `map'.


Preview of Stripe client and mock server - DkStdRestApis
════════════════════════════════════════════════════════

  Archive:
  <https://discuss.ocaml.org/t/ann-preview-of-stripe-client-and-mock-server-dkstdrestapis/14841/1>


jbeckford announced
───────────────────

  I am pleased to announce that Stripe is the first REST API available
  in the DkStdRestApis project:

  <https://github.com/diskuv/DkStdRestApis?tab=readme-ov-file>

  That README has a 10-minute quick start; you can do it with or without
  a Stripe account.

  The Stripe client and mock server have Apache 2.0 licensing and were
  generated using a new OpenAPI code generator. The code generator is
  not part of this preview announcement (wait until DkCoder 0.4
  announcement) but since there have been a couple generators released
  in the past month perhaps it is best to say what is different:

  1. Both client and server source code are generated. The client
     examples include direct web requests by cohttp-lwt-curl
     (`src/DkStdRestApis_NotStripe/Curl2.ml') and also indirectly by
     printing the `curl -d name=value https://api.stripe.com/...'
     command (`src/DkStdRestApis_NotStripe/CurlCmd.ml'). The mock server
     example (`src/DkStdRestApis_NotStripe/ServerTiny.ml') uses @c-cube
     's [excellent tiny_httpd daemon].
  2. Very small dependency cone that works on Windows/macOS/Linux
     (including the REST server). And the minimum OCaml version will be
     4.14 for the foreseeable future.
  3. My focus is not on the code generator but having working,
     maintainable REST clients for the major cloud/SaaS services that
     can be included in DkCoder's liberally licensed standard
     library. The server feature was a pleasant but very unplanned
     accident. If I do take time to develop fancier server features
     (ex. replaying mocks from a corpus, etc.) those additions will not
     be open source.
  4. It is intended to have high coverage of OpenAPI features. Today
     that includes form URL encoding, sum types, server-side
     polymorphism and style/explode support. The only major feature that
     is intentionally unsupported is the `not' composition operator
     (have no idea how to express negation in OCaml's type system!).

  Now for the problems:

  1. Stripe only compiles in bytecode mode. Why? The generated modules
     are huge (8+ MB in total) because Stripe's specification is
     6MB. Native compilation [can't handle that today].
  2. I'm not releasing to opam until I'm sure that native compilation
     won't denial-of-service developer and opam machines. I'm also
     waiting for some Windows patches to dependencies to be released.

  Thanks to @vlaviron for helping solve some of the compilation scaling
  problems. And thanks to Nomadic Labs (and OCamlPro?) for developing
  [Json_encoding] and @anuragsoni for developing [Routes]; they are both
  bidirectional + lightweight + foundational.

  Report bugs / add stars [in the DkCoder project].


[excellent tiny_httpd daemon] <https://v3.ocaml.org/p/tiny_httpd/latest>

[can't handle that today] <https://github.com/ocaml/ocaml/issues/13250>

[Json_encoding] <https://v3.ocaml.org/p/json-data-encoding/latest>

[Routes] <https://v3.ocaml.org/p/routes/latest/doc/index.html>

[in the DkCoder project] <https://github.com/diskuv/dkcoder>


opam 2.2.0 rc1 release
══════════════════════

  Archive:
  <https://discuss.ocaml.org/t/ann-opam-2-2-0-rc1-release/14842/1>


R. Boujbel announced
────────────────────

  We’re once again very excited to announce this first release candidate
  (and hopefully only) for opam 2.2.0.


What’s new in this rc?
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  • Fix `opam upgrade' wanting to keep rebuilding the compiler (as now
    it contains an `x-env-path-rewrite' field)
  • Provide defaults so `opam init -y' no longer asks questions on
    Windows
  • Fix `OpamConsole.menu' when there are more than 9 options (can
    happen on Windows)
  • A couple more fixes and general improvements

  :open_book: You can read our [blog post ] for more information about
  these changes and more, and for even more details you can take a look
  at the [release note ] or the [changelog].


[blog post ] <https://opam.ocaml.org/blog/opam-2-2-0-rc1/>

[release note ] <https://github.com/ocaml/opam/releases/tag/2.2.0-rc1>

[changelog] <https://github.com/ocaml/opam/blob/2.2.0-rc1/CHANGES>


Windows issues
╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  Configuration of Windows is tricky, so please don’t be too
  disheartened if things don’t work instantly. If something doesn’t work
  first time, [please do report it ], even if you manage to find a way
  to workaround it. If opam didn’t elegantly tell you what was wrong,
  then it’s a bug and we’d love to hear about it, rather than ending up
  with a series of workarounds flying around. It’s no problem at all for
  us to receive a bug report which turns out to be user error - we’d far
  rather that than not hear bugs which are opam’s error! :scream_cat:


[please do report it ] <https://github.com/ocaml/opam/issues>


How to upgrade
╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  For Unix systems

  ┌────
  │ bash -c "sh <(curl -fsSL https://raw.githubusercontent.com/ocaml/opam/master/shell/install.sh) --version 2.2.0~rc1"
  └────

  or from PowerShell for Windows systems

  ┌────
  │ Invoke-Expression "& { $(Invoke-RestMethod https://raw.githubusercontent.com/ocaml/opam/master/shell/install.ps1) }"
  └────

  We’re planning for a final opam 2.2.0 release next week, so please do
  report any issue you encounter on our [bug-tracker ].


[bug-tracker ] <https://github.com/ocaml/opam/issues>


Project wide occurrences
════════════════════════

  Archive:
  <https://discuss.ocaml.org/t/ann-project-wide-occurrences/14847/1>


vds announced
─────────────

  I am very excited to announce the first release of Merlin and
  Ocaml-LSP with support for project-wide occurrences 🥳. More
  precisely, it is now possible to query for every _usage_ of any value
  (and type, modules, etc.) anywhere in a project built with Dune. This
  is a very handy tool for code navigation !


Requirements
╌╌╌╌╌╌╌╌╌╌╌╌

  • OCaml 5.2
  • Latest Dune (>= `3.16.0')
  • Latest Merlin (>= `5.1-502')
  • Latest OCaml-LSP preview (`1.18.0~5.2preview')


Usage
╌╌╌╌╌

  • Build the new `@ocaml-index' alias.
  > We recommend running the indexation in watch mode along with your
    usual targets: `dune build @ocaml-index --watch' so that the index
    is always up to date.
  • Use the `Find/Peek all references' feature of LSP-based plugins
    • or `merlin-project-occurrences' in emacs
    • or `OccurrencesProjectWide' in vim.
  • Enjoy jumping around 🦘

  <https://global.discourse-cdn.com/business7/uploads/ocaml/original/2X/c/c282815986f60d12069d33bc13f22fcdb70f0022.gif>


More information and bug reports
╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌╌

  Bug reports and feature requests should be submitted to the Merlin
  [issue tracker]. There are already some known issues like the absence
  of declarations in the results and the impossibility to query from a
  declaration. Progress on occurrences can be tracked in a [pinned
  meta-issue]. If you are interested in contributing and learning more
  about the feature do not hesitate to join the [first public
  dev-meeting] on Thursday !


[issue tracker] <https://github.com/ocaml/merlin/issues>

[pinned meta-issue] <https://github.com/ocaml/merlin/issues/1780>

[first public dev-meeting]
<https://discuss.ocaml.org/t/ann-first-public-editor-tooling-dev-meeting/14824/1>


Other OCaml News
════════════════

From the ocaml.org blog
───────────────────────

  Here are links from many OCaml blogs aggregated at [the ocaml.org
  blog].

  • [Keeping Up With the Compiler: How we Help Maintain the OCaml
    Language]


[the ocaml.org blog] <https://ocaml.org/blog/>

[Keeping Up With the Compiler: How we Help Maintain the OCaml Language]
<https://tarides.com/blog/2024-06-19-keeping-up-with-the-compiler-how-we-help-maintain-the-ocaml-language>


Old CWN
═══════

  If you happen to miss a CWN, you can [send me a message] and I'll mail
  it to you, or go take a look at [the archive] or the [RSS feed of the
  archives].

  If you also wish to receive it every week by mail, you may subscribe
  to the [caml-list].

  [Alan Schmitt]


[send me a message] <mailto:alan.schmitt@polytechnique.org>

[the archive] <https://alan.petitepomme.net/cwn/>

[RSS feed of the archives] <https://alan.petitepomme.net/cwn/cwn.rss>

[caml-list] <https://sympa.inria.fr/sympa/info/caml-list>

[Alan Schmitt] <https://alan.petitepomme.net/>


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

             reply	other threads:[~2024-06-25 13:58 UTC|newest]

Thread overview: 236+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2024-06-25 13:58 Alan Schmitt [this message]
  -- strict thread matches above, loose matches on Subject: below --
2025-04-15  9:51 Alan Schmitt
2025-04-08 13:14 Alan Schmitt
2025-04-01  9:12 Alan Schmitt
2025-03-25  8:06 Alan Schmitt
2025-03-18 10:18 Alan Schmitt
2025-03-11 15:00 Alan Schmitt
2025-03-04 14:01 Alan Schmitt
2025-02-25 10:36 Alan Schmitt
2025-02-18 14:33 Alan Schmitt
2025-02-11  7:17 Alan Schmitt
2025-02-04 12:05 Alan Schmitt
2025-01-28 13:24 Alan Schmitt
2025-01-21 15:47 Alan Schmitt
2025-01-14  8:20 Alan Schmitt
2025-01-07 17:26 Alan Schmitt
2024-12-31  8:03 Alan Schmitt
2024-12-24  8:55 Alan Schmitt
2024-12-17 13:05 Alan Schmitt
2024-12-10 13:48 Alan Schmitt
2024-12-03 14:44 Alan Schmitt
2024-11-26  8:30 Alan Schmitt
2024-11-19  6:52 Alan Schmitt
2024-11-12 15:00 Alan Schmitt
2024-11-05 13:22 Alan Schmitt
2024-10-29 13:30 Alan Schmitt
2024-10-22 12:42 Alan Schmitt
2024-10-15 13:31 Alan Schmitt
2024-10-08 10:56 Alan Schmitt
2024-10-01 13:37 Alan Schmitt
2024-09-24 13:18 Alan Schmitt
2024-09-17 14:02 Alan Schmitt
2024-09-10 13:55 Alan Schmitt
2024-09-03  8:24 Alan Schmitt
2024-08-27  9:02 Alan Schmitt
2024-08-20  9:29 Alan Schmitt
2024-08-13 13:21 Alan Schmitt
2024-08-06  9:00 Alan Schmitt
2024-07-30 13:26 Alan Schmitt
2024-07-23 13:30 Alan Schmitt
2024-07-16  6:24 Alan Schmitt
2024-07-09  9:19 Alan Schmitt
2024-07-02  7:30 Alan Schmitt
2024-06-18 13:05 Alan Schmitt
2024-06-11 15:04 Alan Schmitt
2024-06-04 13:26 Alan Schmitt
2024-05-28  9:07 Alan Schmitt
2024-05-21 13:07 Alan Schmitt
2024-05-14 13:25 Alan Schmitt
2024-05-07  7:30 Alan Schmitt
2024-04-30  7:22 Alan Schmitt
2024-04-23 12:17 Alan Schmitt
2024-04-16 12:00 Alan Schmitt
2024-04-09  9:15 Alan Schmitt
2024-04-02 14:31 Alan Schmitt
2024-03-26  6:32 Alan Schmitt
2024-03-19 15:09 Alan Schmitt
2024-03-12 10:31 Alan Schmitt
2024-03-05 14:50 Alan Schmitt
2024-02-27 13:53 Alan Schmitt
2024-02-20  9:12 Alan Schmitt
2024-02-13  8:42 Alan Schmitt
2024-02-06 15:14 Alan Schmitt
2024-01-30 14:16 Alan Schmitt
2024-01-23  9:45 Alan Schmitt
2024-01-16 10:01 Alan Schmitt
2024-01-09 13:40 Alan Schmitt
2024-01-02  8:59 Alan Schmitt
2023-12-26 10:12 Alan Schmitt
2023-12-19 10:10 Alan Schmitt
2023-12-12 10:20 Alan Schmitt
2023-12-05 10:13 Alan Schmitt
2023-11-28  9:09 Alan Schmitt
2023-11-21  7:47 Alan Schmitt
2023-11-14 13:42 Alan Schmitt
2023-11-07 10:31 Alan Schmitt
2023-10-31 10:43 Alan Schmitt
2023-10-24  9:17 Alan Schmitt
2023-10-17  7:46 Alan Schmitt
2023-10-10  7:48 Alan Schmitt
2023-10-03 13:00 Alan Schmitt
2023-09-19  8:54 Alan Schmitt
2023-09-12 13:21 Alan Schmitt
2023-09-05  9:00 Alan Schmitt
2023-08-29 13:04 Alan Schmitt
2023-08-22  9:20 Alan Schmitt
2023-08-15 16:33 Alan Schmitt
2023-08-08  8:53 Alan Schmitt
2023-08-01  7:13 Alan Schmitt
2023-07-25  8:45 Alan Schmitt
2023-07-11  8:45 Alan Schmitt
2023-07-04  9:18 Alan Schmitt
2023-06-27  8:38 Alan Schmitt
2023-06-20  9:52 Alan Schmitt
2023-06-13  7:09 Alan Schmitt
2023-06-06 14:22 Alan Schmitt
2023-05-30 15:43 Alan Schmitt
2023-05-23  9:41 Alan Schmitt
2023-05-16 13:05 Alan Schmitt
2023-05-09 11:49 Alan Schmitt
2023-05-02  8:01 Alan Schmitt
2023-04-25  9:25 Alan Schmitt
2023-04-18  8:50 Alan Schmitt
2023-04-11 12:41 Alan Schmitt
2023-04-04  8:45 Alan Schmitt
2023-03-28  7:21 Alan Schmitt
2023-03-21 10:07 Alan Schmitt
2023-03-14  9:52 Alan Schmitt
2023-03-07  9:02 Alan Schmitt
2023-02-28 14:38 Alan Schmitt
2023-02-21 10:19 Alan Schmitt
2023-02-14  8:12 Alan Schmitt
2023-02-07  8:16 Alan Schmitt
2023-01-31  6:44 Alan Schmitt
2023-01-24  8:57 Alan Schmitt
2023-01-17  8:37 Alan Schmitt
2022-11-29 14:53 Alan Schmitt
2022-09-27  7:17 Alan Schmitt
2022-09-20 14:01 Alan Schmitt
2022-09-13  8:40 Alan Schmitt
2022-08-23  8:06 Alan Schmitt
2022-08-16  8:51 Alan Schmitt
2022-08-09  8:02 Alan Schmitt
2022-08-02  9:51 Alan Schmitt
2022-07-26 17:54 Alan Schmitt
2022-07-19  8:58 Alan Schmitt
2022-07-12  7:59 Alan Schmitt
2022-07-05  7:42 Alan Schmitt
2022-06-28  7:37 Alan Schmitt
2022-06-21  8:06 Alan Schmitt
2022-06-14  9:29 Alan Schmitt
2022-06-07 10:15 Alan Schmitt
2022-05-31 12:29 Alan Schmitt
2022-05-24  8:04 Alan Schmitt
2022-05-17  7:12 Alan Schmitt
2022-05-10 12:30 Alan Schmitt
2022-05-03  9:11 Alan Schmitt
2022-04-26  6:44 Alan Schmitt
2022-04-19  5:34 Alan Schmitt
2022-04-12  8:10 Alan Schmitt
2022-04-05 11:50 Alan Schmitt
2022-03-29  7:42 Alan Schmitt
2022-03-22 13:01 Alan Schmitt
2022-03-15  9:59 Alan Schmitt
2022-03-01 13:54 Alan Schmitt
2022-02-22 12:43 Alan Schmitt
2022-02-08 13:16 Alan Schmitt
2022-02-01 13:00 Alan Schmitt
2022-01-25 12:44 Alan Schmitt
2022-01-11  8:20 Alan Schmitt
2022-01-04  7:56 Alan Schmitt
2021-12-28  8:59 Alan Schmitt
2021-12-21  9:11 Alan Schmitt
2021-12-14 11:02 Alan Schmitt
2021-11-30 10:51 Alan Schmitt
2021-11-16  8:41 Alan Schmitt
2021-11-09 10:08 Alan Schmitt
2021-11-02  8:50 Alan Schmitt
2021-10-19  8:23 Alan Schmitt
2021-09-28  6:37 Alan Schmitt
2021-09-21  9:09 Alan Schmitt
2021-09-07 13:23 Alan Schmitt
2021-08-24 13:44 Alan Schmitt
2021-08-17  6:24 Alan Schmitt
2021-08-10 16:47 Alan Schmitt
2021-07-27  8:54 Alan Schmitt
2021-07-20 12:58 Alan Schmitt
2021-07-06 12:33 Alan Schmitt
2021-06-29 12:24 Alan Schmitt
2021-06-22  9:04 Alan Schmitt
2021-06-01  9:23 Alan Schmitt
2021-05-25  7:30 Alan Schmitt
2021-05-11 14:47 Alan Schmitt
2021-05-04  8:57 Alan Schmitt
2021-04-27 14:26 Alan Schmitt
2021-04-20  9:07 Alan Schmitt
2021-04-06  9:42 Alan Schmitt
2021-03-30 14:55 Alan Schmitt
2021-03-23  9:05 Alan Schmitt
2021-03-16 10:31 Alan Schmitt
2021-03-09 10:58 Alan Schmitt
2021-02-23  9:51 Alan Schmitt
2021-02-16 13:53 Alan Schmitt
2021-02-02 13:56 Alan Schmitt
2021-01-26 13:25 Alan Schmitt
2021-01-19 14:28 Alan Schmitt
2021-01-12  9:47 Alan Schmitt
2021-01-05 11:22 Alan Schmitt
2020-12-29  9:59 Alan Schmitt
2020-12-22  8:48 Alan Schmitt
2020-12-15  9:51 Alan Schmitt
2020-12-01  8:54 Alan Schmitt
2020-11-03 15:15 Alan Schmitt
2020-10-27  8:43 Alan Schmitt
2020-10-20  8:15 Alan Schmitt
2020-10-06  7:22 Alan Schmitt
2020-09-29  7:02 Alan Schmitt
2020-09-22  7:27 Alan Schmitt
2020-09-08 13:11 Alan Schmitt
2020-09-01  7:55 Alan Schmitt
2020-08-18  7:25 Alan Schmitt
2020-07-28 16:57 Alan Schmitt
2020-07-21 14:42 Alan Schmitt
2020-07-14  9:54 Alan Schmitt
2020-07-07 10:04 Alan Schmitt
2020-06-30  7:00 Alan Schmitt
2020-06-16  8:36 Alan Schmitt
2020-06-09  8:28 Alan Schmitt
2020-05-19  9:52 Alan Schmitt
2020-05-12  7:45 Alan Schmitt
2020-05-05  7:45 Alan Schmitt
2020-04-28 12:44 Alan Schmitt
2020-04-21  8:58 Alan Schmitt
2020-04-14  7:28 Alan Schmitt
2020-04-07  7:51 Alan Schmitt
2020-03-31  9:54 Alan Schmitt
2020-03-24  9:31 Alan Schmitt
2020-03-17 11:04 Alan Schmitt
2020-03-10 14:28 Alan Schmitt
2020-03-03  8:00 Alan Schmitt
2020-02-25  8:51 Alan Schmitt
2020-02-18  8:18 Alan Schmitt
2020-02-04  8:47 Alan Schmitt
2020-01-28 10:53 Alan Schmitt
2020-01-21 14:08 Alan Schmitt
2020-01-14 14:16 Alan Schmitt
2020-01-07 13:43 Alan Schmitt
2019-12-31  9:18 Alan Schmitt
2019-12-17  8:52 Alan Schmitt
2019-12-10  8:21 Alan Schmitt
2019-12-03 15:42 Alan Schmitt
2019-11-26  8:33 Alan Schmitt
2019-11-12 13:21 Alan Schmitt
2019-11-05  6:55 Alan Schmitt
2019-10-15  7:28 Alan Schmitt
2019-09-03  7:35 Alan Schmitt

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=m2bk3pceek.fsf@mac-03220211.irisa.fr \
    --to=alan.schmitt@polytechnique.org \
    --cc=caml-list@inria.fr \
    --cc=lwn@lwn.net \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox