[Caml-list] Mbox-Readers
Hello, are there mbox-Libraries around? If not: a while ago I wrote something that was meant as a library for reading mbox-files. But I have not worked on that code for a long time. I did just some matching with ocamllex to split the mails, and then worked on strings. The stuff needs to be rewritten, because I used Str-Lib, and would prefer Pcre, but maybe that also is not a good idea So... do I need UTF-8 parsing? Is there something in ocamlnet, what I should use? Are there encodings which I might also have to handle? And if so: which? And what library to use for it? I think even Pcre might not match my needs here? Ciao, Oliver P.S.: And: what kind of License would make sense? LGPL3? ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
[Caml-list] Re: Mbox-Readers
On 11-05-2010, oli...@first.in-berlin.de oli...@first.in-berlin.de wrote: Hello, are there mbox-Libraries around? You can have a look at: https://forge.ocamlcore.org/scm/viewvc.php/trunk/mbox.ml?view=markuprevision=11root=spamoracle There are other files in the repository that can maybe match other requirements. This is not a complete mbox-reader but it can help you on some points (at least to see what other people have done). You can use it as an helper to write your own. P.S.: And: what kind of License would make sense? LGPL3? In doubt, I recommend LGPL 2.1 with OCaml linking exception. Regards, Sylvain Le Gall ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
Re: [Caml-list] about OcamIL
A little off topic, but how is Mono/Unix these days? Still leaks memory, you refer to your examinations? (http://flyingfrogblog.blogspot.com/2009/01/mono-22-still-leaks-memory.html?showComment=1233522107493#c7872630239059031867) where you say yes and the mono devs are say no to memory leaking? has broken TCO Again, I think other people do not have the same opion on this ( http://flyingfrogblog.blogspot.com/2009/01/mono-does-not-support-tail-calls.html) and runs like a dog I think this on the other hand is indeed a problem and has been documented seriously (also by you: http://flyingfrogblog.blogspot.com/2009/01/mono-22.html) I've introduced the post with some license related concerns, maybe I should take a step back and think about what I want: 1. - programming in a ML like language ( especially the caml family since I really like those lightweigt type definitions and the pattern matching that can be applied on those) 2. - high performance runtime, preferably a jit based vm, no problems with TCO 3. - a true open source license (approved by Open Source Initiative or by Free Software Foundation) I think this 3 point are REASONABLE but the combination of those 3 items is INEXISTENT. Ocaml: the vm is not very fast (no jit AFAIK) F#: No open source license so far. Bad runtime performance on mono. Ocaml on HLVM: I would appreciate if Jon could make a clear statement if this is something serious or just a little toy. Scala: Not really a ML language: I think it's kind of fun to try to emulate ocaml features or try to port ocaml apps to scala. The problem is the actual work is never going to be finished. I have some concerns the the runtime performance is unpredictable (no TCO, a lot of hacks into the JVM) Yeti: I like the language, but it is in a experimental stage Nekoml: Supercool project, but the vm is not the fastest and jit runs only on x86 platforms So I guess the best thing would be to use good ol Ocaml in native mode...? A last idea: What do you think about libjit? They claim that a jvm/clr like runtime could be built in weeks. Wouldn't it be nice to have a fast vm for Ocaml (ocamljit) ? Does someone has experience with this, I think writing a fast vm is hard, but a fast vm for a functional language is nearly impossible? Maybe OcamIL could then be used as a model for a jit backend, since its MSIL output already runs on libjit (DotGnu, alias pnet) On Mon, May 10, 2010 at 11:53 PM, Jon Harrop jonathandeanhar...@googlemail.com wrote: A little off topic, but how is Mono/Unix these days? Last I checked (2 years ago) it implemented the basic libraries and runtimes but had terrible performance. Is it now on par with Windows? Still leaks memory, has broken TCO and runs like a dog. Mono has also fallen even farther behind now that .NET 4 is out. However, they have at least stated that they intend to start trying to support F# on Mono. Then again, they stated about 6 years ago they were going to replace their crappy conservative GC with one that might actually work but they never managed to do that either... Cheers, Jon. ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
Re: About Cryptokit (was: Re: [Caml-list] Re: SHA1 = stdlib ?!)
Hello Séphane, 2010/4/30 David MENTRE dmen...@linux-france.org: 2010/4/30 Stéphane Glondu st...@glondu.net: David MENTRE a écrit : I also used Cryptokit once. It was pretty useful and easy to use. However I had to modify a few lines in it in order to allow me to do some compositions with Cryptokit building blocks. Could you be more specific? Right now no, sorry. I'll try to dig up the patch I needed at that time. I think this is the patch I used: http://svn.gna.org/viewcvs/diseba/trunk/cryptokit-1.3-hmac256.patch?rev=13view=auto Here is some code that used the added functionalities: http://svn.gna.org/viewcvs/diseba/trunk/disk.ml?rev=18r1=17r2=18 All of this is quite old and might be no longer needed with more recent CryptoKit. More generally, this never-finished OCaml project was based on CryptoKit: http://svn.gna.org/viewcvs/diseba/trunk/#dirlist https://gna.org/projects/diseba/ Best regards, david ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
Re: [Caml-list] Generating random generators
Hi, However, random numbers are tricky, and I'm suspicious of just adding a new operation ad hoc when I don't understand how the underlying PRNG works. Hence, I'd appreciate if anyone could offer some insight on whether the above approach has any hidden pitfalls (i.e. some sort of regularity that might appear when the values from two generated streams are combined in a particular fashion), or if there is a faster way of generating new generators robustly. Random.State.make invokes Digest.string for every int of the seed, so it seems like overkill. Have you considered using Cryptokit's Random module? It offers many generators, one of which meets your determinism criteria. Cheers, Dario Teixeira ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
Re: [Caml-list] about OcamIL
On Tue, May 11, 2010 at 9:39 AM, Peng Zang peng.z...@gmail.com wrote: And of course as you pointed out you can always compile OCaml code to native machine code which has always had good performance. i was under the impression the main complaint is lack of top-notch support for concurrency? ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
Re: [Caml-list] about OcamIL
1. - programming in a ML like language ( especially the caml family since I really like those lightweigt type definitions and the pattern matching that can be applied on those) 2. - high performance runtime, preferably a jit based vm, no problems with TCO 3. - a true open source license (approved by Open Source Initiative or by Free Software Foundation) I think this 3 point are REASONABLE but the combination of those 3 items is INEXISTENT. i, for one, am hoping Shen comes through for us. http://groups.google.com/group/qilang ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
Re: [Caml-list] [ANN] OCaml-Java project: 1.4 release
I'm curious whether there are any notes / pointers regarding the completeness of the ocaml-java implementation (couldn't find this on the web site). I'm wondering about the feasibility of using it for a moderately large ocaml project I've been working on which uses Lwt to perform async I/O. I assume that for this to work with ocaml-java, the lowest levels of Lwt would need to be adapted to use NIO or threads in order to run on a JVM. Also my application is written in a pure functional style, and relies heavily on closures, currying, recursion and the ability for the compiler to do tail call optimization. I'm concerned that this will not translate well to Java. I'd appreciate whatever information on this any of you can provide, Warren On Feb 6, 2010, at 12:10 PM, fo...@x9c.fr wrote: This post announces the 1.4 release of the OCaml-Java project. The goal of the OCaml-Java project is to allow seamless integration of OCaml and Java. Home page: http://ocamljava.x9c.fr Download page: http://ocamljava.x9c.fr/downloads.html Toplevel applet: http://ocamljava.x9c.fr/toplevel/toplevel.html Main changes since 1.3: - upgrade from OCaml version 3.11.1 to 3.11.2 - improved (and simplified) code generator, with correct stack maps - various code and documentation fixes - improved build scripts - bug #28 (Barista): support for ocamlfind - bug #46 (Barista): invalid padding size for switch instructions - bug #47 (Barista): invalid handling of '@LineNumber' - bug #48 (Cadmium): error in 'mod_float' primitive implementation - bug #50 (Nickel): GUI version ignores parameters Xavier Clerc ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
[Caml-list] Calculemus 2010: Deadline Extension for Emerging Trends
[Apologies for cross-postings.] -- CALCULEMUS 2010 - Deadline Extension for Emerging Trends -- 17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning CNAM, Paris, France, July 6-7, 2010 http://cicm2010.cnam.fr/calculemus/ *** DEADLINE EXTENSION Submission deadline: May 19, 2010 *** Calculemus is a series of conferences dedicated to the integration of computer algebra systems (CAS) and systems for mechanised reasoning, the interactive theorem provers or proof assistants (PA) and the automated theorem provers (ATP). Currently, symbolic computation is divided into several (more or less) independent branches: traditional ones (e.g., computer algebra and mechanised reasoning) as well as newly emerging ones (on user interfaces, knowledge management, theory exploration, etc.) The main concern of the Calculemus community is to bring these developments together in order to facilitate the theory, design, and implementation of integrated systems for computer mathematics that will routinely be used by mathematicians, computer scientists and engineers in their every day business. We seek original research papers for the upcoming Calculemus meeting, which will be held jointly with AISC 2010 and MKM 2010 (confederated in the Conferences on Intelligent Computer Mathematics, CICM 2010) in Paris (France). Topics of Interest == The scope of Calculemus covers all aspects of the interplay of mechanised reasoning and computer algebra, including cross-fertilisation between those two research areas, as well as the development of integrated systems that transcend both computer algebra and theorem proving. Potential topics of interest include: * Theorem proving in computer algebra (CAS) * Computer algebra in theorem proving (PA and ATP) * Case studies and applications that both involve computer algebra and mechanised reasoning * Representation of mathematics in computer algebra * Adding computational capabilities to PA and ATP * Formal methods requiring mixed computing and proving * Combining methods of symbolic computation and formal deduction * Mathematical computation in PA and ATP * Theory, design and implementation of interdisciplinary systems for computer mathematics * Infrastructure for mathematical services * Theory exploration techniques Papers on other topics closely related to the above research areas will also be welcomed for consideration. Submission == Theoretical and applied research papers on all topics within the scope of the symposium are invited. Submitted papers must be in English and we suggest 10 pages for emerging trends extended abstracts (the upper limit is 20 pages, authors must provide at least a title and 200 word abstract). The title page should contain the title, author(s) with affiliation(s), e-mail address(es), listing of keywords and abstract. The program committee will subject all emerging trends papers to a (light) peer review. Results must be unpublished. Papers should be prepared in LaTeX and formatted according to the requirements of the Springer's LNAI series (the corresponding style files can be downloaded from http://www.springer.de/comp/lncs/authors.html and are the same for LNCS and LNAI). The web page for electronic submission is: http://www.easychair.org/conferences/?conf=calculemus2010 Proceedings === Extended abstracts on emerging trends will be published as a technical report of CEDRIC (CNAM/ENSIIE) and will be electronically available. These papers are expected to be describing work in progress. Important Dates === For extended abstracts on emerging trends: Submission deadline: May 19, 2010 Notification of acceptance: May 30, 2010 Camera ready copies due: June 7, 2010 The Calculemus conference is on July 6-7, 2010. Programme Committee === Markus Aderhold (TU Darmstadt, Germany) Arjeh Cohen (Eindhoven University of Technology, The Netherlands) Thierry Coquand (Chalmers University of Technology, Sweden) James H. Davenport (University of Bath, UK) David Delahaye (CNAM, France), Chair Lucas Dixon (University of Edinburgh, UK) William M. Farmer (McMaster University, Canada) Temur Kutsia(RISC, Austria) Assia Mahboubi (INRIA Saclay, France) Renaud Rioboo (ENSIIE, France), Chair Julio Rubio (Universidad de La Rioja, Spain) Volker Sorge(University of Birmingham, UK) Stephen M. Watt (University of Western Ontario, Canada) Freek Wiedijk (Radboud University Nijmegen, The Netherlands) Wolfgang Windsteiger(RISC, Austria) ___ Caml-list mailing list. Subscription management:
Re: [Caml-list] about OcamIL
-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 Ah, I guess I think of ocamlrun as just an interpreter. But you're right, that's also a vm. Peng On Tuesday 11 May 2010 07:47:25 pm ben kuin wrote: OCaml doesn't have a vm like the jvm. ocamlc compiles to bytecode ocamlrun interprets the bytecode bytecode interpreter == vm hence ocaml has a vm On Tue, May 11, 2010 at 6:39 PM, Peng Zang peng.z...@gmail.com wrote: -BEGIN PGP SIGNED MESSAGE- Hash: SHA1 On Tuesday 11 May 2010 07:22:56 am ben kuin wrote: I think this 3 point are REASONABLE but the combination of those 3 items is INEXISTENT. Ocaml: the vm is not very fast (no jit AFAIK) So I guess the best thing would be to use good ol Ocaml in native mode...? What do you mean by vm? OCaml doesn't have a vm like the jvm. Although there's been some great work on compiling OCaml for the jvm. OCaml does have a toplevel interpreter. It even has a native mode toplevel now that's suppose to be fast (anyone have any experience with this?). So that's good. And of course as you pointed out you can always compile OCaml code to native machine code which has always had good performance. Peng -BEGIN PGP SIGNATURE- Version: GnuPG v2.0.7 (GNU/Linux) iD4DBQFL6YhCfIRcEFL/JewRAuB7AJ9tDRHgDJGt3+VqmX4u/IxU+vRXyQCWL3NX SkKhph4GC7xGA85ilSspTw== =IxIG -END PGP SIGNATURE- -BEGIN PGP SIGNATURE- Version: GnuPG v2.0.7 (GNU/Linux) iD8DBQFL6gscfIRcEFL/JewRAgWBAJ93Hee3UhXDbLdX+bCuQs3Vwx72mQCaA/e4 G5U5E2pOf5NY3QvcciaenuU= =W6jj -END PGP SIGNATURE- ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Archives: http://caml.inria.fr Beginner's list: http://groups.yahoo.com/group/ocaml_beginners Bug reports: http://caml.inria.fr/bin/caml-bugs
