Subject: Attn: Development Editor, Latest Caml Weekly News Newsgroups: gmane.comp.lang.ocaml.weekly-news Date: Tuesday 28th February 2012 15:17:05 UTC (over 4 years ago) Hello, Here is the latest Caml Weekly News, for the week of February 21 to 28, 2012. 1) TypeRex release 1.0.0 candidate 1 2) Ocamlnet-3.5 3) findlib-1.2.8 4) post-doc position available at MSR-INRIA joint lab 5) llpp v11 6) Other Caml News ======================================================================== 1) TypeRex release 1.0.0 candidate 1 Archive: <https://sympa-roc.inria.fr/wws/arc/caml-list/2012-02/msg00168.html> ------------------------------------------------------------------------ ** Tiphaine Turpin announced: We are pleased to announce the first release candidate of TypeRex, a new OCaml development environment, developed by OCamlPro and Inria Saclay. This version of TypeRex only integrates with Emacs and brings a collection of new features that programmers expect from a modern IDE. Next versions will target more editors. Downloads, screenshots, documentation, support and feedback instructions are available on TypeRex website at: <http://www.typerex.org/> Summary of TypeRex features: * Improved syntax coloring * Auto-completion of identifiers (experimental) * Browsing of identifiers: show type and comment, go to definition, cycle between alternate definitions, and semantic grep; * Strictly semantic-preserving, local and whole-program refactoring: o renaming identifiers and compilation units o open elimination and reference simplification * Robust /w.r.t./ not-recompiled, possibly unsaved buffers * Scalable (used regularly on a few hundreds of source files) Auto-completion is disabled by default, since more testing is still needed for this feature. TypeRex is written in OCaml, communicating through a socket with the OCaml mode of the editor (currently Tuareg for Emacs, OCAIDE for Eclipse soon). All the features of the Tuareg mode are also included, even when we provide an equivalent for them. ======================================================================== 2) Ocamlnet-3.5 Archive: <https://sympa-roc.inria.fr/wws/arc/caml-list/2012-02/msg00176.html> ------------------------------------------------------------------------ ** Gerd Stolpmann announced: it is time for another version of Ocamlnet. The new release 3.5 focuses on the system interface, and includes a long list of smaller improvements. The system interface, Netsys_posix, is extended by: - Support for POSIX clocks and POSIX timers (with nanosecond resolution) - Netsys_posix.spawn usses now the posix_spawn call if present on the OS - Adding support for pollable events (as e.g. provided by Linux via eventfd). For other OS an emulation is available. - Support for epoll on Linux Note that Netsys_posix covers now large parts of POSIX realtime. Other improvements: - The code generator for XDR has been improved. A new switch -direct for ocamlrpcgen can be used to generate direct mappings between OCaml values and binary representation (in many cases). Speedups up to 50% are possible for large XDR values. - The new module Uq_mt allows it to access an event-driven resource from several kernel threads (e.g. use an RPC client commonly from several threads). - The thread-safety of Netplex container functions has been improved. - Netmulticore condition variables can now be polled, for better integration into event-based programs. - Option greedy_accepts for Netplex to support servers that accept many connections per second. With this improvement, Netplex can now accept more than 5000 connections/s, and assign them to worker processes. Last but not least there is now a new tutorial for Equeue (event systems and engines). In particular, the section about combining Ocamlnet with Lwt might be interesting. For the full list of changes (especially bug fixes), see: <https://godirepo.camlcity.org/svn/lib-ocamlnet2/trunk/code/ChangeLog> The download, manual, and other resources: <http://projects.camlcity.org/projects/ocamlnet.html> GODI has been updated. ======================================================================== 3) findlib-1.2.8 Archive: <https://sympa-roc.inria.fr/wws/arc/caml-list/2012-02/msg00187.html> ------------------------------------------------------------------------ ** Gerd Stolpmann announced: Findlib-1.2.8, a patch release, is out. It includes a fix for Win32, and support for "ocamlfind ocamlmklib", mostly for completeness. <http://projects.camlcity.org/projects/findlib.html> ======================================================================== 4) post-doc position available at MSR-INRIA joint lab Archive: <https://sympa-roc.inria.fr/wws/arc/caml-list/2012-02/msg00194.html> ------------------------------------------------------------------------ ** Damien Doligez announced: Research team: Tools for Proofs, MSR-INRIA Joint Centre ======================================================= The Microsoft Research-INRIA Joint Centre is offering a 2-year position for a post-doctoral researcher to contribute to a proof development environment for TLA+ developed in the Tools for Proofs project (see <http://www.msr-inria.inria.fr>). Research Context ================ TLA+ is a language for specifying and reasoning about systems, including concurrent and distributed systems. It is based on first-order logic, set theory, temporal logic, and a module system. TLA+ and its tools have been used in industry for over a decade. More recently, we have extended TLA+ to include hierarchically structured formal proofs that are independent of any proof checker. We have released several versions of the TLAPS proof checker (<http://msr-inria.inria.fr/~doligez/tlaps/>) and integrated it into the TLA+ Toolbox, an IDE for the TLA+ tools (<http://research.microsoft.com/en-us/um/people/lamport/tla/toolbox.html>). TLAPS and the Toolbox support the top-down development of proofs and the checking of individual proof steps independently of the rest of the proof. This helps users focus on the part of the proof they are working on. Although still lacking important features, TLAPS is already a powerful tool and has been used for a few verification projects, including a proof of the safety properties of a Byzantine-fault tolerant consensus algorithm (<http://research.microsoft.com/en-us/um/people/lamport/tla/byzpaxos.html>). TLAPS consists of the Proof Manager (PM, an interpreter for the proof language that computes the proof obligations corresponding to each proof step) and an extensible list of backend provers. Current backends include the tableau prover Zenon, an encoding of TLA+ as an object logic in the Isabelle proof assistant, and a generic backend for SMT solvers. When possible, we expect backend provers to produce a detailed proof that is then checked by Isabelle. In this way, we can obtain high assurance of correctness as well as satisfactory automation. The current version of the PM handles only the "action" part of TLA+: first-order formulas with primed and unprimed variables, where a variable v is considered to be unrelated to its primed version v'. This allows us to translate non-temporal proof obligations to standard first-order logic, without the overhead associated with an encoding of temporal logic into first-order logic. Description of the activity of the post-doc =========================================== You will work with other members of the project, including Leslie Lamport, Damien Doligez, and Stephan Merz, on the extension of the TLA+ proof language to temporal operators. This extension poses interesting conceptual and practical problems. In particular, the new translation must smoothly extend the existing one since temporal proof steps rely on action-level subproofs. You will have the primary responsibility for designing and implementing algorithms to generate corresponding proof obligations. As time permits and depending on your interests, you will have the opportunity to contribute to further improving the proof checker. This may include: - adding support for certain TLA+ features that are not yet handled by the PM, such as recursive operator definitions and elaborate patterns for variable bindings; - finding what improvements are needed by verifying real examples, perhaps including liveness of the aforementioned consensus algorithm; - integrating new backends to improve the automation of proofs; - adding validation of proofs by backends whose proofs are not now checked. Skills and profile of the candidate =================================== You should have a solid knowledge of logic and set theory as well as good implementation skills related to symbolic theorem proving. Of particular relevance are parsing and compilation techniques. Our tools are mainly implemented in OCaml. Experience with temporal and modal logics, Isabelle, Java or Eclipse would be a plus. Given the geographical distribution of the members of the team, we highly value a good balance between the ability to work in a team and the capacity to propose initiatives. Location ======== The Microsoft Research-INRIA Joint Centre is located on the Campus of INRIA Saclay south of Paris, near the Le Guichet RER station. Starting date ============= The normal starting date of the contract would be September 2012, but we can arrange for an extremely well-qualified candidate to start sooner. Contact ======= Candidates should send a resume and the name and e-mail addresses of one or two references to Damien Doligez |
|||