http://blog.gmane.org/gmane.comp.lang.caml.inria hourly 1 1901-01-01T00:00+00:00 http://gmane.org/img/gmane-25t.png http://gmane.org http://comments.gmane.org/gmane.comp.lang.caml.inria/57533 <pre>Hello, For those reading French, ANSSI (French agency for information security) published a study on security and functional languages, with a set of recommendations. OCaml is apparently well studied: http://www.ssi.gouv.fr/fr/anssi/publications/publications-scientifiques/autres-publications/lafosec-securite-et-langages-fonctionnels.html """ Cette étude, menée par un consortium composé de Saferiver, Normation, AMOSSYS et du CEDRIC dans le cadre formel d’un marché du SGDSN, avait pour objectif principal d’étudier l’adéquation des langages fonctionnels pour le développement d’applications de sécurité, de proposer le cas échéant des recommandations, et de mettre en pratique certaines de ces recommandations. """ Best regards, david </pre> David MENTRE 2013-05-24T07:02:29 http://comments.gmane.org/gmane.comp.lang.caml.inria/57532 <pre>Hi, I was astouned to find the term "variables" in the Reference Manual for OCaml 4.00. Found that on page 136 in the sentence with "(...) statically constructive (...)". Did not checked, if this is on other pages also. To tired to check it, and to tired/lazy for a bugreport now... ...but thought it might be something that might better be corrected. Ciao, Oliver </pre> oliver 2013-05-23T23:53:55 http://comments.gmane.org/gmane.comp.lang.caml.inria/57524 <pre>*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 2nd INTERNATIONAL CONFERENCE ON THE THEORY AND PRACTICE OF NATURAL COMPUTING TPNC 2013 Cáceres, Spain December 3-5, 2013 Organized by: Computer Architecture and Logic Design Group (ARCO) University of Extremadura Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University http://grammars.grlmc.com/tpnc2013/ ********************************************************************* AIMS: TPNC is a conference series intending to cover the wide spectrum of computational principles, models and techniques inspired by information processing in nature. TPNC 2013 will reserve significant room for young scholars at the beginning of their career. It aims at attracting contributions to nature-inspired models of computation, synthesizing nature by means of computation, nature-inspired materials, and information processing in nature. VENUE: TPNC 2013 will take place in Cáceres, in Western Spain, 300 kms. to the southwest of Madrid and 100 kms. to the Portuguese border. The old city is a UNESCO World Heritage site. SCOPE: Topics of either theoretical, experimental, or applied interest include, but are not limited to: * Nature-inspired models of computation: - amorphous computing - cellular automata - chaos and dynamical systems based computing - evolutionary computing - membrane computing - neural computing - optical computing - swarm intelligence * Synthesizing nature by means of computation: - artificial chemistry - artificial immune systems - artificial life * Nature-inspired materials: - computing with DNA - nanocomputing - physarum computing - quantum computing and quantum information - reaction-diffusion computing * Information processing in nature: - developmental systems - fractal geometry - gene assembly in unicellular organisms - rough/fuzzy computing in nature - synthetic biology - systems biology * Applications of natural computing to: algorithms, bioinformatics, control, cryptography, design, economics, graphics, hardware, learning, logistics, optimization, pattern recognition, programming, robotics, telecommunications etc. A flexible "theory to/from practice" approach would be the perfect focus for the expected contributions. STRUCTURE: TPNC 2013 will consist of: ‐ invited talks ‐ invited tutorials ‐ peer-reviewed contributions INVITED SPEAKERS: Risto Miikkulainen (Austin), Evolving Neural Networks (tutorial) Yew-Soon Ong (Singapore), Advances in Memetic Computation Xin Yao (Birmingham), Evolutionary Algorithm Portfolios for Numerical Optimisation PROGRAMME COMMITTEE: Selim G. Akl (Kingston, CA) Thomas Bäck (Leiden, NL) Peter J. Bentley (London, UK) Hans-Georg Beyer (Dornbirn, AT) Mauro Birattari (Brussels, BE) Jinde Cao (Nanjing, CN) Vladimir Cherkassky (Minneapolis, US) Sung-Bae Cho (Seoul, KR) John A. Clark (York, UK) Carlos A. Coello Coello (Mexico DF, MX) David W. Corne (Edinburgh, UK) Peter Dayan (London, UK) Bernard De Baets (Ghent, BE) Andries P. Engelbrecht (Pretoria, ZA) Enrique Herrera-Viedma (Granada, ES) Yaochu Jin (Guildford, UK) Nikola Kasabov (Auckland, NZ) Vladik Kreinovich (El Paso, US) Kwong-Sak Leung (Hong Kong, CN) Xiaohui Liu (London, UK) Manuel Lozano (Granada, ES) Carlos Martín-Vide (Tarragona, ES, chair) Julian F. Miller (York, UK) Frank Neumann (Adelaide, AU) Leandro Nunes de Castro (São Paulo, BR) Nikhil R. Pal (Kolkata, IN) Günther Palm (Ulm, DE) José Carlos Príncipe (Gainesville, US) Helge Ritter (Bielefeld, DE) Conor Ryan (Limerick, IE) Hava Siegelmann (Amherst, US) Moshe Sipper (Beer-Sheva, IL) Thomas Stützle (Brussels, BE) Ponnuthurai N. Suganthan (Singapore, SG) Johan Suykens (Leuven, BE) Kay Chen Tan (Singapore, SG) Dacheng Tao (Sydney, AU) Jon Timmis (York, UK) Marco Tomassini (Lausanne, CH) Michael D. Vose (Knoxville, US) Michael N. Vrahatis (Patras, GR) Harald Weinfurter (Munich, DE) Jun Zhang (Guangzhou, CN) ORGANIZING COMMITTEE: Adrian Horia Dediu (Tarragona) Carlos Martín-Vide (Tarragona, co-chair) Bianca Truthe (Magdeburg) Miguel A. Vega-Rodríguez (Cáceres, co-chair) Florentina Lilica Voicu (Tarragona) LOCAL COMMITTEE: Víctor Berrocal-Plaza José M. Chaves-González Juan A. Gómez-Pulido David L. González-Álvarez José M. Granado-Criado Alejandro Hidalgo-Paniagua José M. Lanza-Gutiérrez Álvaro Rubio-Largo Sergio Santander-Jiménez Miguel A. Vega-Rodríguez (chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (including eventual appendices) and should be formatted according to the standards of the Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). Submissions have to be uploaded to: https://www.easychair.org/conferences/?conf=tpnc2013 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of the journal Soft Computing (Springer, 2011 impact factor: 1.880) will be later published containing peer-reviewed extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The period for registration is open from April 17 to December 3, 2013. The registration form can be found at: http://grammars.grlmc.com/tpnc2013/Registration DEADLINES: Paper submission: July 16, 2013 (23:59h, CET) Notification of paper acceptance or rejection: August 27, 2013 Final version of the paper for the LNCS proceedings: September 3, 2013 Early registration: September 10, 2013 Late registration: November 19, 2013 Starting of the conference: December 3, 2013 End of the conference: December 5, 2013 Submission to the post-conference special issue: March 5, 2014 QUESTIONS AND FURTHER INFORMATION: florentinalilica.voicu&lt; at &gt;urv.cat POSTAL ADDRESS: TPNC 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Departament d’Economia i Coneixement, Generalitat de Catalunya Universidad de Extremadura Universitat Rovira i Virgili </pre> GRLMC - URV 2013-05-23T19:55:46 http://comments.gmane.org/gmane.comp.lang.caml.inria/57511 <pre> CICLOPS 2013 - Call for Papers ============================== 13th International Colloquium on Implementation of Constraint and LOgic Programming Systems http://akira.ruc.dk/~cth/ciclops13 Istanbul, Turkey, August 24/25, 2013 Co-located with ICLP 2013 Important Dates =============== Abstract Submission: June 1, 2013 Paper Submission: June 8, 2013 Notification: July 1, 2013 Camera-ready: July 13, 2013 Workshop: August 24/25, 2013 Topics of Interest ================== CICLOPS is a well established line of workshops. This will be the 13th edition in a successful series of workshops which is traditionally co-located with ICLP. The CICLOPS workshop aims at discussing and exchanging experience on the design, implementation, and optimization of constraint and logic programming systems, and other systems based on logic as a means of expressing computations. Preference will be given to the description and analysis of real implementations and their evaluation, problems found in their design, steps taken towards the solutions, as well as descriptions of work in progress in that direction. The workshop topics include, but are not limited to: * Design and implementation of sequential, concurrent and distributed constraint and logic programming systems. * Compile-time analysis and balance between compile-time effort and run-time machinery, dynamic compilation. * Interaction between high-level optimizations / transformations / specialization and low-level issues. * Memory management, garbage collection, indexing techniques and optimizations for large size programs. * Implementation of logic engines in functional and object oriented languages. * Embedding of constraint and logic programming engines in multi-paradigm systems. * Implementation techniques for alternative logic engines and inference mechanisms (ASP, SAT, QSAT, DL etc.). * Implementation of theorem provers, proof assistants and logic based natural language processing systems. * Object and module systems. * Design and implementation of declarative I/O concepts for constraint and logic programming languages. * Documenting, debugging, testing, and profiling tools for constraint and logic programming systems. Submission Information ====================== Authors are invited to submit papers in PDF using the Springer LNCS LaTeX format. Submissions must be written in English, not exceed 15 pages, and describe new, original and unpublished research results or work in progress. Submissions will be handled by the EasyChair conference system at: https://www.easychair.org/conferences/?conf=ciclops2013 We plan for the informal workshop proceedings to be available on-line at the Computing Research Repository (CoRR) after the workshop. An electronic copy will also be distributed during the conference. Program Committee ================= * Ricardo Rocha, University of Porto, Portugal (co-chair) * Christian Theil Have, Roskilde University, Denmark (co-chair) * Bart Demoen, Department of Computer Science, KU Leuven, Belgium * Daniel Diaz, University of Paris 1 * Enrico Pontelli, New Mexico State University, USA * Jan Wielemaker, VU University Amsterdam, Netherlands * Jose F. Morales, IMDEA, Spain * Michael Hanus, Christian-Albrechts-Universität zu Kiel, Germany * Neng-Fa Zhou, Brooklyn College, USA * Nicos Angelopoulos, Netherlands Cancer Institute, The Netherlands * Paulo Moura, INESC/CRACS, Portugal * Peter Szeredi, Budapest University of Technology and Economics,Hungary * Salvador Abreu, Universidade de Évora and CENTRIA, Portugal * Terrance Swift, New University of Lisboa, Portugal * Tom Schrijvers, Ghent University, Belgium Contacts ======== For additional information about papers and submissions, please contact the Program Chairs: * Ricardo Rocha University of Porto, Portugal Email: ricroc&lt; at &gt;dcc.fc.up.pt * Christian Theil Have Roskilde University, Denmark Email: cth&lt; at &gt;ruc.dk =================================== </pre> Ricardo Rocha 2013-05-22T14:07:33 http://comments.gmane.org/gmane.comp.lang.caml.inria/57507 <pre>Hello, I did publish one of my tools as GPLv3. It is written in OCaml. Now I saw at another project, that there is the need for an "OCaml exception" regarding linking. If thats true I may have missed a crucial points when thinking about the license for tools written in OCaml. I'm not a lwayer, and all that licenses stuff is rather+ annoying and confusing to me. That OCaml code needs special treatment here, even OCaml is shipped even with Debian, who surely would not accept GPL-violating stuff, is annoying. So, some questions came up now: - Which licenses can be used together with OCaml without changes? - Which licenses can be used together with added exceptions, and which exceptions are that? - In case of needed exceptions, where to find "ready-to-use"-versions of these licenses? - How to handle a project that already was published under a license that does not match 1:1 with OCaml licenses? It's not possible to delete any copy someone did of it already. Also it's not possible to sed all those people a message, to inform them that the license must be modified. Also I'm not sure how this could work, because the license came with the software at one time, and the correction comes later. Regarding the third point: it would be a good idea to provide "ready to use" licenses, which include the exceptions, instead of lawyer-compatible (but not necessarily programmer-compatible) explanations with many if-then-else's. Ciao, Oliver </pre> oliver 2013-05-22T12:34:27 http://comments.gmane.org/gmane.comp.lang.caml.inria/57505 <pre>Hi, While searching for [ocamlopt raspberry pi] on seeks.fr I've found this: http://www.raspberrypi.org/phpBB3/viewtopic.php?t=23565&amp;p=219670 which points to: https://godirepo.camlcity.org/pipermail/godi-list/2012-November/003537.html it says: """ If you read this, and OCaml-4.01 is already out, you probably do not need to take care of the following, because the required patch is probably already in this release """ I installed yesterday "2013-02-09-wheezy-raspbian.img" which provides ocaml 3. I've insalled ocaml libs provided by apt-get, included -dev libs. I'm not sure to understand. What can we do with it without ocamlopt? What is the prefered way to get ocamlopt working on RPi today? Opam compiles fine with ocaml 3. After closing all the other applications opam init can finish without running out of memory. So I thought to try to: opam switch 4.00.1 [...] + ./boot/ocamlrun boot/myocamlbuild byte_stdlib_mixed_mode ocamlc lex/ocamllex camlp4/Camlp4/Camlp4Ast.partial.ml camlp4/boot/camlp4boot.byte camlp4/Camlp4.cmo camlp4/Camlp4Top.cmo camlp4/camlp4prof.byte camlp4/mkcamlp4.byte camlp4/camlp4.byte camlp4/camlp4fulllib.cma camlp4/camlp4boot.byte camlp4/camlp4boot.cma camlp4/camlp4r.byte camlp4/camlp4r.cma camlp4/camlp4rf.byte camlp4/camlp4rf.cma camlp4/camlp4o.byte camlp4/camlp4o.cma camlp4/camlp4of.byte camlp4/camlp4of.cma camlp4/camlp4oof.byte camlp4/camlp4oof.cma camlp4/camlp4orf.byte camlp4/camlp4orf.cma camlp4/Camlp4Parsers/Camlp4AstLoader.cmo camlp4/Camlp4Parsers/Camlp4DebugParser.cmo camlp4/Camlp4Parsers/Camlp4GrammarParser.cmo camlp4/Camlp4Parsers/Camlp4ListComprehension.cmo camlp4/Camlp4Parsers/Camlp4MacroParser.cmo camlp4/Camlp4Parsers/Camlp4OCamlOriginalQuotationExpander.cmo camlp4/Camlp4Parsers/Camlp4OCamlParser.cmo camlp4/Camlp4Parsers/Camlp4OCamlParserParser.cmo camlp4/Camlp4Parsers/Camlp4OCamlReloadedParser.cmo camlp4/Camlp4Parsers/Camlp4OCamlRevisedParser.cmo [...] camlp4/Camlp4Filters/Camlp4MetaGenerator.cmo camlp4/Camlp4Filters/Camlp4Profiler.cmo camlp4/Camlp4Filters/Camlp4TrashRemover.cmo make[1]: *** [odoc_config.cmx] Segmentation fault make: *** [ocamldoc.opt] Error 2 Without ocamlopt it's not possible to install most things from Opam... Is there a wiki for ocaml on RPi ? </pre> Florent Monnier 2013-05-22T11:30:31 http://comments.gmane.org/gmane.comp.lang.caml.inria/57504 <pre>===================================================== ACM SIGPLAN International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP'13) http://complogic.cs.mcgill.ca/lfmtp13 23 September, 2013 Boston, USA Co-located with with ICFP'13 CALL FOR PAPERS ===================================================== IMPORTANT DATES Paper submission: June 14, 2013 Author notification: July 7, 2013 Final versions due: July 18, 2013 ===================================================== Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design and implementation on the one hand and their use in reasoning tasks ranging from the correctness of software to the properties of formal computational systems on the other hand have been the focus of considerable research over the last two decades. This workshop will bring together designers, implementors, and practitioners to discuss various aspects impinging on the structure and utility of logical framework. The broad subject areas of LFMTP'13 are: * Encoding and reasoning about the meta-theory of programming languages and related formally specified systems. * Theoretical and practical issues concerning the treatment of variable binding. * Logical treatments of inductive and co-inductive definitions and associated reasoning techniques. * New theory contributions: canonical frameworks, contextual frameworks, functional programming over logical frameworks. This year's invited speaker are Dale Miller (Inria) and Robert Harper (CMU) . In addition, this year LFMTP will celebrate the twenty years anniversary of the publication of: Robert Harper, Furio Honsell and Gordon Plotkin. A Framework For Defining Logics. Journal of the Association for Computing Machinery, 40(1):143-184, 1993 Program Committee: ================= * David Baelde, ENS * James Cheney, Edinburgh * Adam Chlipala, MIT * Dan Licata, CMU/IAS * Alberto Momigliano, Milano (organizer) * Brigitte Pientka, McGill (organizer) * Nicolas Pouillard ITU * Randy Pollack, Harvard (organizer) * Andrei Popescu, TUM * Florian Rabe, Bremen * Stephanie Weirich, UPenn Submission Details: ============ In addition to regular papers, we also solicit "work in progress" report, in a broad sense. Those do not need to report original or fully polished research results, but should be interesting for the community at large. Submitted papers should be in PDF, formatted using the ACM SIGPLAN style guidelines (9pt format, more details appear on the symposium web page). The length is restricted to 12 pages, except for "Work in Progress" papers, which are restricted to 6 pages. Submission is via EasyChair: https://www.easychair.org/conferences/?conf=lfmtp2013 Proceedings: ============ Accepted (regular) papers will be included in the ACM Digital Library. Authors are encouraged to publish auxiliary material with their paper (technical appendixes, source code, scripts, test data, etc.). Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page (http://www.sigplan.org/PAC.htm). </pre> Brigitte Pientka 2013-05-22T03:06:39 http://comments.gmane.org/gmane.comp.lang.caml.inria/57492 <pre>Hi, As you know, there is in OCaml some asymmetry regarding the rec/nonrec defaults for type and value declarations.  Types are recursive by default and there's no way to "unrecurse" them, whereas values are by default not recursive and can be made recursive via the "rec" keyword. The unrecursiveness of type declarations is cause for some chagrin, as a recent ticket on Mantis demonstrates [1]. Here's something I wonder: if one were to wipe the slate clean, is there consensus among the community about the best defaults?  I'm leaning towards having nonrec as the default behaviour for *both* types and values, and using "rec" as the keyword for recursive types and values.  This scheme would obviate the need for an actual "nonrec" keyword. Obviously, such a change would be too intrusive to make to OCaml.  However, since people are working on "Next Generation ML" languages like Mezzo [2], I think it would be good to get the community's pulse on this subject. (Btw, from the examples posted on Mezzo's homepage, it seems to use the same defaults as OCaml). Your thoughts? Best regards, Dario Teixeira [1] http://caml.inria.fr/mantis/view.php?id=6016 [2] http://gallium.inria.fr/~protzenk/mezzo-lang/ </pre> Dario Teixeira 2013-05-20T14:31:30 http://comments.gmane.org/gmane.comp.lang.caml.inria/57489 <pre>I am pleased to announce the 109.23.00 release of the Core suite. The following packages were upgraded: - async_parallel - core - core_extended - jenga async_parallel is a new library. It is for running tasks in other processes on a cluster of machines. A detailed description is included in the API documentation: https://ocaml.janestreet.com/ocaml-core/109.23.00/doc/parallel/Std.html Files and documentation for this release are available on our website and all packages are in opam: https://ocaml.janestreet.com/ocaml-core/109.14.00/individual/ https://ocaml.janestreet.com/ocaml-core/109.14.00/doc/ Here are the changelogs for versions 109.15.00 to 109.23.00: # 109.15.00 ## async_extra - In `Rpc.client` and `Rpc.with_client`, allowed the client to implement the rpcs. Added a new optional argument: `?implementations:_ Client_implementations.t`. - Added new module `Versioned_rpc.Both_convert` to allow the caller and callee to independently upgrade to a new rpc. This is a new flavor of `Versioned_rpc` in which both sides do some type coercions. ## async_unix - The `epoll`-based scheduler now supports sub-millisecond timeouts, using `Linux_ext.Timerfd`. Async still uses the `select`-based scheduler by default. We plan to switch the default to `epoll` in a few weeks, once we have done more testing. - Eliminated module `Work_group`, which was for limiting the number of threads used by jobs. This was a little-used module that significantly complicated the implementation of the Async thread pool. One should consider using a `Throttle` instead. Along the way, fixed a bug in Async helper threads in which the finalizer could fire too early, causing an unhandled exception. The fix involves relaxing the requirements on when `Thread_pool.finished_with_helper_thread` functions can be called, allowing it to be called while the helper thread still has work, but so long as no future work will be added. ## core - Changed the tolerance of `Time.Robustly_compare` functions from `1E-7` to `1E-6`. - Fixed the names of some toplevel pretty-printers, which referred to nonexistent modules. Fix some of the `pp`'s for Core which are used to install printers in the top-level. Some of the toplevel printers refer to non-existent modules like `Core.Nativeint.pp`; this feature changed to the correct name, like `Core.Std.Nativeint.pp`. - Added to module `Unix` functionality for getting and setting flags in the open-file-descriptor table. ```ocaml module Open_flags : sig type t include Flags.S with type t :` t ... end val fcntl_getfl : File_descr.t -&gt; Open_flags.t val fcntl_setfl : File_descr.t -&gt; Open_flags.t -&gt; unit ``` - Added module `Linux_ext.Timerfd`. This allows one to create a file descriptor that can be monitored by `epoll` or `select` and notify them at a certain time. It makes it possible to use `epoll` with sub-millisecond timeouts. - Added `Version_util.application_specific_fields`, which allows custom build-time information to be included in an executable. ## zero This is a new library with general data structures like `Core` but that emphasizes performance over usability. - Added module `Pool`. This is an implementation of a heap-block allocator that provides the API of a set of tuples. The point is to allocate a single long-lived block of memory (the pool) that lives in the OCaml major heap, and then to reuse the block, rather than continually allocating blocks on the minor heap, and then promoting them to the major heap. # 109.17.00 ## async_extra - Added an option to `Async.Log.Rotation` to include the date in logfile names. This is mostly for archiving purposes. - Made `Versioned_rpc.Callee_converts.Pipe_rpc.implement_multi` agree with `Rpc.Pipe_rpc.implement` on the type of pipe rpc implementations. - Improved the performance of `Versioned_typed_tcp`. Avoided creating deferreds while reading the incoming messages. ## core - Fixed `Random.self_init`, which was broken since 109.00.00 with the upgrade to OCaml 4.0 The fix changed the type signature expressed in `core_random.ml` of the standard OCaml `caml_sys_random_seed` C function from `unit -&gt; int` from `unit -&gt; int array`. That C function changed between OCaml 3.12 and 4.0. - Moved module `Core_extended.Unix.Cidr` into `Core.Unix`. - Wrapped `Unix.wordexp` into an `Or_error.t` to handle systems that does not implement it in the libc. - Fixed two other printer names - Added `Array.int_blit` and `Array.float_blit`, which are specialized fast blits for `int array` and `float array`. For motivation underlying this change and other design alternatives please see Section 3 "Fast, Slow and Incorrect Array blits" of http://janestreet.github.com/ocaml-perf-notes.html - Added `Unpack_buffer.Unpack_one.sexp` for parsing sexps using the `Unpack_buffer` interface. ## zero - Fixed `Obj_array.blit` to safely handle overlapping blits. # 109.18.00 ## async_unix - added `Async.Unix.fcntl_{get,set}fl`. Made `Reader` and `Writer` detect if they are passed a file descriptor with incorrect permissions (`O_WRONLY` for `Reader`, `O_RDONLY` for `Writer`). ## core - changed implementation of `Array.sort` to use introsort. See http://en.wikipedia.org/wiki/Introsort. - tweaked a unit test in `Core.Flags` to not print a message to stderr. ## pa_ounit - a number of improvements to `inline_tests_runner`, including a `-verbose` flag. 1. Made pa_ounit errors more readable. 2. Added `-verbose` flag. 3. Made the `-only-test` locations compatible with those displayed by the `-verbose` flag. 4. Renamed `-display` as `-show-counts` to avoid confusion with `-verbose`. 5. Improved errors when parsing the command line. 6. Updated the readme. 7. Added a `-list-test-names` which shows what tests would be run, if this option was not given. # 109.19.00 ## async_extra - Added function `Versioned_typed_tcp.Client.flushed : t -&gt; [ `Flushed | `Pending of Time.t Deferred.t ]`. This exposes whether the underlying `Writer.t` has been flushed. ## async_unix - Reworked a number of `Reader` functions to improve performance by avoiding deferreds. This is a followup to the `Reader` improvements in 109.14, and eliminates some last vestiges of performance degradation that had been introduced in 109.04. - Added function `Reader.lseek : t -&gt; int64 -&gt; mode:[&lt; `Set | `End] -&gt; int64 Deferred.t`. `lseek t offset ~mode` clears `t`'s buffer and calls `Unix.lseek` on `t`'s file descriptor. - Added function `Writer.bytes_received : t -&gt; int`. - Added function `Unix.mkfifo : ?perm:file_perm -&gt; string -&gt; unit Deferred.t`, which was mistakenly missing. This is a simple wrapper around `Core.Unix.mkfifo`. ## core - Changed `Time.to_string` and `Time.sexp_of_t` to include the timezone. This is an incompatible change with very old programs in which `Time.of_string` and `Time.t_of_sexp` did not support the timezone. If you have programs that are: * very old and do Time string/sexp handling * rely on reading in time values without using `Time.of_string` and `Time.t_of_sexp`. * rely on chains of writing/reading/writing times across machines and timezones where the time is always intended to be taken as the local time on the currently reading machine you should recompile/review your code to make sure you won't have issues. - Added function `List.remove_consecutive_duplicates : 'a t -&gt; equal:('a -&gt; 'a -&gt; bool) -&gt; 'a t`. This returns the input list with consecutive duplicates removed, and doesn't change the order of the remaining elements. - Added module `User_and_group`, which is a pair of a unix username and primary unix group. The string/sexp converters follow the usual unix convention of `&lt;user&gt;:&lt;group&gt;`. - Added function `Date.first_strictly_after : t -&gt; on:Weekday.t -&gt; t`. `first_strictly_after t ~on:day_of_week` returns the first occurrence of `day_of_week` strictly after `t`. - Added functor `Type_equal.Lift`. It is always safe to conclude that if type `a` equals `b`, then type `a X.t` equals `b X.t`, for any type `X.t`. The OCaml type checker uses this fact when it can. However, sometimes, e.g. when using `Type_equal.conv`, one needs to explicitly use this fact to construct an appropriate `Type_equal.t`. The `Type_equal.Lift*` functors do this. ```ocaml module Type_equal : sig type ('a, 'b) t ... module Lift (X : T1) : sig val lift : ('a, 'b) t -&gt; ('a X.t, 'b X.t) t end end ``` ## fieldslib - Made `with fields` generate the same functions in the `Fields` and `Fields_of_*` modules whether the type is called `t` or not. ## zero - Removed a performance test from `Pool` that was nondeterministically failing. # 109.20.00 ## async_core - Added the ability for a `Throttle` to have resources that are exclusively available to running jobs. ## async_unix - Set `close-on-exec` for both ends of the pipe used to wake up the scheduler. ## core - Wrapped `Unix.wordexp` in an `Or_error.t` since it is not available on all systems. - Added function `Process_env.parse_ssh_client`. This gets the address from which you're currently ssh'd in. - Added to `Unix` module the ability to get and set `IP_MULTICAST_LOOP` and `IP_MULTICAST_TTL`. - Exposed module `Core.Std.Ref`, which was previously only available via `Core.Ref`. - Remove `Mutex.am_holding_mutex` and changed the type of `Mutex.try_lock`. With NPTL it is impossible to determine which thread is holding the lock. So, `Mutex.am_holding_mutex` is unimplementable. Also, `Mutex.try_lock` was incorrect because it claimed to raise if one was attempting to recursively lock. Since it's not possible to distinguish between recursive locking and the lock being held by another thread, we changed the type to make this clear: ```ocaml val try_lock : t -&gt; [ `Already_held_by_me_or_other | `Acquired ] ``` - Removed our custom version of the OCaml runtime's `core_sys_open` function. There used to be a bug in the OCaml runtime, PR#5069, in which `open_{in,out}_gen` could block while holding the OCaml lock, because they made a call to `fcntl` outside the blocking section. We had our own C code with the bug fix and re-exposed the fixed versions of the functions in `Core`. The bug in OCaml has been fixed, so we have removed our patched function from `Core`. - In `unix_stubs.c`, switched from using `FNM_FILE_NAME` to `FNM_PATHNAME`. The GNU project introduced FNM_FILE_NAME as a non-portable synonym for FNM_PATHNAME. We were using pre-processor macros to define FNM_FILE_NAME as FNM_PATHNAME if unavailable, but it is simpler to just use the more portable FNM_PATHNAME everywhere. ## ocaml_plugin - Removed a test that (rarely) failed nondeterministically. ## sexplib - Renamed converter generated by `with sexp` for polymorphic variants so it is hidden from the toplevel. `of_sexp` created a value named `&lt;type&gt;_of_sexp__` to handle polymorphic variants. To hide it from the toplevel, we renamed it as `__&lt;type&gt;_of_sexp__`. We kept the `__` suffix to avoid any confusion with a type named `__&lt;type&gt;`. ## type_conv - Removed some warnings caused by generated signatures. 1. In signatures on local modules. 2. When there are duplicate signature items like in this example: ```ocaml module Warnings : sig type t = private { foo : int } with fields (** used to say unused value foo *) val foo : string end = struct type t = { foo : int } with fields let foo = "a" end ``` 3. In the signatures of all the parameters of functors that take multiple parameters; this used to work only for the last parameter. ## zero - Added module `Timing_wheel`, a new priority-queue implementation specialized for sets of time-based alarms. # 109.21.00 ## async_unix - Added `Unix.remove`. ## core - Massively improved the signatures of `Map` and `Set`, both for readability and ocamldoc, as well as improved type error messages. For instance the type of `Int.Set.singleton` was: ```ocaml ('a, 'comparator, 'a Core.Std.Int.Set.elt_ -&gt; ('a, 'comparator) Core.Std.Int.Set.t_) Core.Core_set_intf.without_comparator ``` Now it is simply: ```ocaml int -&gt; Int.Set.t ``` - Added an optional argument to `Command.run` that can be used to specify default flags from a user config file. The optional argument can extend the command line based on the path to the command. - Rename module `Weekday` as `Day_of_week`. The name `Weekday` conflicted with ordinary usage of "weekday" to mean Monday through Friday. - Changed `sexp_of_t` for `{Month,Ofday,Time,Time.Span}.{Set,Map}` to use the nice sexp format of the underlying atomic type. Previously, the converter had used thes raw type (`float`, `int`, etc.). `t_of_sexp` still accepts both formats; we will remove the ability to accept the raw format in the distant future. This output-format change was planned when we originally in 108.06b improved those `t_of_sexp` functions to accept both formats. - Added `Unix.remove`. - Removed some `IFDEF`'s connected to OCaml &lt;4 support. ## zero - Added module `Flat_tuple_array` for tuples packed into an array. - Added function `Pool.length : _ t -&gt; int`, which returns the number of live tuples in a pool. # 109.23.00 ## core - Exposed `Core.Std.Flags` module. - Made the `Heap` module implement `Container.S1`. - Added module `Ref.Permissioned`, which is a ref with `read_only` / `read_write` access control. - Exposed the unique id in `Type_equal.Id`. This allows, e.g. hash tables indexed by unique ids. - Removed the use of `Obj.magic` from the implementation of `Type_equal.Id.same`. It is not needed because the `Id.t` contains a `Uid.t` and we can just use `Uid.equal`. </pre> Jeremie Dimino 2013-05-20T12:13:42 http://comments.gmane.org/gmane.comp.lang.caml.inria/57485 <pre>*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ********************************************************************* 2013 INTERNATIONAL SUMMER SCHOOL ON TRENDS IN COMPUTING SSTiC 2013 Tarragona, Spain July 22-26, 2013 Organized by Rovira i Virgili University http://grammars.grlmc.com/SSTiC2013/ ********************************************************************* +++ next registration deadline: May 26 +++ ********************************************************************* AIM: SSTiC 2013 will be an open forum for the convergence of top class well recognized computer scientists and people at the beginning of their research career (typically PhD students) as well as consolidated researchers. SSTiC 2013 will cover the whole spectrum of computer science by means of 63 six-hour courses dealing with hot topics at the frontiers of the field. By actively participating, lecturers and attendees will share the idea of scientific excellence as the main motto of their research work. ADDRESSED TO: Graduate students from around the world. There are no pre-requisites in terms of the academic degree the attendee must hold. However, since there will be several levels among the courses, in the description of some of them reference may be made to specific knowledge background. SSTiC 2013 is appropriate also for people more advanced in their career who want to keep themselves updated on developments in the field. Finally, senior researchers will find it fruitful to listen and discuss with people who are main references of the diverse branches of computing nowadays. REGIME: 7 parallel sessions will be held during the whole event. Participants will be able to freely choose the courses they will be willing to attend as well as to move from one to another. VENUE: Palau Firal i de Congressos de Tarragona Arquitecte Rovira, 2 43001 Tarragona http://www.palaucongrestgna.com COURSES AND PROFESSORS: Divyakant Agrawal (Santa Barbara) [intermediate] Scalable Data Management in Enterprise and Cloud Computing Infrastructures Shun-ichi Amari (Riken) [introductory] Information Geometry and Its Applications James Anderson (Chapel Hill) [intermediate] Scheduling and Synchronization in Real-Time Multicore Systems Pierre Baldi (Irvine) [intermediate] Big Data Informatics Challenges and Opportunities in the Life Sciences Yoshua Bengio (Montréal) [introductory/intermediate] Deep Learning of Representations Stephen Brewster (Glasgow) [advanced] Multimodal Human-Computer Interaction Bruno Buchberger (Linz) [introductory] Groebner Bases: An Algorithmic Method for Multivariate Polynomial Systems. Foundations and Applications Rajkumar Buyya (Melbourne) [intermediate] Cloud Computing Jan Camenisch (IBM Zurich) [intermediate] Cryptography for Privacy Jeffrey S. Chase (Duke) [intermediate] Trust Logic as an Enabler for Secure Federated Systems Larry S. Davis (College Park) [intermediate] Video Analysis of Human Activities Paul De Bra (Eindhoven) [intermediate] Adaptive Systems Marco Dorigo (Brussels) [introductory] An Introduction to Swarm Intelligence and Swarm Robotics Paul Dourish (Irvine) [introductory] Ubiquitous Computing in a Social Context Max J. Egenhofer (Maine) [introductory/intermediate] Qualitative Spatial Relations: Formalizations and Inferences Richard M. Fujimoto (Georgia Tech) [introductory] Parallel and Distributed Simulation David Garlan (Carnegie Mellon) [advanced] Software Architecture: Past, Present and Future Mario Gerla (Los Angeles) [intermediate] Vehicle Cloud Computing Georgios B. Giannakis (Minnesota) [advanced] Sparsity and Low Rank for Robust Data Analytics and Networking Ralph Grishman (New York) [intermediate] Information Extraction from Natural Language Francisco Herrera (Granada) [intermediate] Imbalanced Classification: Current Approaches and Open Problems Paul Hudak (Yale) [introductory] Euterpea: From Signals to Symphonies Using Haskell Niraj K. Jha (Princeton) [intermediate] FinFET Circuit Design George Karypis (Minnesota) [introductory] Introduction to Parallel Computing: Architectures, Algorithms, and Programming Aggelos K. Katsaggelos (Northwestern) [intermediate/advanced] Sparsity-based Advances in Image Processing Arie E. Kaufman (Stony Brook) [advanced] Advances in Visualization Carl Kesselman (Southern California) [intermediate] Biomedical Informatics and Big Data Hugo Krawczyk (IBM Research) [intermediate] An Introduction to the Design and Analysis of Authenticated Key Exchange Protocols Pierre L'Ecuyer (Montréal) [intermediate] Quasi-Monte Carlo Methods in Simulation: Theory and Practice Laks Lakshmanan (British Columbia) [intermediate/advanced] Information and Influence Spread in Social Networks Wenke Lee (Georgia Tech) [introductory] DNS-based Monitoring of Malware Activities Maurizio Lenzerini (Roma La Sapienza) [intermediate] Ontology-based Data Integration Ming C. Lin (Chapel Hill) [introductory/intermediate] Physically-based Modeling and Simulation Jane W.S. Liu (Academia Sinica) [intermediate] Critical Information and Communication Technologies for Disaster Preparedness and Response Satoru Miyano (Tokyo) [intermediate] How to Hack Cancer Systems with Computational Methods Aloysius K. Mok (Austin) [intermediate] From Real-time Systems to Cyber-physical Systems Hermann Ney (Aachen) [intermediate/advanced] Probabilistic Modelling for Natural Language Processing - with Applications to Speech Recognition, Handwriting Recognition and Machine Translation Cathleen A. Norris (North Texas) &amp; Elliot Soloway (Ann Arbor) [introductory] Primary &amp; Secondary Educational Computing in the Age of Mobilism Jeff Offutt (George Mason) [intermediate] Cutting Edge Research in Engineering of Web Applications David Padua (Urbana) [intermediate] Parallel Programming with Abstractions Bijan Parsia (Manchester) [introductory] The Semantic Web: Conceptual and Technical Foundations Massoud Pedram (Southern California) [intermediate] Energy Efficient Architectures and Information Processing Systems Charles E. Perkins (FutureWei) [intermediate/advanced] Beyond 4G Prabhakar Raghavan (Google) [introductory/intermediate] Web Search and Advertising Sudhakar M. Reddy (Iowa) [introductory] Design for Test and Test of Digital VLSI Circuits Phillip Rogaway (Davis) [introductory/intermediate] Provably Secure Symmetric Encryption Gustavo Rossi (La Plata) [intermediate] Topics in Model Driven Web Engineering Kaushik Roy (Purdue) [introductory/intermediate] Low-energy Computing Robert Sargent (Syracuse) [introductory] Validating Models Douglas C. Schmidt (Vanderbilt) [intermediate] Patterns and Frameworks for Concurrent and Networked Software Bart Selman (Cornell) [intermediate] Fast Large-scale Probabilistic and Logical Inference Methods Mubarak Shah (Central Florida) [intermediate/advanced] Visual Crowd Surveillance Ron Shamir (Tel Aviv) [introductory] Revealing Structure in Disease Regulation and Networks Satinder Singh (Ann Arbor) [introductory/advanced] Reinforcement Learning: On Machines Learning to Act from Experience Dawn Xiaodong Song (Berkeley) [introductory] Selected Topics in Computer Security Mike Thelwall (Wolverhampton) [introductory] Sentiment Strength Detection for the Social Web Julita Vassileva (Saskatchewan) [introductory/intermediate] Engaging Users in Social Computing Systems Philip Wadler (Edinburgh) [introductory] Topics in Lambda Calculus and Life Yao Wang (Polytechnic New York) [introductory/advanced] Video Compression: Fundamentals and Recent Development Gio Wiederhold (Stanford) [introductory] Software Economics: How Do the Results of the Intellectual Efforts Enter the Global Market Place Limsoon Wong (National Singapore) [introductory/intermediate] The Use of Context in Gene Expression and Proteomic Profile Analysis Michael Wooldridge (Oxford) [introductory] Autonomous Agents and Multi-Agent Systems Ronald R. Yager (Iona) [introductory/intermediate] Fuzzy Sets and Soft Computing Philip S. Yu (Illinois Chicago) [advanced] Mining Big Data REGISTRATION: It has to be done at http://grammars.grlmc.com/SSTiC2013/Registration.php Since the capacity of the venue is limited, registration requests will be processed on a first come first served basis. The registration period will be closed when the capacity of the venue will be complete. FEES: They are the same (a flat rate) for all people by the corresponding deadline. They give the right to attend all courses. ACCOMMODATION: Information about accommodation is available on the website of the School. CERTIFICATE: Participants will be delivered a certificate of attendance. IMPORTANT DATES: Announcement of the programme: January 26, 2013 Six registration deadlines: February 26, March 26, April 26, May 26, June 26, July 26, 2013 QUESTIONS AND FURTHER INFORMATION: Lilica Voicu: florentinalilica.voicu&lt; at &gt;urv.cat POSTAL ADDRESS: SSTiC 2013 Research Group on Mathematical Linguistics (GRLMC) Rovira i Virgili University Av. Catalunya, 35 43002 Tarragona, Spain Phone: +34-977-559543 Fax: +34-977-558386 ACKNOWLEDGEMENTS: Ajuntament de Tarragona Diputació de Tarragona Universitat Rovira i Virgili </pre> GRLMC 2013-05-19T16:53:24 http://comments.gmane.org/gmane.comp.lang.caml.inria/57484 <pre>Hi, I've been wondering why the following is disallowed: ----- module M (U : sig end) = struct module type S = sig val x : int end let a = ((module struct let x = 42 end : S)) module A = (val a) end ----- The error message is: ----- File "foo.ml", line 4, characters 13-20: Error: This kind of expression is not allowed within the body of a functor. ----- Making M a module by removing the functor argument works as expected. Is there some inherent unsoundness issue with allowing this kind of use of first-class modules within functor bodies, or would it just be hard adding sound support for the above to the current type system? Regards, Markus -- Markus Mottl http://www.ocaml.info markus.mottl&lt; at &gt;gmail.com </pre> Markus Mottl 2013-05-19T15:14:46 http://comments.gmane.org/gmane.comp.lang.caml.inria/57480 <pre>Though it isn't mentioned in the ad, this job may be of particular interest to researchers with OCaml experience: https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=013243 The successful applicant will be working with Phil Wadler and me, extending the Links web programming language to support session types. Links is written in OCaml. The deadline for applications is 20th May 2013. Sam </pre> Sam Lindley 2013-05-17T15:10:56 http://comments.gmane.org/gmane.comp.lang.caml.inria/57479 <pre>------------------------------------------------------------------------------ 20th International Conference on Applications of Declarative Programming and Knowledge Management (INAP 2013) colocated with 27th Workshop on Logic Programming (WLP 2013) part of the Kiel Declarative Programming Days 2013 Kiel, Germany, September 11-13, 2013 ------------------------------------------------------------------------------ Declarative programming is an advanced paradigm for the modeling and solving of complex problems. This specification method attracted increased attention over the last decades, e.g., in the domains of databases and natural language processing, for the modeling and the processing of combinatorial problems, and for establishing systems for the Web. INAP 2013 ========= INAP is a communicative and dense conference for intensive discussion of applications of important technologies around logic programming, constraint problem solving, and closely related computing paradigms. It comprehensively covers the impact of programmable logic solvers in the internet society, its underlying technologies, and leading edge applications in industry, commerce, government, and societal services. We invite high quality contributions on different aspects of declarative programming, constraint processing and knowledge management, as well as their use for distributed systems and the Web, including, but not limited to the following areas (the order does not reflect any priorities): * knowledge management, e.g., data mining, decision support, deductive databases; * distributed systems and the Web, e.g., agents and concurrent engineering, Semantic Web; * constraints, e.g., constraint systems, extensions of constraint (logic) programming; * theoretical foundations, e.g., deductive databases, nonmonotonic reasoning, knowledge representation; * systems and tools for academic and industrial use; * knowledge-based Web services - logic solvers and applications. This year, INAP consists of the following four tracks, covering relevant subareas of declarative methods: * non-monotonic reasoning; * applications and system implementations; * extensions of logic programming; * databases, deductive databases, and data mining. WLP 2013 ======== The workshops on (constraint) logic programming serve as the scientific forum of the annual meeting of the Society of Logic Programming (GLP, Gesellschaft fuer Logische Programmierung e.V.). They bring together researchers interested in logic programming, constraint programming, and related areas like databases, artificial intelligence, and operations research. Previous workshops have been held in Germany, Austria, Switzerland, and Egypt. The joint INAP and WLP event aims to promote the cross-fertilizing exchange of ideas and experiences among researches and students from the different communities interested in the foundations, applications, and combinations of high-level, declarative programming languages and related areas. The technical program of the event will include invited talks, presentations of refereed papers, and system demonstrations. Important Dates =============== * Submission of papers: July 07, 2013 * Notification of acceptance: July 28, 2013 * Camera-ready papers: August 18, 2013 * Conference and Workshop: September 11-13, 2013 Submissions =========== Authors are invited to submit long papers (no longer than 15 pages) or short papers (no longer than 6 pages) in the following categories: * technical papers; * application papers; * system descriptions. Submissions must be unpublished original work and not submitted for publication elsewhere. However, work that already appeared in informally published workshop proceedings may be submitted too. All submissions must be in PDF format using LaTeX2e and the Springer llncs.cls class file. Paper submission is electronic via the Easychair submission system, available at http://www.easychair.org/conferences/?conf=inap2013 All accepted papers will be published in a technical report. As for previous joint INAP/WLP events, it is planned to publish selected papers in a post-conference proceedings volume in the Springer Lecture Notes in Artificial Intelligence (LNAI) series. Conference Chair (INAP) ======================= Ricardo Rocha (University of Porto, Portugal) Track Chairs (INAP) =================== Salvador Abreu (Universidade de Evora, Portugal): Extensions of Logic Programming Dietmar Seipel (University of Wuerzburg, Germany): Databases, Deductive Databases, and Data Mining Hans Tompits (Vienna University of Technology, Austria): Nonmonotonic Reasoning Masanobu Umeda (Kyushu Institute of Technology, Japan): Applications and System Implementations Program Committee (INAP) ======================== Salvador Abreu, University of Evora, Portugal Sergio Alvarez, Boston College, USA Christoph Beierle, FernUniversit�t in Hagen, Germany Philippe Codognet, JFLI/CNRS at University of Tokyo, Japan Daniel Diaz, University of Paris I, France Ulrich Geske, University of Potsdam, Germany Petra Hofstedt, Brandenburg University of Technology at Cottbus, Germany Katsumi Inoue, National Institute of Informatics, Japan Gabriele Kern-Isberner, University of Dortmund, Germany Vitor Nogueira, Univesity of Evora, Portugal Enrico Pontelli, New Mexico State University, USA Ricardo Rocha, University of Porto, Portugal Irene Rodrigues, University of Evora, Portugal Carolina Ruiz, Worcester Polytechnic Institute, USA Dietmar Seipel, University of Wuerzburg, Germany Terrance Swift, Universidade Nova de Lisboa, Portugal Hans Tompits, Technical University of Vienna, Austria Masanobu Umeda, Kyushu Institute of Technology, Japan Marina De Vos, University of Bath, United Kingdom Armin Wolf, Fraunhofer FIRST, Berlin, Germany </pre> Ricardo Rocha 2013-05-17T13:59:54 http://comments.gmane.org/gmane.comp.lang.caml.inria/57478 <pre></pre> Jose A Martin 2013-05-17T11:03:25 http://comments.gmane.org/gmane.comp.lang.caml.inria/57474 <pre>* HLPP2013, Paris 1-2 July 2013 https://sites.google.com/site/hlpp2013/ International Symposium on High-level Parallel Programming and Applications - Accepted papers: https://sites.google.com/site/hlpp2013/home/acceptedpapers - Invited talk by Leslie Valiant (Harvard U.) inventor of the BSP paradigm and 2010 Turing award: A Bridging Model for Multi-Core Computing Registration is open: http://www.hains.eu/hlpp2013registration.html* </pre> Gaetan Hains 2013-05-17T09:07:10 http://comments.gmane.org/gmane.comp.lang.caml.inria/57473 <pre> The 14th International Symposium on Database Programming Languages http://dbpl2013.inria.fr Riva del Garda, Trento, Italy August 30, 2013 co-located with VLDB 2013 Call for Papers For over 25 years, DBPL has established itself as the principal venue for publishing and discussing new ideas at the intersection of databases and programming languages. Many key contributions in query languages for object-oriented data, persistent databases, nested relational data, and semistructured data, as well as fundamental ideas in types for query languages, were first announced at DBPL. Today, the emergence of new data management applications such as cloud computing and “big data,” social network analysis, bidirectional programming, and data privacy has lead to a new flurry of creative research in this area, as well as a tremendous amount of activity in industry. DBPL is an established destination for such new ideas. Scope ----- DBPL solicits practical and theoretical papers in all topics at the intersection of databases and programming languages. Papers emphasizing new topics or emerging areas are especially welcome. Suggested, but not exclusive, topics of interest for submissions include: - Bidirectional programming languages - Data exchange and data integration - Data privacy - Data provenance - Databases and the semantic web - Databases and social networking - Databases and cloud computing - Databases in electronic commerce - Deductive databases and logic programming - Information-flow type systems - Language-integrated query mechanisms - Managing uncertain and imprecise information - Programming language support for databases - Streaming data processing - Schema mappings and metadata management - Security in data management - Semi-structured data and XML - Validation and type-checking - Web services Author Guidelines ----------------- Prospective authors are invited to submit papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Submissions should be no more than 10 pages long in the [ACM SIGPLAN] format. Each submission should begin with a succinct statement of the problem and a summary of the main results. If the authors believe more details are necessary to substantiate the main claims of the paper, they may include a clearly marked appendix to be read at the discretion of the committee. At least one author of each accepted paper must attend the symposium to present their work. Papers must be submitted online at the following URL: https://www.easychair.org/conferences/?conf=dbpl13 [ACM SIGPLAN] http://www.sigplan.org/authorinformation.htm Important Dates --------------- - Submission: June 7, 2013 (midnight GMT) - Notification: July 12, 2013 - Final versions due: August 2, 2013 - Symposium: August 30, 2013 Proceedings ----------- Accepted papers will appear in a formal electronic proceedings, using the Computing Research Repository (CoRR). Program Committee ----------------- *Program Co-Chairs* Todd J. Green LogicBlox, USA Alan Schmitt Inria-Rennes, France *Program Committee* Yanif Ahmed Johns Hopkins University, USA William Cook University of Texas-Austin, USA Ezra Cooper Google, USA John Field Google, USA Torsten Grust Universität Tübingen, Germany Dan Olteanu University of Oxford, UK Dan Suciu University of Washington, USA Philip Wadler University of Edinburgh, UK Geoffrey Washburn LogicBlox, USA Till Westmann 28msec, USA History ------- The 14th Symposium on Data Base Programming Languages (DBPL 2013) continues the tradition of excellence initiated by its predecessors in Roscoff, Finistere (1987), Salishan, Oregon (1989), Nafplion, Argolida (1991), Manhattan, New York (1993), Gubbio, Umbria (1995), Estes Park, Colorado (1997), Kinloch Rannoch, Scotland (1999), Marino, Rome (2001), Potsdam, Germany (2003), Trondheim, Norway (2005), Vienna, Austria (2007), Lyon, France (2009), and Seattle, Washington (2011). DBPL has been affiliated with VLDB since 1999. </pre> Alan Schmitt 2013-05-17T07:20:55 http://comments.gmane.org/gmane.comp.lang.caml.inria/57472 <pre> Does anybody know whatever happened to concurrent caml-light? Anybody have any idea if the Doligez-Gonthier-Leroy GC was ever implemented in another system? Thanks in advance, --chet-- </pre> Chet Murthy 2013-05-17T02:11:51 http://comments.gmane.org/gmane.comp.lang.caml.inria/57470 <pre>--------------------------------------------------------------------------- COMPUTABILITY IN EUROPE 2013: The Nature of Computation Milan, Italy, July 1 - 5, 2013 CALL FOR PARTICIPATION Informal Presentation Deadline: 31 May 2013 Early Registration Deadline: 31 May 2013 http://cie2013.disco.unimib.it co-located with Unconventional Computation and Natural Computation 2013 http://ucnc2013.disco.unimib.it --------------------------------------------------------------------------- TUTORIAL SPEAKERS: Gilles Brassard (Universite de Montreal) and Grzegorz Rozenberg (Leiden Institute of Advanced Computer Science and University of Colorado at Boulder) PLENARY TALKS: Ulle Endriss (University of Amsterdam) Lance Fortnow (Georgia Institute of Technology) Anna Karlin (University of Washington) Bernard Moret (Ecole Polytechnique Federale de Lausanne) Mariya Soskova (Sofia University) Endre Szemeredi (Hungarian Academy of Sciences, Rutgers University) SPECIAL SESSIONS: * Algorithmic Randomness (organizers: Mathieu Hoyrup, Andre Nies) Speakers: Johanna Franklin (University of Connecticut, USA), Noam Greenberg (Victoria University, New Zealand), Joseph S. Miller (University of Wisconsin, USA), Nikolay Vereshchagin (Moscow State University, Russia) * Computational Complexity in the Continuous World (organizers: Akitoshi Kawamura, Robert Rettinger) Speakers: Mark Braverman (Princeton University, USA), Daniel S. Graca (Universidade do Algarve), Joris van der Hoeven (Ecole polytechnique, France), Chee K. Yap (New York University, USA) * Computational Molecular Biology (organizers: Alessandra Carbone, Jens Stoye) Speakers: Sebastian Boecker (University of Jena, Germany), Marilia D. V. Braga (Inmetro, Brazil), Andrea Pagnani (Human Genetics Foundation, Italy), Laxmi Parida (IBM Thomas J. Watson Research Center, USA) * Computation in Nature (organizers: Mark Daley, Natasha Jonoska) Speakers: Jerome Durand-Lose (Univ. of Orleans, France), Giuditta Franco (Univ. of Verona Italy), Lila Kari (Univ. of Western Ontario, Canada), Darko Stefanovic (Univ. of New Mexico, USA) * Data Streams and Compression (organizers: Paolo Ferragina, Andrew McGregor) Speakers: Graham Cormode (AT&amp;T Labs, USA), Irene Finocchi (University of Rome, Italy), Andrew McGregor (University of Massachusetts, USA), Marinella Sciortino (University of Palermo, Italy). * History of Computation (organizers: Gerard Alberts, Liesbeth De Mol) Speakers: David Alan Grier (George Washington University, USA), Thomas Haigh (University of Wisconsin, USA), Ulf Hashagen (Deutsches Museum, Germany), Matti Tedre (Stockholm University, Sweden). CiE serves as an interdisciplinary forum for research in all aspects of computability and foundations of computer science, as well as the interplay of these theoretical areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. Women in Computability Workshop, July 2, 2013: We continue the programme "Women in Computability" supported by the journal "Annals of Pure and Applied Logic" (Elsevier). Speakers: Irene Finocchi, Laxmi Parida, Liesbeth De Mol The Women in Computability workshop aims to bring together women in Computing and Mathematical research to present and exchange their academic and scientific experience with young researchers. The meeting will offer the CIE scientific community the opportunity to encourage young students, especially young female researchers, to have active careers in the mathematical and computational sciences. INFORMAL PRESENTATIONS: Continuing the tradition of past CiE conferences, this year's CiE conference endeavours to get the best of both worlds. In addition to the formal presentations based on our LNCS proceedings volume, we invite researchers to present informal presentations. For this, please send us a brief description of your talk (between one paragraph and one page) by the DEADLINE: MAY 31, 2013 Please submit your abstract electronically, via EasyChair &lt;https://www.easychair.org/login.cgi?conf=cie2013&gt;, selecting the category "Informal Presentation". You will be notified whether your talk has been accepted for informal presentation usually within a week after your submission. **** Also authors of abstracts accepted for presentation are invited to submit a paper extending the abstract to the journal Computability **** __________________________________________________________________________ ASSOCIATION COMPUTABILITY IN EUROPE http://www.computability.org.uk CiE Conference Series http://www.illc.uva.nl/CiE CiE 2013 http://cie2013.disco.unimib.it CiE Membership Application Form http://www.cs.swan.ac.uk/acie __________________________________________________________________________ </pre> S B Cooper 2013-05-16T12:06:34 http://comments.gmane.org/gmane.comp.lang.caml.inria/57469 <pre>Si vous ne parvenez pas à lire ce message, http://stats.wewm122.com/Msg.ashx?c=uxDmq2806DkrZE0Ab%2FDVQ5C9bKuI6tVd Bonjour, Je me présente ; Etienne. J'ai vu votre site Internet et aimerait vous proposer mes services Vous vous demandez quels sont mes compétences ? Suivez-moi par ici pour les découvrir: http://stats.wewm122.com/Redirect.ashx?c=5Af4wETqzBNJodKJbUjKsmHgcDqgN0KgZVlxCRzM2tfzpxaXxtAe7ajjGs4YkeFXrMArKGT3Np5D8eygbNxUO45y1CLjlXMX8b7LMD3PigUQuqXgmNljhZbUGDsyhxe6cmyOyEBnjhh8UIGtefsN2SPdZUH7d5%2fuV6IuCNCeNG0ddp88Aeb4ww%3d%3d A tout de suite, * Cette vidéo est une astuce technique amusante que vous et VOUS SEUL pouvez voir sur le site www.total.fr grâce à ce mail Production Audiovisuelle Thierry MAILLARD Directeur Commercial 06.12.98.41.16 www.productionaudiovisuelle.tv Pour vous désinscrire, http://stats.wewm122.com/unsubscribe.aspx?c=uxDmq2806DkrZE0Ab%2fDVQ9VpaQcK26Lv8Ix0V3ID8Pw%3d&amp;t=69 </pre> Production Audiovisuelle 2013-05-16T09:45:49 http://comments.gmane.org/gmane.comp.lang.caml.inria/57468 <pre>Your are subscriber of list caml-list&lt; at &gt;inria.fr with email gclci-caml- list&lt; at &gt;gmane.org Everything about this list: http://sympa.inria.fr/sympa/info/caml-list Unsubscription: mailto:sympa_inria&lt; at &gt;inria.fr?subject=sig%20caml-list%20gclci-caml-list%40gmane.org </pre> caml-list-request< at >inria.fr 2013-05-15T08:28:47 http://comments.gmane.org/gmane.comp.lang.caml.inria/57465 <pre> bitstring is a library for manipulating bitstrings, binary file formats, protocols, etc from OCaml. http://code.google.com/p/bitstring/ The list of changes is here: http://code.google.com/p/bitstring/source/list Rich. </pre> Richard W.M. Jones 2013-05-14T16:45:04 Search the mailing list at Gmane query http://search.gmane.org/?group=$group=gmane.comp.lang.caml.inria