Nabble - Caml Discuss2

Re: iPhone development

2009-11-25T17:40:43Z

Yitzhak Mandelbaum <yitzhakm@...> writes:

> Back in May there was a brief discussion about developing for the
> iPhone in OCaml. Does anyone from that discussion, or anyone else,
> have any updates on the process/experience?

Greetings.

We're nearing completion of our first OCaml iPhone app. It's been
fantastic coding the app in OCaml. But on the other hand, there's a
lot of work to make that possible. In the long term, however, I
expect it will turn out to have been a great decision.

With Apple's release of iPhoneOS 3.0 we found that our previous
(somewhat hackish) patches were no longer working. We have a new set of
patches to OCaml 3.10.2 that adopt the OCaml 3.12 register assignments
for ARM, and are a little more properly integrated with the OCaml code
generator. In particular, the register assignments (as in OCaml 3.12)
avoid use of registers reserved to the OS. We can report that this
works perfectly under both iPhoneOS 2.2.1 and iPhoneOS 3.0. So things
are looking good for the OCaml 3.12 release as a basis for cross
compilation to the iPhone.

> Some specific questions:
>
> 1. Does anyone know of any open-source code that helps to interface
> OCaml with Cocoa?

No, sorry. We wrote our own code to do this.

> 2. In May, Jeff Scofield posted a patch to 3.10.2 for cross compiling
> to the arm processor. What about 3.11.x?

Since the ARM code generator is completely revamped for OCaml 3.12 we
are currently planning to skip the 3.11 release.

Regards,

Jeff Scofield
Seattle

_______________________________________________
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: New: cppo, C preprocessor for OCaml

2009-11-25T15:54:27Z

On Nov 18, 2009, at 5:38 AM, Richard Jones wrote:

>
> On Wed, Nov 18, 2009 at 01:54:18AM +0100, Martin Jambon wrote:
>> It is my pleasure to announce the first release of cppo, an OCaml-
>> friendly
>> equivalent of the C preprocessor (cpp).
>
> All I need now is a camlp4-powerful macro preprocessor for my C
> code ...

Try coccinelle:
http://coccinelle.lip6.fr/

>
> Rich.
>
> --
> Richard Jones
> Red Hat
>
> _______________________________________________
> 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: Looking for information regarding use of OCaml in scientific computing and simulation

2009-11-25T04:32:01Z

On Wed, Nov 25, 2009 at 12:05 PM, David MENTRE <dmentre@...> wrote:
> - My colleagues are working a lot with Mathlab, is there any synergy
> there (bindings, ways to integrate Mathlab within OCaml code or vice
> versa, ...)?

See OcamlMex : http://ocamlmex.gforge.inria.fr/

When working with scientific software libraries, you may need to
communicate with Fortran Code. The standard Bigarray library is very
useful for communicating numeric data sets in a layout directly
compatible with C or Fortran arrays :
http://caml.inria.fr/pub/docs/manual-ocaml/manual043.html

_______________________________________________
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: Looking for information regarding use of OCaml in scientific computing and simulation

2009-11-25T03:59:21Z

Hello,

On 25-11-2009, David MENTRE <dmentre@...> wrote:

> Hello,
>
> I'm considering doing a short presentation of OCaml to my colleagues
> in my research lab. They are working in the telecommunication and
> power electronic sectors, mainly doing signal processing and
> simulations. I know OCaml[1] but not specifically those domains.
>
> Therefore, I'm looking for reusable material for a presentation:
> - Slides on the use of OCaml in the signal processing and simulation domains;
>

Maybe you can have a look at
https://forge.ocamlcore.org/docman/view.php/77/34/VSYML-ocaml-meeting-2009.pdf

This is the slide of last year OCaml Meeting talk about VHDL simulation,
using OCaml. Maybe Florent Ouchet, the author, can give you more hint.

(I think VSYML is doing thing at symbolic level, so maybe it is the kind
of simulation you are looking for).

> - Code snippets of OCaml used in scientific computing or simulation,
> typically for advocacy like "it takes 10 lines in OCaml to do this,
> you would use 50 lines in C++ to do the same thing";
>

Maybe "OCaml for Scientist" from Jon Harrop can be a good start. There
some examples at the end that can help you (with code).

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

Looking for information regarding use of OCaml in scientific computing and simulation

2009-11-25T03:05:14Z

Hello,

I'm considering doing a short presentation of OCaml to my colleagues
in my research lab. They are working in the telecommunication and
power electronic sectors, mainly doing signal processing and
simulations. I know OCaml[1] but not specifically those domains.

Therefore, I'm looking for reusable material for a presentation:
- Slides on the use of OCaml in the signal processing and simulation domains;

- Code snippets of OCaml used in scientific computing or simulation,
typically for advocacy like "it takes 10 lines in OCaml to do this,
you would use 50 lines in C++ to do the same thing";

- Evidence of *actual use* of OCaml for scientific computing or
simulation, especially regarding usable libraries, bindings, etc.

- Evidence of people having switched from C/C++ simulators to OCaml
ones : good and bad points, issues, things to look at, etc.

- My colleagues are working a lot with Mathlab, is there any synergy
there (bindings, ways to integrate Mathlab within OCaml code or vice
versa, ...)?

You can reply to me on this list or off list. In case of personal
reply, let me know if I can reuse your name and affiliation.

If this presentation is done, I'll make the slides available under a
free license.

Many thanks in advance for any pointer,
Best regards,
david

[1] For both OCaml's strong (typing, GC, efficiency, ...) and bad
(strange syntax, ...) points.

_______________________________________________
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

SERA2010: 2nd Call for Papers, Specical Sessions, Workshops and Sponsorships

2009-11-24T08:14:50Z

Dear colleagues,

[ Apologies for the crossposting or if you get multiple copies of this email ]

We would like to invite you to submit a paper and / or a special session /
workshop proposal to the 8th IEEE/ACIS International Conference on Software
Engineering Research, Management and Applications (SERA2010) on
May 24 - 26, 2010. The event will take place at Concordia University, Montreal,
Canada.

http://users.encs.concordia.ca/~sera2010/

Please take notice of the attached Call for Papers, Call for Workshop Proposals
and Call for Sponsorship for further information.

The deadline for submission of either papers or the workshop/special session
proposals is December 15, 2009.

We kindly ask you to distribute this announcement among the colleagues in your
institution and post it on research mailing lists you have access to that you
may think this is relevant.

Important dates:
================

Paper and Proposals Submission: December 15, 2009
Acceptance Notification: January 25, 2010
Camera-ready Paper & Pre-Registration: February 20, 2010

Topics:
=======

http://users.encs.concordia.ca/~sera2010/files/First_CFP_SERA2010.pdf

- New theoretical foundations in Software Engineering Modeling
- Business Process & Enterprise Integration Engineering
- Communication Systems and Networks
- Computer Game Development, User Modeling and Management
- Cost Modeling and Analysis
- Data Mining and Knowledge Recovery
- Distributed Intelligent Systems
- Formal Methods and Tools
- Healthcare Engineering
- Human Computer Interaction
- Parallel and Distributed Computing Telecommunications
- Service Oriented Computing
- Mobile/Wireless Computing
- Requirements Modeling and Management
- Process Management & Improvement
- Reengineering, Reverse Engineering
- Autonomic Computing
- Requirements Engineering
- Safety and Security Critical Software
- Software Agent Technology
- Web Engineering, Web-Based Applications
- Virtual Reality and Computer Graphics

Call for Sponsorship:
=====================

http://users.encs.concordia.ca/~sera2010/files/SERA2010-CallForSponsorship-last.pdf

Submission:
===========

We solicit research and experience papers as well as research-in-progress and
practitioner reports in any of the technical areas listed under Scope & Topics.
Submit your paper via the web-based conference management system following
the instructions below:

* First, please review the IEEE PDF specifications.
http://www.ieee.org/portal/cms_docs/pubs/confstandards/pdfs/IEEE-PDF-SpecV401.pdf

* Go to the Conference Management System and follow the instructions on the
"Electronic Submission Page" that it takes you to.
http://acis.cps.cmich.edu:8080/SERA2010/submit.html

* The file that you submit should include the paper title, abstract, keywords,
and introduction followed by the body of your paper. The authorâs name and
address MUST NOT appear in this file. This is to facilitate a blind review.

* Upload your full paper in two column format (not to exceed 10 single-spaced
pages) via the web-based conference management system in PDF format, or you
can submit your paper in the final manuscript format.

* The format of the final manuscript should be in a two-column format and 8 pages
in length. Up to an extra 2 pages (total of 8) can be purchased at registration
time (see registration form for pricing).

* Please select at least two keywords from the drop-down menu and check boxes.
If you cannot find the right category in the drop-down menu then please enter
a category for your paper in the summary. We need this information when
determining reviewers for your paper.

Submissions, refereeing, and all correspondence will be conducted by e-mail.
All papers must be submitted through our Conference Management System.

http://acis.cps.cmich.edu:8080/SERA2010/submit.html

The program committee will review each submission and judge it with respect
to its originality, significance, and relevance.

Publication:
============

http://users.encs.concordia.ca/~sera2010/Publication.html

Accepted papers will be published in the IEEE Computer Society.

Conference organizers will select approximately 20 outstanding papers from
SERA 2010 to be published in Springer's Studies in Computational
Intelligence (SCI). The book series will be distributed at the conference
site.

Workshops and Special Sessions:
==============================

http://users.encs.concordia.ca/~sera2010/files/SERA2010-2d-Call%20for%20Workshop%20Proposals.pdf

Committees:
===========

http://users.encs.concordia.ca/~sera2010/People.html

For further inquires about SERA2010 conference and event planning, please
e-mail to:

sera2010-priv@...

You may obtain further information on the conference at its web site

http://users.encs.concordia.ca/~sera2010/

Sincerely yours,

SERA2010 organizers
===============================================================================

_______________________________________________
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: CamlJava - patch to build w/ recent JDK

2009-11-24T06:00:35Z

On Mon, Nov 23, 2009 at 04:55:37PM +0100, Stefano Zacchiroli wrote:
> Has anyone successfully built/used CamlJava [1] with recent OCaml and
> the open sourced Sun's JVM (OpenJDK)? I've tried for a while, but I'm
> stuck at the basics, i.e. making the example shipped with CamlJava work.
>
> First of all there is some needed gymnastic to build: apparently there
> is no longer _a_ legacy libjvm.so, but several one depending on which
> JRE you choose (at least: "Cacao" and "headless"). Of course they're in
> different dirs and I'm not sure about which is the right way (or even
> criteria) to choose one.

About this, here is a patch for the build system which makes CamlJava
build against both last Sun's JDK 6 (closed source) and last Open JDK.
It mainly account for libjvm.so having been moved around and some
upstream lib/ directory reorganization.

> After having passed through that (with a dirty symlink to one of the two
> libjvm.so), the shipped example fails with an exception while
> initializing the JVM:

This, unfortunately, is still standing :-(

Cheers.

PS I hope I'm not bothering with list + author's Cc, AFAIK there is no
BTS for CamlJava, so this is my best attempt for both being sure the
author gets the patch and that the patch is public for consumptions
by others

--
Stefano Zacchiroli -o- PhD in Computer Science \ PostDoc @ Univ. Paris 7
zack@{upsilon.cc,pps.jussieu.fr,debian.org} -<>- http://upsilon.cc/zack/
Dietro un grande uomo c'è ..| . |. Et ne m'en veux pas si je te tutoie
sempre uno zaino ...........| ..: |.... Je dis tu à tous ceux que j'aime

diff -Naur camljava-0.3.orig/lib/Makefile camljava-0.3/lib/Makefile --- camljava-0.3.orig/lib/Makefile 2009-11-24 14:43:18.555035491 +0100 +++ camljava-0.3/lib/Makefile 2009-11-24 14:42:07.943485242 +0100 @@ -46,7 +46,7 @@ rm -f fr/inria/caml/camljava/*.class clean:: - rm -f *.cm? *.[oa] + rm -f *.cm? *.[oa] *.cmxa .SUFFIXES: .ml .mli .cmo .cmi .cmx diff -Naur camljava-0.3.orig/Makefile.config camljava-0.3/Makefile.config --- camljava-0.3.orig/Makefile.config 2004-07-08 16:02:53.000000000 +0200 +++ camljava-0.3/Makefile.config 2009-11-24 14:52:27.474829525 +0100 @@ -17,7 +17,7 @@ ## For other platforms, adjust as required and tell us about it. # Home location for the JDK. Only used for setting other variables below. -JDKHOME=/usr/local/java_1.4.2 +JDKHOME=/usr/lib/jvm/java-6-sun # Where to find the JNI include files (for compiling the OCaml-JNI C stubs) JNIINCLUDES=-I$(JDKHOME)/include -I$(JDKHOME)/include/linux @@ -25,11 +25,18 @@ # The library to link with to get the JNI JNILIBS=-ljava +# Current architecture identification string, as intended by the JDK. +# Common values for x86 architectures are "i386" or "amd64". You can find it +# out by looking for the "*" patch component in the following pattern: +# $(JDKHOME)/jre/lib/*/libjava.so +ARCH=amd64 + # Additional link-time options to pass to $(CC) when linking with $(JNILIBS) -JNILIBOPTS=-L$(JDKHOME)/jre/lib/i386/ \ - -Wl,-rpath,$(JDKHOME)/jre/lib/i386/ \ - -Wl,-rpath,$(JDKHOME)/jre/lib/i386/client \ - -Wl,-rpath,$(JDKHOME)/jre/lib/i386/native_threads +JNILIBOPTS=-L$(JDKHOME)/jre/lib/$(ARCH)/ \ + -L$(JDKHOME)/jre/lib/$(ARCH)/server \ + -Wl,-rpath,$(JDKHOME)/jre/lib/$(ARCH)/ \ + -Wl,-rpath,$(JDKHOME)/jre/lib/$(ARCH)/server \ + -Wl,-rpath,$(JDKHOME)/jre/lib/$(ARCH)/native_threads # Additional options when compiling the OCaml-JNI C stubs. # -DJDK122_LINUX_HACK works around a nasty thread-related bug of diff -Naur camljava-0.3.orig/test/jnitest.ml camljava-0.3/test/jnitest.ml --- camljava-0.3.orig/test/jnitest.ml 2001-06-05 16:01:23.000000000 +0200 +++ camljava-0.3/test/jnitest.ml 2009-11-24 14:37:41.602405336 +0100 @@ -68,4 +68,6 @@ print_newline() let _ = - test() + try + test() + with exn -> prerr_endline (Printexc.to_string exn) diff -Naur camljava-0.3.orig/test/Makefile camljava-0.3/test/Makefile --- camljava-0.3.orig/test/Makefile 2001-06-05 16:01:15.000000000 +0200 +++ camljava-0.3/test/Makefile 2009-11-24 14:44:01.335369289 +0100 @@ -18,3 +18,4 @@ clean:: rm -f *.cm? + rm -f *.class

iPhone development

2009-11-24T05:45:22Z

Hi,

Back in May there was a brief discussion about developing for the
iPhone in OCaml. Does anyone from that discussion, or anyone else,
have any updates on the process/experience? Some specific questions:

1. Does anyone know of any open-source code that helps to interface
OCaml with Cocoa?
2. In May, Jeff Scofield posted a patch to 3.10.2 for cross compiling
to the arm processor. What about 3.11.x?

Thanks in advance,

Yitzhak

-----------------------------
Yitzhak Mandelbaum

_______________________________________________
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

Call for Participation: TLDI'10

2009-11-24T05:29:03Z

*********************************************************************
CALL FOR PARTICIPATION

TLDI 2010

ACM SIGPLAN Workshop on
Types in Language Design and Implementation

23 January 2010
Madrid, Spain

To be held in conjunction with POPL 2010

http://research.microsoft.com/~akenn/tldi2010/
*********************************************************************

IMPORTANT DATES

Hotel reservation deadline: December 28, 2009 (Monday)

VENUE

TLDI'10 and all POPL'10 affiliated events will take place at the
Melia Castilla Hotel, Madrid.

REGISTRATION

To register for TLDI'10, follow the link from the POPL 2010 page, at

http://www.cse.psu.edu/popl/10/

SCOPE

The role of types and proofs in all aspects of language design,
compiler construction, and software development has expanded greatly
in recent years. Type systems, type-based analyses and type-theoretic
deductive systems have been central to advances in compilation
techniques for modern programming languages, verification of safety
and security properties of programs, program transformation and
optimization, and many other areas. The ACM SIGPLAN Workshop on Types
in Language Design and Implementation brings researchers together to
share new ideas and results concerning all aspects of types and
programming, and is now an annual event.

INVITED SPEAKER

Matthias Felleisen, Northeastern University, Boston

PRELIMINARY PROGRAM

----------------------
Opening remarks: 9:20-9:30

Invited talk 9:30-10:30

*** Adding Types to Untyped Languages
Matthias Felleisen, Northeastern University, Boston

----------------------
** Session I 11:00-12:30

*** Effects for Cooperable and Serializable Threads
Jaeheon Yi and Cormac Flanagan

*** Race-free and Memory-safe Multithreading: Design and Implementation in Cyclone
Prodromos Gerakios, Nikolaos Papaspyrou and Konstantinos Sagonas

*** Distributed programming with distributed authorization
Kumar Avijit, Anupam Datta and Robert Harper

----------------------
** Session II 2:30-4:00

*** let should not be generalized
Dimitrios Vytiniotis, Simon Peyton Jones and Tom Schrijvers

*** Pointwise Generalized Algebraic Data Types
Chuan-kai Lin and Tim Sheard

*** Verifying Event-Driven Programs using Ramified Frame Properties
Neelakantan Krishnaswami, Lars Birkedal and Jonathan Aldrich

----------------------
** Session III 4:30-5:30

*** Lightweight Linear Types in System F^o
Karl Mazurak, Jianzhou Zhao and Steve Zdancewic

*** F-ing Modules
Andreas Rossberg, Claudio Russo and Derek Dreyer

----------------------

GENERAL CHAIR

Andrew Kennedy, Microsoft Research, Cambridge

PROGRAM CHAIR

Nick Benton, Microsoft Research, Cambridge

PROGRAM COMMITTEE

Gilles Barthe, IMDEA Software, Spain
Viviana Bono, University of Torino, Italy
Giorgio Ghelli, University of Pisa, Italy
Dan Grossman, University of Washington, USA
Atsushi Igarashi, Kyoto University, Japan
Conor McBride, University of Strathclyde, UK
Jeremy Siek, University of Colorado at Boulder, USA
Zhong Shao, Yale University, USA
Matthieu Sozeau, Harvard University, USA
Chris Stone, Harvey Mudd College, USA
Kristian Støvring, ITU Copenhagen, Denmark

_______________________________________________
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

CamlJava w/ recent OCaml (3.11.1) and Sun's JVM (OpenJDK)

2009-11-23T07:55:37Z

Has anyone successfully built/used CamlJava [1] with recent OCaml and
the open sourced Sun's JVM (OpenJDK)? I've tried for a while, but I'm
stuck at the basics, i.e. making the example shipped with CamlJava work.

First of all there is some needed gymnastic to build: apparently there
is no longer _a_ legacy libjvm.so, but several one depending on which
JRE you choose (at least: "Cacao" and "headless"). Of course they're in
different dirs and I'm not sure about which is the right way (or even
criteria) to choose one.

After having passed through that (with a dirty symlink to one of the two
libjvm.so), the shipped example fails with an exception while
initializing the JVM:

LOG: [0x00002b9a57f73c80] exception thrown while VM is initializing:
LOG: [0x00002b9a57f73c80] NULL: java.lang.Object
LOG: [0x00002b9a57f73c80] Aborting...

(this is with Cacao, with headless an exception its OCaml, but
apparently it is devoid of any inspectable content.)

Has any one here a success story to share?
Is there a planned future release of CamlJava?

Many thanks in advance,
Cheers.

[1] http://pauillac.inria.fr/~xleroy/software.html#camljava

--
Stefano Zacchiroli -o- PhD in Computer Science \ PostDoc @ Univ. Paris 7
zack@{upsilon.cc,pps.jussieu.fr,debian.org} -<>- http://upsilon.cc/zack/
Dietro un grande uomo c'è ..| . |. Et ne m'en veux pas si je te tutoie
sempre uno zaino ...........| ..: |.... Je dis tu à tous ceux que j'aime

_______________________________________________
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

ANN: Gaussian processes in OCaml

2009-11-23T01:04:29Z

It is my pleasure to announce the availability of OCaml GPR, a machine
learning library for dealing with Gaussian process regression in
OCaml. Gaussian processes are the hot thing du jour in machine
learning research, and this library implements a number of the most
recent advances in this field.

The library and manual can be downloaded from here:

http://www.ocaml.info/home/ocaml_sources.html#gpr

A Godi package (gpr) is already available, too.

Enjoy!

Best regards,
Markus

--
Markus Mottl http://www.ocaml.info markus.mottl@...

_______________________________________________
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

WGT 2010 Submission Deadline Extension and Final Call for Papers

2009-11-22T03:06:21Z

[ Apologies for multiple copies of this announcement ]

****************************************************************

FINAL CALL FOR PAPERS

Second Workshop on Generative Technologies
WGT 2010

http://wgt2010.elte.hu/

a satellite event of the
13th European Joint Conferences on
Theory and Practice of Software
(ETAPS 2010)
Paphos - Cyprus
March 27, 2010

****************************************************************

IMPORTANT DATES

- Submission of full paper: November 30, 2009
- Submission of tool demo paper: November 30, 2009
- Author notification: January 11, 2010
- Final version due: January 25, 2010

****************************************************************

SCOPE

Generative programming is an emerging paradigm aimed
at automating important tasks in software development,
compile-time and run-time code transformation, and the creation of
domain-specific languages and flexible libraries. The purpose of the
workshop is to provide a forum for researchers and practitioners working in
this area to discuss
state-of-the-art generative technologies and tools, and
exchange ideas about the future of generative programming.
Papers describing practical applications of generative styles,
and new research directions are expected. Suggested areas of
interest in the workshop include, but are not limited to:

- Generative programming, metaprogramming
- Separation of concerns
- Intentional programming
- Domain engineering and domain analysis
- Product-line architectures
- Feature-based techniques
- Compile-time and run-time code transformation
- Multi-stage languages
- Generic and Active library-development
- Analysis of language support for generative programming
- Semantics, type-systems of generative programs
- Case Studies and Demonstration Cases

****************************************************************

PAPER SUBMISSION

RESEARCH PAPERS (full papers, 8-10 pages) as well as TOOL DEMO PAPERS (up
to 2 pages) should be submitted to the WGT 2010 organizers in ENTCS format
(http://www.entcs.org). Submissions should be sent by e-mail to
wgt@....

Accepted workshop papers are published in the local proceedings. After
the workshop the participants are invited for submission to journal ENTCS
(only research papers). The workshop organizers have intention to set the
deadline of this second submission being later then the notification on
GPCE papers. Hence authors have opportunity to send their paper to GPCE
and if rejected, send to ENTCS without violating usual resubmission policy.

Further information will be available at the WGT 2010 home page.
At least one author of each accepted submission must register
and present the paper at the workshop.

****************************************************************

PROCEEDINGS

After revision, final copies of the accepted papers will be
published in Electronic Notes in Theoretical Computer Science
(ENTCS), Elsevier Science (http://www.entcs.org).

****************************************************************

PROGRAM COMMITTEE

- Don Batory University of Texas at Austin (USA)
- Jaakko Järvi Texas A&M University (USA)
- Julia Lawall University of Copenhagen (DK)
- Hanspeter Mössenböck Johannes Kepler University Linz (AT)
- Zoltán Porkoláb Eotvos Lorand University (HUN)
- Awais Rashid Lancaster University (UK)
- Joao Saraiva University of Minho (POR)
- Bran Selic Malina Software Corp (CAN)
- Yannis Smaragdakis University of Massachusetts, Amherst (USA)

****************************************************************

ORGANIZING COMMITTEE

- Zoltan Porkolab Eotvos Lorand University (HUN)
- Norbert Pataki Eotvos Lorand University (HUN)
- Zalan Szugyi Eotvos Lorand University (HUN)

e-mail: wgt@...

****************************************************************
_______________________________________________
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: Same name fields

2009-11-21T07:55:32Z

Mykola Stryebkov wrote:
> I'm trying to declare to record types with fields having the same name
> but different types.

This is not possible with record types (at the same module scope) - when you
declare the second type you obscure the previous type.

<snip>

> If I declare type ta second - everything works fine.
> Is it a bug?

No :o)

> If not, what is an appropriate workaround here?

Either put types ta and tb in separate modules (then you can use qualified
field names) or use different field names. The Unix module in the Standard
Library is a good example of how to do all this in practice - the record
types there all have standard prefixes on the field names.

The other alternative is to use objects but this is heavier in terms of
memory and field access and the type errors messages are more confusing than
with records (but neither of these reasons are necessarily bars to using
them!!).

David

PS Not that it I think it generally offends people on this list, but this
question would have been more appropriate for the Beginners' List -
http://groups.yahoo.com/group/ocaml_beginners

_______________________________________________
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: Same name fields

2009-11-21T07:51:28Z

Mykola Stryebkov <nick@...> writes:

> Hi,
>
> I'm trying to declare to record types with fields having the same name
> but different types.
> Something like this:
>
> ========================================================================
>
> type ta = { a : int; b : string }
> type tb = { a : float; b : string list }
>
> let f v = Printf.printf "%d\n" v.a
>
> ========================================================================
>
> Compiler says I have an error in the line with Printf:
> This expression has type float but is here used with type int
>
> If I declare type ta second - everything works fine.
> Is it a bug? If not, what is an appropriate workaround here?
>
> Thanks in advance.

No, that is a feature. Just like

let x = 1 in
let x = 2 in
let x = 3 in
Printf.printf "x = %d\n" x

As a workaround you can always put ta and tb into modules. Or you
create wrapper functions (with different names) to create and access
the records before overshadowing tb with ta like this:

type ta = { a : int; b : string }
let ta_make a b = { a = a; b = b; }
let ta_get_a ta = ta.a
let ta_get_b ta = ta.b

type tb = { a : float; b : string list }
let tb_make a b = { a = a; b = b; }
let tb_get_a tb = tb.a
let tb_get_b tb = tb.b

let f v = Printf.printf "%d\n" (ta_get_a v)

The drawback of the wrappers is that you can not match ta with { a =
a; b = b } -> .... So (sub)modules is really the best option if you
want the record fields to keep the same names.

MfG
Goswin

_______________________________________________
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

Same name fields

2009-11-21T07:32:58Z

Hi,

I'm trying to declare to record types with fields having the same name
but different types.
Something like this:

========================================================================

type ta = { a : int; b : string }
type tb = { a : float; b : string list }

let f v = Printf.printf "%d\n" v.a

========================================================================

Compiler says I have an error in the line with Printf:
This expression has type float but is here used with type int

If I declare type ta second - everything works fine.
Is it a bug? If not, what is an appropriate workaround here?

Thanks in advance.

--
Mykola Stryebkov
Blog: http://mykola.org/blog/
Public key: http://mykola.org/pubkey.txt
fpr: 0226 54EE C1FF 8636 36EF 2AC9 BCE9 CFC7 9CF4 6747

_______________________________________________
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

Call for Participation - PEPM'10 (co-located with POPL'10)

2009-11-18T09:42:56Z

===============================================================
CALL FOR PARTICIPATION
ACM SIGPLAN 2010 Workshop on
Partial Evaluation and Program Manipulation (PEPM'10)
Madrid, January 18-19, 2010

(Affiliated with POPL'10)

http://www.program-transformation.org/PEPM10
===============================================================

Abstracts of all papers and presentations are available from the
above web site.

INVITED TALKS:

* Lennart Augustsson (Standard Chartered Bank, UK)
Title: O, Partial Evaluator, Where Art Thou?

* Jeremy Siek (University of Colorado at Boulder, USA)
Title: General Purpose Languages Should be Metalanguages.

CONTRIBUTED TALKS:

* Nabil el Boustani and Jurriaan Hage.
Corrective Hints for Type Incorrect Generic Java Programs.

* Johannes Rudolph and Peter Thiemann.
Mnemonics: Type-safe Bytecode Generation at Run Time.

* Elvira Albert, Miguel Gomez-Zamalloa and German Puebla.
PET: A Partial Evaluation-based Test Case Generation Tool for Java
Bytecode.

* Martin Hofmann.
Igor2 - an Analytical Inductive Functional Programming System.

* José Pedro Magalhães, Stefan Holdermans, Johan Jeuring and Andres Löh.
Optimizing Generics Is Easy!

* Michele Baggi, María Alpuente, Demis Ballis and Moreno Falaschi.
A Fold/Unfold Transformation Framework for Rewrite Theories extended
to CCT.

* Hugh Anderson and Siau-Cheng KHOO.
Regular Approximation and Bounded Domains for Size-Change Termination.

* Évelyne Contejean, Pierre Courtieu, Julien Forest, Andrei Paskevich,
Olivier Pons and Xavier Urbain.
A3PAT, an Approach for Certified Automated Termination Proofs.

* Fritz Henglein.
Optimizing Relational Algebra Operations Using Generic Equivalence
Discriminators and Lazy Products.

* Adrian Riesco and Juan Rodriguez-Hortala.
Programming with Singular and Plural Non-deterministic Functions.

* Martin Hofmann and Emanuel Kitzelmann.
I/O Guided Detection of List Catamorphisms.

* Andrew Moss and Dan Page.
Bridging the Gap Between Symbolic and Efficient AES Implementations.

* Christopher Brown and Simon Thompson.
Clone Detection and Elimination for Haskell.

* Stefan Holdermans and Jurriaan Hage.
Making Stricterness More Relevant.

* Arun Lakhotia, Davidson Boccardo, Anshuman Singh and Aleardo Manacero
Júnior.
Context-Sensitive Analysis of Obfuscated x86 Executables.

* Xin Li and Mizuhito Ogawa.
Conditional Weighted Pushdown Systems and Applications.

* Ivan Lazar Miljenovic.
The SourceGraph Program.

* Florian Haftmann.
From Higher-Order Logic to Haskell: There and Back Again.

SPECIAL FEATURE:

* Andy Gill, Garrin Kimmell and Kevin Matlage.
Capturing Functions and Catching Satellites.

IMPORTANT DATES:

* Early registration deadline: December 22, 2009
* Hotel registration deadline: December 28, 2009

_______________________________________________
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: Polymorphic function in reference cell

2009-11-18T08:59:55Z

Thanks Marc,

I have been experimenting some with modules as well. But I think it
boils down to the same problem. I want to define a polymorphic function
outside the module that uses it (at the top of my module hierarchy). So
if the module UseFoo could be created using the function defined in the
top module (Top.f_fun) for the f function, then I think I would be able
to solve my problem.

module Bar = struct
let f_full a b =
Printf.printf "%s" a; b
end

module Foo (M : sig val f : 'a -> 'a end) =
struct
let use_f1 () = M.f 1
let use_f2 () = M.f 1.0
end

let f_fun b =
Bar.f_full "dummy" b

module UseFoo =
Foo(struct
let f b = f_fun b
end)

module Top =
struct

(* This is the function we want to be "f_fun" in UseFoo *)
let f_fun b =
Bar.f_full "bar" b

let a = UseFoo.use_f1 ()

let b = UseFoo.use_f2 ()
end

Marc de Falco wrote:

> I might have misunderstood your problem, and I do not have a solution
> pertaining to your exact question,
> but hiding the function and its type inside a module argument for a
> functor does the trick, no ?
> For example, if you define
>
> module Foo (M : sig type t val f : t -> t end) =
> struct let use_f x = M.f x end
>
> You can define too modules Foo1 and Foo2 using your different functions.
>
> Marc
>
> 2009/11/18 Hans Ole Rafaelsen <hans@... <mailto:hans@...>>
>
> Hi,
>
> I have a module that have several functions that take a
> polymorphic function as part of their arguments (Foo.f1 and Foo.f2
> in the example).
>
> module Foo = struct
>
> let f1 f =
> f 1
>
> let f2 f =
> f 1.0
>
> let f1_ref = (ref (fun _ -> raise (Failure "undefined") : ('a ->
> 'a) ))
> let set_f1_ref f =
> f1_ref := f
>
> let f2_ref = (ref (fun _ -> raise (Failure "undefined") : ('a ->
> 'a) ))
> let set_f2_ref f =
> f2_ref := f
>
> let use_f1 () =
> !f1_ref 1
>
> let use_f2 () =
> !f2_ref 1.0
>
> let internal_f v =
> v
>
> let internal_f1 () =
> internal_f 1
>
> let internal_f2 () =
> internal_f 1.0
>
> end
>
> let f v =
> v
>
> let a = Foo.f1 f
> let b = Foo.f2 f
> let () = Foo.set_f1_ref f
> let () = Foo.set_f2_ref f
> let c = Foo.use_f1 ()
> let d = Foo.use_f2 ()
>
>
> In my code I don't want to pass this function around to to all
> functions where Foo.f1 is called. For this reason I would like to
> store this function that Foo.f1 needs within Foo. (The function is
> created outside the module and bound with values generated outside
> the module.) However you can not store polymorphic functions in
> references. So I have to make one reference for each concrete type
> it is used for. What I really would like is use it as if it was
> defined within Foo, like internal_f and used like the internal_f1
> and internal_f2.
>
> Is it possible to only store one reference to this kind of
> function within a module, or do I really have to write a reference
> for each usage of the function? If I have to create a reference
> for each case, do anyone have some trick to avoid code repetition?
>
> Regards,
>
> Hans Ole
>
> _______________________________________________
> 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: Polymorphic function in reference cell

2009-11-18T06:58:09Z

I might have misunderstood your problem, and I do not have a solution pertaining to your exact question,
but hiding the function and its type inside a module argument for a functor does the trick, no ?
For example, if you define

module Foo (M : sig type t val f : t -> t end) =
struct let use_f x = M.f x end

You can define too modules Foo1 and Foo2 using your different functions.

Marc

2009/11/18 Hans Ole Rafaelsen <hans@...>

Hi,

I have a module that have several functions that take a polymorphic function as part of their arguments (Foo.f1 and Foo.f2 in the example).

module Foo = struct

let f1 f =
f 1

let f2 f =
f 1.0

let f1_ref = (ref (fun _ -> raise (Failure "undefined") : ('a -> 'a) ))
let set_f1_ref f =
f1_ref := f

let f2_ref = (ref (fun _ -> raise (Failure "undefined") : ('a -> 'a) ))
let set_f2_ref f =
f2_ref := f

let use_f1 () =
!f1_ref 1

let use_f2 () =
!f2_ref 1.0

let internal_f v =
v

let internal_f1 () =
internal_f 1

let internal_f2 () =
internal_f 1.0

end

let f v =
v

let a = Foo.f1 f
let b = Foo.f2 f
let () = Foo.set_f1_ref f
let () = Foo.set_f2_ref f
let c = Foo.use_f1 ()
let d = Foo.use_f2 ()

In my code I don't want to pass this function around to to all functions where Foo.f1 is called. For this reason I would like to store this function that Foo.f1 needs within Foo. (The function is created outside the module and bound with values generated outside the module.) However you can not store polymorphic functions in references. So I have to make one reference for each concrete type it is used for. What I really would like is use it as if it was defined within Foo, like internal_f and used like the internal_f1 and internal_f2.

Is it possible to only store one reference to this kind of function within a module, or do I really have to write a reference for each usage of the function? If I have to create a reference for each case, do anyone have some trick to avoid code repetition?

Regards,

Hans Ole

_______________________________________________
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

Polymorphic function in reference cell

2009-11-18T06:33:46Z

Hi,

I have a module that have several functions that take a polymorphic
function as part of their arguments (Foo.f1 and Foo.f2 in the example).

module Foo = struct

let f1 f =
f 1

let f2 f =
f 1.0

let f1_ref = (ref (fun _ -> raise (Failure "undefined") : ('a -> 'a) ))
let set_f1_ref f =
f1_ref := f

let f2_ref = (ref (fun _ -> raise (Failure "undefined") : ('a -> 'a) ))
let set_f2_ref f =
f2_ref := f

let use_f1 () =
!f1_ref 1

let use_f2 () =
!f2_ref 1.0

let internal_f v =
v

let internal_f1 () =
internal_f 1

let internal_f2 () =
internal_f 1.0

end

let f v =
v

let a = Foo.f1 f
let b = Foo.f2 f
let () = Foo.set_f1_ref f
let () = Foo.set_f2_ref f
let c = Foo.use_f1 ()
let d = Foo.use_f2 ()

In my code I don't want to pass this function around to to all functions
where Foo.f1 is called. For this reason I would like to store this
function that Foo.f1 needs within Foo. (The function is created outside
the module and bound with values generated outside the module.) However
you can not store polymorphic functions in references. So I have to make
one reference for each concrete type it is used for. What I really would
like is use it as if it was defined within Foo, like internal_f and used
like the internal_f1 and internal_f2.

Is it possible to only store one reference to this kind of function
within a module, or do I really have to write a reference for each usage
of the function? If I have to create a reference for each case, do
anyone have some trick to avoid code repetition?

Regards,

Hans Ole

_______________________________________________
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: New: cppo, C preprocessor for OCaml

2009-11-18T05:38:12Z

On Wed, Nov 18, 2009 at 01:54:18AM +0100, Martin Jambon wrote:
> It is my pleasure to announce the first release of cppo, an OCaml-friendly
> equivalent of the C preprocessor (cpp).

All I need now is a camlp4-powerful macro preprocessor for my C code ...

Rich.

--
Richard Jones
Red Hat

_______________________________________________
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: New: cppo, C preprocessor for OCaml

2009-11-18T03:33:16Z

Goswin von Brederlow wrote:

> Martin Jambon <martin.jambon@...> writes:
>
>> Dear list,
>>
>> It is my pleasure to announce the first release of cppo, an OCaml-friendly
>> equivalent of the C preprocessor (cpp).
>>
>> Cppo provides the classic #include, #define and conditionals (#ifdef, ...)
>> which are occasionally useful. Cppo can be used on OCaml files and variants
>> of OCaml that use the same lexer, such as ocamllex.
>>
>> The implementation of cppo was tested with ocaml 3.09 to 3.11 and is based on
>> ocamllex/ocamlyacc (works also with menhir which I used during the development).
>>
>>
>> The documentation and the source tarballs are at:
>>
>> http://martin.jambon.free.fr/cppo.html
>>
>> The package is also available from GODI (apps-cppo).
>>
>>
>> Enjoy.
>>
>>
>> Martin
>
> Without looking at it, is is camlp4 based and can I combine that with
> other camlp4 modules or do I need to seperately preprocess the
> source?

No, cppo is a standalone executable and is independent from camlp4 or camlp5.

Note that the camlp4 world has optcomp:

http://forge.ocamlcore.org/projects/optcomp/

Martin

--
http://mjambon.com/

_______________________________________________
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

ICFP '10: Second call for workshop proposals

2009-11-18T03:13:20Z

CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS
ICFP 2010
15th ACM SIGPLAN International Conference on Functional Programming
September 27 - 29, 2010
Baltimore, Maryland
http://www.icfpconference.org/icfp2010

The 15th ACM SIGPLAN International Conference on Functional
Programming will be held in Baltimore, Maryland on September 27-29,
2010. ICFP provides a forum for researchers and developers to hear
about the latest work on the design, implementations, principles, and
uses of functional programming.

Proposals are invited for workshops (and other co-located events, such
as tutorials) to be affiliated with ICFP 2010 and sponsored by
SIGPLAN. These events should be more informal and focused than ICFP
itself, include sessions that enable interaction among the attendees,
and be fairly low-cost. The preference is for one-day events, but
other schedules can also be considered.

----------------------------------------------------------------------

Submission details
Deadline for submission: November 20, 2009
Notification of acceptance: December 18, 2009

Prospective organizers of workshops or other co-located events are
invited to submit a completed workshop proposal form in plain text
format to the ICFP 2010 workshop co-chairs (Derek Dreyer and Chris
Stone), via email to icfp10-workshops at mpi-sws.org by November 20,
2009. (For proposals of co-located events other than workshops,
please fill in the workshop proposal form and just leave blank any
sections that do not apply.) Please note that this is a firm
deadline.

Organizers will be notified if their event proposal is accepted by
December 18, 2009, and if successful, depending on the event, they
will be asked to produce a final report after the event has taken
place that is suitable for publication in SIGPLAN Notices.

The proposal form is available at:

http://www.icfpconference.org/icfp2010/icfp10-workshops-form.txt

Further information about SIGPLAN sponsorship is available at:

http://acm.org/sigplan/sigplan_workshop_proposal.htm

----------------------------------------------------------------------

Selection committee

The proposals will be evaluated by a committee comprising the
following members of the ICFP 2010 organizing committee, together with
the members of the SIGPLAN executive committee.

Workshop Co-Chair: Derek Dreyer (MPI-SWS)
Workshop Co-Chair: Chris Stone (Harvey Mudd College)
General Chair: Paul Hudak (Yale University)
Program Chair: Stephanie Weirich (University of Pennsylvania)

----------------------------------------------------------------------

Further information

Any queries should be addressed to the workshop co-chairs (Derek
Dreyer and Chris Stone), via email to icfp10-workshops at mpi-sws.org.

_______________________________________________
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

Random questions

2009-11-18T02:59:08Z

I know little about PRGN and unfortunately in a lot of cases the
functions in the Random module don't provide me the right
interface. Could anybody tell me if the following functions preserve
the quality of the underlying PRGN and/or if there's a better way to
achieve that :

1) Generate an arbitrary int

let rint () = Random.bits () lor ((Random.bits () land 1) lsl 30)

2) Generate an arbitrary int in [0;max] (bounds included)

let random_uint ?(max = max_int) =
if max < 0 then invalid_arg "negative max" else
if max = max_int then Random.bits else
let bound = max + 1 in
fun () -> Random.int bound

3) Generate an arbitrary int in [-max;max] (bounds included)

let random_int ?(max = max_int) =
if max < 0 then invalid_arg "negative max" else
if max = max_int then
let rec aux () =
let v = rint () in if v = min_int then aux () else v in
aux
else
let bound = (2 * max) + 1 in
if 0 < bound && bound < max_int then
fun () -> -max + Random.int bound
else
let bound = Int32.add (Int32.mul 2l (Int32.of_int max)) 1l in
let min = Int32.of_int (-max) in
fun () -> Int32.to_int (Int32.add min (Random.int32 bound))

5) Generate an arbitrary float in [0;max] (bounds included)

let after_one = 1. +. epsilon_float
let random_ufloat ?(max = max_float) =
if max < 0. then invalid_arg "negative max" else
fun () -> (Random.float after_one) *. max

6) Generate an arbitrary float in [-max;max] (bounds included)

let after_one = 1. +. epsilon_float
let random_float ?(max = max_float) =
if max < 0. then invalid_arg "negative max" else
fun () -> (-1. +. (Random.float after_one) *. 2.) *. max

Thanks for your answers,

Daniel

_______________________________________________
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: New: cppo, C preprocessor for OCaml

2009-11-17T17:41:48Z

Martin Jambon <martin.jambon@...> writes:

> Dear list,
>
> It is my pleasure to announce the first release of cppo, an OCaml-friendly
> equivalent of the C preprocessor (cpp).
>
> Cppo provides the classic #include, #define and conditionals (#ifdef, ...)
> which are occasionally useful. Cppo can be used on OCaml files and variants
> of OCaml that use the same lexer, such as ocamllex.
>
> The implementation of cppo was tested with ocaml 3.09 to 3.11 and is based on
> ocamllex/ocamlyacc (works also with menhir which I used during the development).
>
>
> The documentation and the source tarballs are at:
>
> http://martin.jambon.free.fr/cppo.html
>
> The package is also available from GODI (apps-cppo).
>
>
> Enjoy.
>
>
> Martin

Without looking at it, is is camlp4 based and can I combine that with
other camlp4 modules or do I need to seperately preprocess the
source?

MfG
Goswin

_______________________________________________
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

New: cppo, C preprocessor for OCaml

2009-11-17T16:54:18Z

Dear list,

It is my pleasure to announce the first release of cppo, an OCaml-friendly
equivalent of the C preprocessor (cpp).

Cppo provides the classic #include, #define and conditionals (#ifdef, ...)
which are occasionally useful. Cppo can be used on OCaml files and variants
of OCaml that use the same lexer, such as ocamllex.

The implementation of cppo was tested with ocaml 3.09 to 3.11 and is based on
ocamllex/ocamlyacc (works also with menhir which I used during the development).

The documentation and the source tarballs are at:

http://martin.jambon.free.fr/cppo.html

The package is also available from GODI (apps-cppo).

Enjoy.

Martin

--
http://mjambon.com/

_______________________________________________
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

Fwd: Super plan

2009-11-17T11:52:59Z

Index

Salut

C'est dingue, mon pote vient de gagner 1 an de loyer en appelant le O8 92 69 46 92. J'ai appelé aussi dès que j'ai appris la nouvelle et j'ai moi aussi gagné.

Thomas

----- Message Original -----

De: " Julien "

à: Thomas

Date: 16 Novembre 2009 22:55

Objet: Fwd: Super Plan

Salut Thomas,

Tu ne vas jamais croire ce qu'il vient de m'arriver. Un pote m'a parlé de ce numéro O8 92 69 46 92 pour gagner 1 an de loyer. J'ai donc appelé et j'ai aussi gagné.

C'est dingue, appelle vite et dis moi.

Julien

----- Message Original -----

De: " Pierre "

à: Julien

Date: Dimanche 14 Novembre 2009 15 :09

Objet : Super Plan

Salut,

Voici comme promis le numéro de téléphone du jeu dont je t’avais parlé et grâce à qui j'ai gagné 1 an de loyer gratuit, O8 92 69 46 92, tu ne seras pas déçu.

@+

Pierre

Coût de l’appel 1,35€+0,34 centimes la minute

DiScoTec 2010: Call for Workshop Proposals

2009-11-17T07:28:14Z

[We apologize for multiple copies]

DisCoTec 2010

5th International Federated Conferences on
Distributed Computing Techniques

Amsterdam, Netherlands, 7-9 June 2010

Call for Workshop Proposals

A workshop is intended to provide a forum for members of a focused research
community to present preliminary research results and discuss position-style
papers. Workshops are alternative forums for presenting full research
papers. As such, organizers are encouraged to adopt an format that fosters
interaction and discussion, devoting less focus to individual, formal
presentations.

DisCoTec 2010 invites proposals for one day workshops to be held in
conjunction with the main events. Prospective workshop organizers are
requested to follow the guidelines below and are encouraged to contact the
workshop chair should any questions arise.

Important Dates

Workshop proposal deadline: December 17, 2009
Workshop proposal notification: December 23, 2009
Workshop: June 10, 2010

Submission and notification deadlines of the workshops are at the discretion
of the individual workshop organizers, however notification must be no later
than the early registration deadline for the main conference.

Proposal Submission Guidelines

Workshop proposals must be written in English, not exceed 5 pages with a
reasonable font and margin, and be submitted in PDF format via email to
Marcello Bonsangue (marcello@...).

Proposals should include the following information:

* The title, theme, and goals of the workshop.
* The targeted audience and the expected minimum and maximum number of
participants. We prefer that workshops remain open to participation
from any members of the community, but by-invitation-only workshops
will also be considered. Please explicitly state your preference.
* The publicity strategy that will be used by the workshop organizers
to promote the workshop.
* The participant solicitation and selection process.
* Publication plan. Each workshop is responsible for managing its own
publication (e.g., pre- or post- proceedings), if any is desired.
* Approximate budget proposal (see section Budget below for details).
* A preliminary version of the call for papers. This CFP must include
important dates including submission, notification, and camera-ready
deadlines.
* The equipment and any other resource necessary for the organization
of the workshop.
* A brief description of the organizer's background, including relevant
past experience on organizing workshops and contact information.

Review Process

Workshop proposals will be reviewed by the following committee:

* Frank S. de Boer, CWI, NL (DiScoTec 2010 General Chair)
* Marcello M. Bonsangue, University of Leiden, NL (Workshops Chair)
* Immo Grabe, CWI, NL
* Stephanie Kemper, CWI, NL
* Alexandra Silva, CWI, NL

Acceptance is based on an evaluation of the workshop's potential for
generating useful results, the timeliness and expected interest in the
topic, the organizer's ability to lead a successful workshop, and
potential for attracting sufficient number of participants.

Workshop Publicity

Workshop publicity is responsability of the organizers. In particular they
are responsible for the following items:

1. A workshop description (200 words) for inclusion on the DisCoTec site.
2. Hosting and maintaining web pages to be linked from the DisCoTec site.
Workshop coordinators can integrate their pages into the wiki-page of
DisCoTec 2010.
3. Workshop proceedings, if any. If there is enough interest, the
organizer of DiScoTec 2010 may contact Elevier for having a common
volume of the Electronic Proceedings in Theoretical Computer Science
(http://info.eptcs.org/) dedicated to the workshops of DiScoTec 2010.
4. Publicising the event.

Budget

DisCoTec will provide registration and organizational support for the
workshops. Registration fees must be paid for all participants, including
organizers and invited guests.

To cover lunches, coffee breaks and basic organizational expenses, all
workshops will be required to charge a minimum participation fee (the
precise amount is still to be determined). Each workshop may increase this
fee to cover additional expenses such as publication charges, student
scholarships, registration for invited speakers, etc. All fees will be
collected by the DisCoTec organizers as part of the registration, then
additional funds will be redistributed to the individual workshop
organizers.

Contact Information

Marcello Bonsangue (marcello@...)

_______________________________________________
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

New 3.0.2 release of the Caml Images library

2009-11-17T02:23:10Z

Hi,

I'm glad to announce the availability of the 3.0.2 version of the
CamlImages library, by Jun Furuse, François Pessaux, and Pierre Weis.

This is a bug fix release.

The software home page is:

http://cristal.inria.fr/camlimages/eng.htm

Sources and documentation are available from:

http://cristal.inria.fr/camlimages/camlimages-3.0.2.tgz
ftp://ftp.inria.fr/INRIA/Projects/cristal/caml-light/bazar-ocaml/camlimages-3.0.2.tgz

Contributions and comments are welcome.

Pierre Weis & June Furuse

CamlImages is an image processing library, which provides to the
objective Caml programmer a lot of image processing functionality.

CamlImages provides to the objective Caml programmer:

** basic functions for image processing and loading/saving various image
file formats (hence providing a translation facility from format to format),

** an interface with the Caml graphics library allows to display
images in the Graphics module screen and to mix them with Caml
drawings,

** a freetype interface, integrated into the library:
you can draw texts into images using any truetype fonts,

** a set of example programs, including gif animation, slide show,
and a postscript converter to print images.

_______________________________________________
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

New release of the Caml Examples collection

2009-11-17T01:14:12Z

[Version française ci-dessous]

The Caml Examples package is a large set of Caml example programs.
Most of the programs are provided both in Objective Caml and in Caml Light.

This new enhanced version of the Caml Examples package contains the complete
set of examples from the book ``Le langage Caml'' in Objective Caml (and
obviously also in Caml Light).

You will also find numerous examples of GUI programs, in addition to a
collection of games such as ``Le solitaire'', ``Sudoku'', ``Hanoi'',
``Showsort'', ``KB'' ...

The package home page is at http://cristal.inria.fr/caml_examples/eng.html

The tar balls are available here:

http://cristal.inria.fr/caml_examples/ocaml-examples-3.11.tar.gz
http://cristal.inria.fr/caml_examples/camllight-examples-0.82.tar.gz

All constructive criticisms and propositions are warmly welcomed.

Enjoy.

Pierre Weis.

PS: Listing ``KB'' in the game category can be a bit biased, since many
consider that the average Caml hacker may suffer some truly hard time to
understand this program! More than one brave soul has given up, terminating
the ``KB'' journey by qualifying it as a funny game ... for masochists!

[Version française]

La collection des ``Caml Examples'' est un gros ensemble d'exemples de
programmes Caml. La plupart des exemples sont fournis à la fois en Objective
Caml et en Caml Light.

Cette nouvelle version revue et augmentée comporte tous les exemples du livre
``Le langage Caml'' en Objective Caml (et bien sûr en Caml Light).

Vous y trouverez aussi de nombreux exemples d'interfaces graphiques en plus
d'une collection de jeux comme ``Le solitaire'', ``Sudoku'', ``Hanoi'',
``Showsort'', ``KB'' ...

Le site du recueil d'exemples est http://cristal.inria.fr/caml_examples/fra.html

Les archives compressées sont disponibles aux adresses:

http://cristal.inria.fr/caml_examples/ocaml-examples-3.11.tar.gz
http://cristal.inria.fr/caml_examples/camllight-examples-0.82.tar.gz

Toutes les critiques et propositions constructives seront accueillies avec
joie et reconnaissance. Pas les autres!

Amusez-vous bien avec ces exemples :)

Pierre Weis.

PS: Classer ``KB'' dans la catégorie des jeux est un biais un peu bizarre,
parce que beaucoup considèrent que le programmeur Caml moyen peut souffrir
un bon moment pour comprendre ce programme! Plus d'un courageux a fini par
abandonner, et a terminé son exploration de ``KB'' en le traitant en effet de
jeu amusant ... pour masochistes!

_______________________________________________
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: Polymorphic functors / modules and OCaml-R

2009-11-16T00:11:19Z

Guillaume Yziquel <guillaume.yziquel@...> writes:

> Hello.
>
> I've been trying stuff like these:
>
>> # module type 'a A = sig
>> Error: Parse error: [a_UIDENT] expected after "type" (in [str_item])
>> # module type ['a] A = sig
>> Error: Parse error: [a_UIDENT] expected after "type" (in [str_item])
>> # module type A = sig module type B end
>> ;;
>> Error: Failure: "abstract/nil module type not allowed here"
>> #
>
> Is there a way, somehow, of introducing such polymorphism in modules /
> functors?

Isn't that exactly what a functor is? You just need to wrape the 'a type
in a module.

MfG
Goswin

_______________________________________________
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

Polymorphic functors / modules and OCaml-R

2009-11-15T23:34:11Z

Hello.

I've been trying stuff like these:

> # module type 'a A = sig
> Error: Parse error: [a_UIDENT] expected after "type" (in [str_item])
> # module type ['a] A = sig
> Error: Parse error: [a_UIDENT] expected after "type" (in [str_item])
> # module type A = sig module type B end
> ;;
> Error: Failure: "abstract/nil module type not allowed here"
> #

Is there a way, somehow, of introducing such polymorphism in modules /
functors?

That would help me a lot. I'm currently try to write bindings for R
code, with OCaml-R, and I can come up with stuff like this:

> module Description : R.LibraryDescription = struct
> let name = "xts"
> let symbols = ["xts"]
> end
>
> module Library : R.Library = OCamlR.Require (Description)
>
> let [xts] = Library.root

What would be nice would be Description to be polymorphic in some sense
or another, so that I could describe the various R symbols that are made
available by the xts library.

The other, rather unrelated solution I see would be to replace stuff
above by something like:

> module Description : R.LibraryDescription = struct
> let name = "xts"
> let symbols = ["xts"; "print_xts"]
> end
> module Library : R.Library = OCamlR.Require (Description)
>
> type t
> external list_to_tuple : 'a list -> 'b = "list_to_tuple"
> let ( (xts : unit -> t),
> (print_xts : t -> unit)
> ) = list_to_tuple Library.root

where list_to_tuple would be a function constructing the tuple (no fixed
size) representing a given list. This is rather unsafe...

A polymorphic module, with argument a module type, would be something
very useful to describe a R library...

All the best,

--
Guillaume Yziquel
http://yziquel.homelinux.org/

_______________________________________________
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: calling OCaml from C on non-Mac platforms?

2009-11-15T07:22:36Z

On Nov 15, 2009, at 9:55 AM, Eric Cooper wrote:

> On Sun, Nov 15, 2009 at 08:27:49AM -0500, John Nowak wrote:
>
>> I'm trying to call OCaml from C.
>> [...]
>> ocamlopt -output-obj hello.cmx -o hello.o
>
> This is the main problem. You're clobbering the hello.o that OCaml
> produced when compiling hello.ml into native code.

Works well now, thanks. Perhaps the documentation could be amended to
make this more clear. Although, in retrospect, I should've realized
what was happening.

- John

_______________________________________________
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: calling OCaml from C on non-Mac platforms?

2009-11-15T06:55:52Z

On Sun, Nov 15, 2009 at 08:27:49AM -0500, John Nowak wrote:
> I'm trying to call OCaml from C.
> [...]
> ocamlopt -output-obj hello.cmx -o hello.o

This is the main problem. You're clobbering the hello.o that OCaml
produced when compiling hello.ml into native code.

> Does anyone have a correct set of instructions for doing this on
> non-Mac platforms? Thanks.

This worked fine for me:

ocamlopt -output-obj -o temp.o hello.ml
gcc -o hello main.c temp.o -L/usr/lib/ocaml -lasmrun -lm -ldl

_______________________________________________
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

calling OCaml from C on non-Mac platforms?

2009-11-15T05:27:49Z

I'm trying to call OCaml from C. Essentially, I have this for "main.c":

#include <caml/mlvalues.h>
#include <caml/callback.h>

void hello() {
static value *closure = NULL;
if(!closure) closure = caml_named_value("hello");
caml_callback(*closure, Val_unit);
}

int main(int argc, char **argv) {
caml_main(argv);
hello();
return 0;
}

And the following "hello.ml":

let hello () = print_endline "Hello, world!"
let () = Callback.register "hello" hello

I can then compile as follows on OS X 10.5:

ocamlopt -c hello.ml -o hello.cmx
ocamlopt -output-obj hello.cmx -o hello.o
gcc -c main.c -o main.o -I"`ocamlc -where`"
gcc -o hello hello.o main.o -L"`ocamlc -where`" -ldl -lm -lasmrun

This works fine on OS X. However, it does not seem to work on Linux/
AMD64 or FreeBSD/AMD64. I've tried suggestions from all over the web
and I've tried the approach given in the manual and nothing works. In
all non-Mac cases, I get this on the second line:

hello.o: file not recognized: File truncated
Error during linking

One thing I can do is do this instead of the first two lines:

ocamlopt -c -output-obj hello.ml

However, then I get the following:

hello.o: In function `camlHello__hello_58':
(.text+0x8): undefined reference to
`camlPervasives__print_endline_298'
/usr/lib/ocaml/3.10.2/libasmrun.a(startup.o): In function
`caml_main':
(.text+0x25f): undefined reference to `caml_data_segments'
/usr/lib/ocaml/3.10.2/libasmrun.a(startup.o): In function
`caml_main':
(.text+0x273): undefined reference to `caml_code_segments'
...

Does anyone have a correct set of instructions for doing this on non-
Mac platforms? Thanks.

- John

_______________________________________________
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: The lexer hack

2009-11-14T11:09:13Z

Micha <micha-1@...> writes:

> On Tuesday, 10. November 2009 15:42:52 Dario Teixeira wrote:
>> Hi,
>>
>> I'm creating a parser for a LaTeX-ish language that features verbatim
>> blocks. To handle them I want to switch lexers on-the-fly, depending on the
>> parsing context. Therefore, I need the state from the (Menhir generated)
>> parser to influence the lexing process (I believe this is called the "lexer
>> hack" in compiler lore).
>
> if the lexer cannot decide it on the tokens seen, a packrat parser (like
> Aurochs) may be a better choice, since in a PEG there is no seperate lexer,
> it's all one grammar, so you don't have this problem.
>
> Michael

There usualy must be something present to support '(* <vebatim
text> *)' and '"<verbatim text>"', i.e. comments and strings.
Find out what is recommended for those and adapt it.

MfG
Goswin

_______________________________________________
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

Nabble - Caml Discuss2

Re: iPhone development

Re: New: cppo, C preprocessor for OCaml

Re: Looking for information regarding use of OCaml in scientific computing and simulation

Re: Looking for information regarding use of OCaml in scientific computing and simulation

Looking for information regarding use of OCaml in scientific computing and simulation

SERA2010: 2nd Call for Papers, Specical Sessions, Workshops and Sponsorships

Re: CamlJava - patch to *build* w/ recent JDK

iPhone development

Call for Participation: TLDI'10

CamlJava w/ recent OCaml (3.11.1) and Sun's JVM (OpenJDK)

ANN: Gaussian processes in OCaml

WGT 2010 Submission Deadline Extension and Final Call for Papers

RE: Same name fields

Re: Same name fields

Same name fields

Call for Participation - PEPM'10 (co-located with POPL'10)

Re: Polymorphic function in reference cell

Re: Polymorphic function in reference cell

Polymorphic function in reference cell

Re: New: cppo, C preprocessor for OCaml

Re: New: cppo, C preprocessor for OCaml

ICFP '10: Second call for workshop proposals

Random questions

Re: New: cppo, C preprocessor for OCaml

New: cppo, C preprocessor for OCaml

Fwd: Super plan

DiScoTec 2010: Call for Workshop Proposals

New 3.0.2 release of the Caml Images library

New release of the Caml Examples collection

Re: Polymorphic functors / modules and OCaml-R

Polymorphic functors / modules and OCaml-R

Re: calling OCaml from C on non-Mac platforms?

Re: calling OCaml from C on non-Mac platforms?

calling OCaml from C on non-Mac platforms?

Re: The lexer hack

Re: CamlJava - patch to build w/ recent JDK