From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on yquem.inria.fr X-Spam-Level: * X-Spam-Status: No, score=1.4 required=5.0 tests=HTML_MESSAGE,SPF_NEUTRAL autolearn=disabled version=3.1.3 X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from discorde.inria.fr (discorde.inria.fr [192.93.2.38]) by yquem.inria.fr (Postfix) with ESMTP id 5DBE9BC0A for ; Wed, 6 Jun 2007 20:28:03 +0200 (CEST) Received: from wa-out-1112.google.com (wa-out-1112.google.com [209.85.146.178]) by discorde.inria.fr (8.13.6/8.13.6) with ESMTP id l56IS052007843 for ; Wed, 6 Jun 2007 20:28:01 +0200 Received: by wa-out-1112.google.com with SMTP id j37so328213waf for ; Wed, 06 Jun 2007 11:27:59 -0700 (PDT) DKIM-Signature: a=rsa-sha1; c=relaxed/relaxed; d=gmail.com; s=beta; h=domainkey-signature:received:received:message-id:date:from:sender:to:subject:in-reply-to:mime-version:content-type:references:x-google-sender-auth; b=MBBEcmmNWOxXCk+knphFK0bUvkZ5+IN95w+2KYJ+yKGDTO3ozTJ6dvm/5dyX+/h+5zkG912oCUIAU8InHEF8aXJCkeHmSEpf8hjiyNZaW0brFrN4AgkVsSG1TegUcT7Ex+pum7YNm4yFXTzfHE7RHkSLlLZDgrjVN5rPwXsM+J0= DomainKey-Signature: a=rsa-sha1; c=nofws; d=gmail.com; s=beta; h=received:message-id:date:from:sender:to:subject:in-reply-to:mime-version:content-type:references:x-google-sender-auth; b=I3zotZ68BuNSa5Zj6HB6yUlrr1gVOruZ6Mkpt1ehYMv4suMswILACJ1AxSjk6GXw3Nd/X3utvYI6kKOmyUyLIjZuq+I2lYhupsWZN+pnZ+yYo1QovU89DjM6gcu6nKhSmkR/XJN1S1wJKk7dx9fzQDRElOXfFBZcoy8TBO6zxVA= Received: by 10.114.168.1 with SMTP id q1mr686398wae.1181154479507; Wed, 06 Jun 2007 11:27:59 -0700 (PDT) Received: by 10.114.234.6 with HTTP; Wed, 6 Jun 2007 11:27:59 -0700 (PDT) Message-ID: <5de3f5ca0706061127l3c6fa68bx517613b13cd55bc1@mail.gmail.com> Date: Wed, 6 Jun 2007 11:27:59 -0700 From: "Greg Meredith" Sender: lgreg.meredith@gmail.com To: caml-list@yquem.inria.fr Subject: Re: Caml-list Digest, Vol 24, Issue 18 In-Reply-To: <20070606100003.AA215BC6C@yquem.inria.fr> MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_45538_9817981.1181154479463" References: <20070606100003.AA215BC6C@yquem.inria.fr> X-Google-Sender-Auth: 7bce07380326346e X-j-chkmail-Score: MSGID : 4666FCB0.000 on discorde : j-chkmail score : X : 0/20 1 0.000 -> 1 X-Miltered: at discorde with ID 4666FCB0.000 by Joe's j-chkmail (http://j-chkmail . ensmp . fr)! X-Spam: no; 0.00; logics:01 logics:01 etaps:01 entcs:01 lncs:01 ocaml:01 ocaml:01 higher-order:01 namespaces:01 combinators:01 pointer:01 pointer:01 co-author:01 encodings:01 recursion:01 ------=_Part_45538_9817981.1181154479463 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: quoted-printable Content-Disposition: inline Oliver, Many thanks for the links to polycontextural logics. My feeling is it will take me quite some investment to get a feeling for the framework. In the meantime, there are fairly simple accounts of concurrency with reflection offering natural logics (without apparent liar's paradox issues, as i understand them). At ETAPS 05 i presented two papers on such systems. You can find preprints here ( http://svn.biosimilarity.com/src/open/papers/trunk/concurrency/rho/ex_nihil= o_entcs/ex_nihilo_finco.pdf; http://svn.biosimilarity.com/src/open/papers/trunk/concurrency/rho/tgc%20ln= cs/ex_nihilo_logic.pdf). i did a quick and dirty OCaml implementation (as a way to learn OCaml), which you can find here ( http://svn.biosimilarity.com/src/open/mirrororrim/rho/trunk/ocaml/). The approach i took was based on my dissatisfaction with the fact that the \pi-calculus was dependent on a theory of names; and, names had to have an effective theory of equality (thus, sneaking in a notion of computation -- which the \pi-calculus was supposedly providing the foundations of). If you formulate the situation as: given a set (resp. theory) of names, X, the \pi-calculus generates a set (resp. theory) of processes \Pi(X), then you can ask if the following domain equation has a solution - X =3D \Pi(X) It does (lots of them). In the first paper cited i presented a minimal solution (least fixed point). The basic idea is to introduce a notion of quotation and dequotation. Quotation happens at communication (output appears higher-order, in that it has a process in subject position, but wha= t is sent is the code or quote of the process). Likewise, dequotation is really only interesting at communction time, when it is bound by an input. (See the paper for the full story.) In the second paper, i show that the (spatial logic version of the) standar= d Hennessy-Milner construction pushes through -- but with a pleasant surprise= . In addition to formulae describing sets of processes, we find formulae describing sets of names. You get a whole logic of namespaces. One way to look at it is this: the algebraic operations on names inherited from the process algebraic combinators give you a pointer arithmetic. Fortunately, the programmer of such a system is also equipped with a logic that gives very potent means of reasoning about this pointer arithmetic. (Again, see the paper for the full story.) The reflection doesn't just stop at structural reflection. You can provide = a reflective comm rule in which even synchronization -- which is normally given via name-equality -- is determined by an upper-level reduction of the processes whose codes are the names being used to synchronize. Amazingly, this can be shown to be well-founded. As a final point of interest, the first paper presents an encoding of the \pi-calculus into the reflective setting, demonstrating that both replication and the new-operator are syntactic sugar. There is a process algebraic form of the Y-combinator in the reflective setting that gives you replication. My co-author and i came up with two different encodings of the new-operator. His was 'centralized' but more elegant; mine was distributed, but with more machinery to make it work. But, i also found a 3rd encoding i= n which the well-founded recursion of quotation is replaced by non-well-founded forms. In this case, you obtain an interpretation of new that is strongly analogous to Galois extensions of a field. Best wishes, --greg On 6/6/07, caml-list-request@yquem.inria.fr < caml-list-request@yquem.inria.fr> wrote: > > Send Caml-list mailing list submissions to > caml-list@yquem.inria.fr > > To subscribe or unsubscribe via the World Wide Web, visit > http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list > or, via email, send a message with subject or body 'help' to > caml-list-request@yquem.inria.fr > > You can reach the person managing the list at > caml-list-owner@yquem.inria.fr > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of Caml-list digest..." > > Today's Topics: > > 1. Re: JoCaml Released. (Oliver Bandel) > 2. Call for papers - IFL 2007 (Michel Mauny) > 3. Re: re: We should all be forking (Oliver Bandel) > 4. Re: JoCaml Released. (Oliver Bandel) > 5. Re: JoCaml Released. (Jon Harrop) > > > ---------- Forwarded message ---------- > From: Oliver Bandel > To: caml-list@inria.fr > Date: Wed, 6 Jun 2007 11:00:38 +0200 > Subject: Re: [Caml-list] JoCaml Released. > On Wed, Jun 06, 2007 at 10:18:15AM +0200, Oliver Bandel wrote: > > On Mon, Jun 04, 2007 at 10:13:55AM -0400, Joshua D. Guttman wrote: > > > Oliver Bandel writes: > > > > > > > > > > > > > > > As far as I know only polycontextural logic can express > > > > parallel, distributed systems (and selfreference) in a > > > > complete/total way. So, when join calculus is > > > > monocontextural (which it is, if it uses the math we all > > > > have learned) it will be a subsystem of what can be > > > > expressed with polycontextural logic. > > > > > > > > > > Well, I googled and found the Wikipedia article on Gotthard > > > Guenther, which talked about trans-Aristotelian logic and > > > the law of the excluded middle (shades of Korzybski! Were > > > they connected?). > > > > > > But there was no indication what > > > monocontextural/polycontextural meant, or why only the > > > latter expresses distribution *completely*. > > > > > > Could you give a brief summary, please? > > [...] > > > > I answered to your private maila ddress twice. > > ...well oooh, I didn't saw you also wrote to this list. > > > > > > I will collect both mails and send it to the list today. > > > > > ...is it interests other people... > > Ciao, > Oliver > > > > > ---------- Forwarded message ---------- > From: Michel Mauny > To: caml-list@inria.fr > Date: Wed, 06 Jun 2007 11:04:12 +0200 > Subject: [Caml-list] Call for papers - IFL 2007 > ********************************************************************** > > Announcement and Call for Papers for the > > 19th International Symposium on > Implementation and Application of Functional Languages > IFL 2007 > > 27th-29th September 2007, Freiburg, Germany > co-located with ICFP 2007 > > http://proglang.informatik.uni-freiburg.de/IFL2007/ > > ********************************************************************** > > The aim of the IFL symposium is to bring together researchers actively > engaged in the implementation and application of functional and > function-based programming languages. The symposium provides an open > forum for researchers who wish to present and discuss new ideas and > concepts, work in progress, preliminary results, etc. related > primarily but not exclusively to the implementation and application of > functional languages. > > Topics of interest include (but are not limited to): > > * language concepts > * type checking > * compilation techniques > * (abstract) interpretation > * generic programming techniques > * automatic program generation > * array processing > * concurrent/parallel programming > * concurrent/parallel program execution > * heap management > * runtime profiling > * performance measurements > * debugging and tracing > * (abstract) machine architectures > * verification > * formal aspects > * tools and programming techniques > > Papers on applications or tools demonstrating the suitability of novel > ideas in any of the above areas and contributions on related > theoretical work are also welcome. The change of the symposium name > adding the term "application", introduced in 2004, reflects the > broader scope IFL has gained over the years. > > > Contributions > > Prospective authors are encouraged to submit papers to be published in > the draft proceedings and present them at the symposium. All > contributions must be written in English, conform to the > Springer-Verlag LNCS series format and not exceed 16 pages. The draft > proceedings will appear as a technical report. > > Every attendee of IFL 2007 will have the opportunity to submit a > revised version of their paper for post-symposium reviewing. As in > previous years, selected papers will be published by Springer Verlag > in the Lecture Notes in Computer Science (LNCS) Series. > > > Important Dates > > Submission for Draft Proceedings 31 August 2007 > Early Registration Deadline 1 September 2007 > Symposium 27-29 September 2007 > Submission for post-refereeing 2 November 2007 > Notification of acceptance / rejection 14 December 2007 > Submission of camera-ready version 25 January 2008 > > > Programme Committee > > Peter Achten Radboud University Nijmegen, The Netherlands > Kenichi Asai Ochanomizu University, Japan > Manuel Chakravarty The University of New South Wales, Australia > Olaf Chitil (chair) University of Kent, UK > Martin Erwig Oregon State University, Oregon, USA > Marc Feeley Universit=E9 de Montr=E9al, Canada > Martin Gasbichler Z=FChlke Engineering AG, Switzerland > Kevin Hammond University of St. Andrews, Scotland > Zolt=E1n Horv=E1th E=F6tv=F6s Lor=E1nd University, Budapest, Hun= gary > John Hughes Chalmers University of Technology, Sweden > Ken Friis Larsen University of Copenhagen, Denmark > Rita Loogen Philipps-Universit=E4t Marburg, Germany > Michel Mauny ENSTA, France > Sven-Bodo Scholz University of Hertfordshire, UK > Clara Segura Universidad Complutense de Madrid, Spain > Tim Sheard Portland State University, Oregon, USA > Glenn Strong Trinity College, Dublin, Ireland > Doaitse Swierstra Utrecht University, The Netherlands > Malcolm Wallace The University of York, UK > > > Local Organisation > > Markus Degen Universit=E4t Freiburg, Germany > Peter Thiemann Universit=E4t Freiburg, Germany > Stefan Wehr Universit=E4t Freiburg, Germany > > > Further Information > > http://proglang.informatik.uni-freiburg.de/IFL2007/ > > > -- > Michel Mauny > > ENSTA > (+33) 1 4552 5388 (ENSTA) > (+33) 1 3963 5796 (INRIA) > > > > > ---------- Forwarded message ---------- > From: Oliver Bandel > To: caml-list@inria.fr > Date: Wed, 6 Jun 2007 11:28:40 +0200 > Subject: Re: [Caml-list] re: We should all be forking > On Tue, Jun 05, 2007 at 03:30:47PM -0700, Christopher Cramer wrote: > > Jon Harrop: > > > I believe the performance relies upon the Linux kernel lazily copying > > > the process. Does OSX also do that? > > > > It's called copy-on-write and I would be surprised if OSX didn't also > > do it. > > > > The only way to start a new process is to fork, so even if you're just > > running another program you fork first, and then replace the process > > image with the new program with exec. If the fork had to copy the entir= e > > process image before just throwing it away upon exec, I think Unix, > > which is based around a philosophy of piping between multiple processes= , > > would have abandoned fork a long time ago. Then again, there is vfork, > > so I guess they almost did abandon it at one point. > > > [...] > > vfork is only (!!!) for a fork-exec combination. > > So, be aware: do not use vfork, if you don't exec right after it! > > > Ciao, > Oliver > > > > > ---------- Forwarded message ---------- > From: Oliver Bandel > To: caml-list@inria.fr > Date: Wed, 6 Jun 2007 11:31:25 +0200 > Subject: Re: [Caml-list] JoCaml Released. > On Wed, Jun 06, 2007 at 11:22:42AM +0200, Francisco Jos? Valverde Albacet= e > wrote: > > Come on! This is an open forum to learn... You just don't put in an ide= a > > only *not to explain it*. > > Well, why is the default of this list, that Replies go to private mail > account?! > And I got only one person sending an interested reply.... > > > > > Please explain what your suggestion was. > > OK. > > I will try my best.... it follows today. > > Ciao, > Oliver > > > > > ---------- Forwarded message ---------- > From: Jon Harrop > To: caml-list@inria.fr > Date: Wed, 6 Jun 2007 10:40:57 +0100 > Subject: Re: [Caml-list] JoCaml Released. > On Wednesday 06 June 2007 10:00:38 Oliver Bandel wrote: > > ...I will collect both mails and send it to the list today... > > On Wednesday 06 June 2007 10:00:38 Oliver Bandel wrote: > > ...is it interests other people... > > On Wednesday 06 June 2007 10:31:25 Oliver Bandel wrote: > > ...I will try my best.... it follows today... > > The suspense is killing. ;-) > > -- > Dr Jon D Harrop, Flying Frog Consultancy Ltd. > OCaml for Scientists > http://www.ffconsultancy.com/products/ocaml_for_scientists/?e > > > > _______________________________________________ > 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 > > --=20 L.G. Meredith Managing Partner Biosimilarity LLC 505 N 72nd St Seattle, WA 98103 +1 206.650.3740 http://biosimilarity.blogspot.com ------=_Part_45538_9817981.1181154479463 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Content-Disposition: inline Oliver,

Many thanks for the links to polycontextural logics. My feel= ing is it will take me quite some investment to get a feeling for the frame= work. In the meantime, there are fairly simple accounts of concurrency with= reflection offering natural logics (without apparent liar's paradox is= sues, as i understand them).=20

At ETAPS 05 i presented two papers on such systems. You can find pr= eprints here (http://svn.biosimilar= ity.com/src/open/papers/trunk/concurrency/rho/ex_nihilo_entcs/ex_nihilo_fin= co.pdf ; http://svn.biosimilarity.com/src/o= pen/papers/trunk/concurrency/rho/tgc%20lncs/ex_nihilo_logic.pdf).

i did a quick and dirty OCaml implementation (as a way to learn OCaml),= which you can find here (http://svn.biosimilarity.com/src/open/mirroro= rrim/rho/trunk/ocaml/ ).

The approach i took was based on my dissatisfaction with the = fact that the \pi-calculus was dependent on a theory of names; and, names h= ad to have an effective theory of equality (thus, sneaking in a notion of c= omputation -- which the \pi-calculus was supposedly providing the foundatio= ns of). If you formulate the situation as: given a set (resp. theory) of na= mes, X, the \pi-calculus generates a set (resp. theory) of processes \Pi(X)= , then you can ask if the following domain equation has a solution
  • X =3D \Pi(X)
It does (lots of them). In the first pape= r cited i presented a minimal solution (least fixed point). The basic idea = is to introduce a notion of quotation and dequotation. Quotation happens at= communication (output appears higher-order, in that it has a process in su= bject position, but what is sent is the code or quote of the process). Like= wise, dequotation is really only interesting at communction time, when it i= s bound by an input. (See the paper for the full story.)

In the second paper, i show that the (spatial logic version of the)= standard Hennessy-Milner construction pushes through -- but with a pleasan= t surprise. In addition to formulae describing sets of processes, we find f= ormulae describing sets of names. You get a whole logic of namespaces. One = way to look at it is this: the algebraic operations on names inherited from= the process algebraic combinators give you a pointer arithmetic. Fortunate= ly, the programmer of such a system is also equipped with a logic that give= s very potent means of reasoning about this pointer arithmetic. (Again, see= the paper for the full story.)

The reflection doesn't just stop at structural reflection. You = can provide a reflective comm rule in which even synchronization -- which i= s normally given via name-equality -- is determined by an upper-level reduc= tion of the processes whose codes are the names being used to synchronize. = Amazingly, this can be shown to be well-founded.

As a final point of interest, the first paper presents an encoding = of the \pi-calculus into the reflective setting, demonstrating that both re= plication and the new-operator are syntactic sugar. There is a process alge= braic form of the Y-combinator in the reflective setting that gives you rep= lication. My co-author and i came up with two different encodings of the ne= w-operator. His was 'centralized' but more elegant; mine was distri= buted, but with more machinery to make it work. But, i also found a 3rd enc= oding in which the well-founded recursion of quotation is replaced by non-w= ell-founded forms. In this case, you obtain an interpretation of new that i= s strongly analogous to Galois extensions of a field.

Best wishes,

--greg

= On 6/6/07, caml-list-request@yquem.inria.fr < caml-list-request@yquem.inria.fr> wrote:
Send Caml-list mailing list submission= s to
        caml-list@yquem.inria.fr

To subscribe or un= subscribe via the World Wide Web, visit
     &n= bsp;   http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
or, via ema= il, send a message with subject or body 'help' to
  &n= bsp;     caml-list-request@yquem.inria.fr

You can reach the person managing the list at
  &n= bsp;     caml-list-owner@yquem.inria.fr

When replying, please ed= it your Subject line so it is more specific
than "Re: Contents of Caml-list digest..."

Today's= Topics:

   1. Re: JoCaml Released. (Oliver Bandel)
&nb= sp;  2. Call for papers - IFL 2007 (Michel Mauny)
   3. R= e: re: We should all be forking (Oliver Bandel)
   4. Re: JoCaml Released. (Oliver Bandel)
   5.= Re: JoCaml Released. (Jon Harrop)


---------- Forwarded message = ----------
From: Oliver Bandel <oliver@first.in-berlin.de >
To: caml-list@inria.fr
Date: Wed, 6 Jun 2007 11:00:38 +0200
Subject: Re: [Caml-list] JoCam= l Released.
On Wed, Jun 06, 2007 at 10:18:15AM +0200, Oliver Bandel wrot= e:
> On Mon, Jun 04, 2007 at 10:13:55AM -0400, Joshua D. Guttman wrote:=
> > Oliver Bandel <oliver@first.in-berlin.de> writes:
> >
> > >
> > >
> > >   As far as I know only poly= contextural logic can express
> > >   parallel, distr= ibuted systems (and selfreference) in a
> > >   compl= ete/total way.  So, when join calculus is
> > >   monocontextural (which it is, if it uses the= math we all
> > >   have learned) it will be a subsy= stem of what can be
> > >   expressed with polycontex= tural logic.
> > >
> >
> > Well, I googled and found the Wikipedia article = on Gotthard
> > Guenther, which talked about trans-Aristotelian lo= gic and
> > the law of the excluded middle (shades of Korzybski!&n= bsp; Were
> > they connected?).
> >
> > But there was no = indication what
> > monocontextural/polycontextural meant, or why = only the
> > latter expresses distribution *completely*.
> &= gt;
> > Could you give a brief summary, please?
> [...]
>=
> I answered to your private maila ddress twice.
> ...well ooo= h, I didn't saw you also wrote to this list.
>
>
> I = will collect both mails and send it to the list today.
>


...is it interests other people...

Ciao,
&nbs= p;  Oliver




---------- Forwarded message ----------<= br>From: Michel Mauny <Michel.M= auny@inria.fr >
To: caml-list@inria.fr
Date: Wed, 06 Jun 2007 11:04:12 +0200
Subject: [Caml-list] Call for= papers - IFL 2007
*****************************************************= *****************

           &= nbsp;  Announcement and Call for Papers for the

 &nbs= p;            &= nbsp;   19th International Symposium on
   = ;      Implementation and Application of Functiona= l Languages
          =             &nb= sp;       IFL 2007

           &= nbsp;27th-29th September 2007, Freiburg, Germany
    = ;            &n= bsp;    co-located with ICFP 2007

   &= nbsp;    http://proglang.informatik.uni-freiburg.de/IFL2007/

***************************************************************= *******

The aim of the IFL symposium is to bring together researcher= s actively
engaged in the implementation and application of functional a= nd
function-based programming languages. The symposium provides an openforum for researchers who wish to present and discuss new ideas and
con= cepts, work in progress, preliminary results, etc. related
primarily but= not exclusively to the implementation and application of
functional languages.

Topics of interest include (but are not li= mited to):

   * language concepts
   * type c= hecking
   * compilation techniques
   * (abstrac= t) interpretation
   * generic programming techniques
   * automatic program generation
   * array pro= cessing
   * concurrent/parallel programming
   *= concurrent/parallel program execution
   * heap management   * runtime profiling
   * performance measurement= s
   * debugging and tracing
   * (abstract) machi= ne architectures
   * verification
   * formal as= pects
   * tools and programming techniques

Papers on a= pplications or tools demonstrating the suitability of novel
ideas in any of the above areas and contributions on related
theoret= ical work are also welcome. The change of the symposium name
adding the = term "application", introduced in 2004, reflects the
broader s= cope IFL has gained over the years.


Contributions

Prospective authors are encouraged to subm= it papers to be published in
the draft proceedings and present them at t= he symposium. All
contributions must be written in English, conform to t= he
Springer-Verlag LNCS series format and not exceed 16 pages. The draftproceedings will appear as a technical report.

Every attendee of I= FL 2007 will have the opportunity to submit a
revised version of their p= aper for post-symposium reviewing. As in
previous years, selected papers will be published by Springer Verlagin the Lecture Notes in Computer Science (LNCS) Series.


Importa= nt Dates

Submission for Draft Proceedings    &nb= sp;      31 August 2007
Early Registration Deadline       &n= bsp;         1 September 2007
Sy= mposium           &n= bsp;            = ;       27-29 September 2007
Submission fo= r post-refereeing         &nbs= p;    2 November 2007
Notification of acceptance / r= ejection     14 December 2007
Submission of camera-ready version      &= nbsp;  25 January 2008


Programme Committee

Peter Ach= ten            = Radboud University Nijmegen, The Netherlands
Kenichi Asai  &nb= sp;         Ochanomizu Univers= ity, Japan
Manuel Chakravarty      The University of= New South Wales, Australia
Olaf Chitil (chair)     = University of Kent, UK
Martin Erwig      &= nbsp;     Oregon State University, Oregon, USA
= Marc Feeley          &nbs= p;  Universit=E9 de Montr=E9al, Canada
Martin Gasbichler       Z=FChlke Engineer= ing AG, Switzerland
Kevin Hammond      &nb= sp;    University of St. Andrews, Scotland
Zolt=E1n Horv= =E1th          E=F6tv=F6s= Lor=E1nd University, Budapest, Hungary
John Hughes   &nb= sp;         Chalmers University of = Technology, Sweden
Ken Friis Larsen        Univers= ity of Copenhagen, Denmark
Rita Loogen     &nbs= p;       Philipps-Universit=E4t Marburg, Germ= any
Michel Mauny         &n= bsp;  ENSTA, France
Sven-Bodo Scholz    &n= bsp;   University of Hertfordshire, UK
Clara Segura          = ;  Universidad Complutense de Madrid, Spain
Tim Sheard &n= bsp;            = ;Portland State University, Oregon, USA
Glenn Strong   &n= bsp;        Trinity College, Dublin= , Ireland
Doaitse Swierstra       Utrecht = University, The Netherlands
Malcolm Wallace         The Uni= versity of York, UK


Local Organisation

Markus Degen =            Universit= =E4t Freiburg, Germany
Peter Thiemann      = ;    Universit=E4t Freiburg, Germany
Stefan Wehr&nbs= p;            Univer= sit=E4t Freiburg, Germany


Further Information

http://proglang.informatik.uni-freiburg.de/IFL2= 007/


--
Michel Mauny

ENSTA
(+33) 1 4552 5388 (E= NSTA)
(+33) 1 3963 5796 (INRIA)




---------- Forwarded messa= ge ----------
From: Oliver Bandel <oliver@first.in-berlin.de>
To: caml-list@inria.fr
Date: Wed, 6 Jun 2007 11:28:40 +0200
Subject: = Re: [Caml-list] re: We should all be forking
On Tue, Jun 05, 2007 at 03:= 30:47PM -0700, Christopher Cramer wrote:
> Jon Harrop:
> > I= believe the performance relies upon the Linux kernel lazily copying
> > the process. Does OSX also do that?
>
> It's = called copy-on-write and I would be surprised if OSX didn't also
>= ; do it.
>
> The only way to start a new process is to fork, so= even if you're just
> running another program you fork first, and then replace the proce= ss
> image with the new program with exec. If the fork had to copy th= e entire
> process image before just throwing it away upon exec, I th= ink Unix,
> which is based around a philosophy of piping between multiple proc= esses,
> would have abandoned fork a long time ago. Then again, there= is vfork,
> so I guess they almost did abandon it at one point.
>
[...]

vfork is only (!!!) for a fork-exec combination.
So, be aware: do not use vfork, if you don't exec right after it!
=

Ciao,
   Oliver




---------- Forwarde= d message ----------
From: Oliver Bandel <ol= iver@first.in-berlin.de>
To: caml-list@inria.fr
Date: Wed, 6 Jun 2007 11:31:25 +0200
Subject= : Re: [Caml-list] JoCaml Released.
On Wed, Jun 06, 2007 at 11:22:42AM +0200, Francisco Jos? Valverde Albac= ete wrote:
> Come on! This is an open forum to learn... You just don&= #39;t put in an idea
> only *not to explain it*.

Well, why is = the default of this list, that Replies go to private mail account?!
And I got only one person sending an interested reply....

>> Please explain what your suggestion was.

OK.

I will tr= y my best.... it follows today.

Ciao,
   Oliver

=


---------- Forwarded message ----------
From: Jon Harrop <jon@ffconsultancy.com>
To: caml-list@inria.fr
Date: Wed, 6 Ju= n 2007 10:40:57 +0100
Subject: Re: [Caml-list] JoCaml Released.
On Wednesday 06 June 2007 = 10:00:38 Oliver Bandel wrote:
> ...I will collect both mails and send= it to the list today...

On Wednesday 06 June 2007 10:00:38 Oliver B= andel wrote:
> ...is it interests other people...

On Wednesday 06 June 200= 7 10:31:25 Oliver Bandel wrote:
> ...I will try my best.... it follow= s today...

The suspense is killing. ;-)

--
Dr Jon D Harrop= , Flying Frog Consultancy Ltd.
OCaml for Scientists
http://www.ffconsultancy.com/products/ocaml_for_= scientists/?e



__________________________________________= _____
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_beginne= rs
Bug reports: http:= //caml.inria.fr/bin/caml-bugs




--
L.G. Meredi= th
Managing Partner
Biosimilarity LLC
505 N 72nd St
Seattle, WA= 98103

+1 206.650.3740

http://biosimilarity.blogspot.com ------=_Part_45538_9817981.1181154479463--