caml-list - the Caml user's mailing list
 help / color / mirror / Atom feed
From: Andreas Rossberg <rossberg@ps.uni-sb.de>
To: caml-list@inria.fr
Subject: Re: [Caml-list] ocaml-3.05: a performance experience
Date: Tue, 06 Aug 2002 14:56:50 +0200	[thread overview]
Message-ID: <3D4FC792.708E92E@ps.uni-sb.de> (raw)
In-Reply-To: <20020806111007.52002.qmail@web11207.mail.yahoo.com>

Noel Welsh wrote:
> 
> > > I'm intrigued by the relationship between these
> > two parsers.
> 
> I wonder if this is related to the difference between
> lazy and strict evaluation.

It is related to implicit data-flow synchronisation via futures (of
which lazy futures are one instance). See:

@article{Halstead:Multilisp,
  author = "Robert Halstead",
  title = "Multilisp: A Language For Concurrent Symbolic Computation",
  journal = "{ACM} Transactions on Programming Languages and Systems",
  volume = 7,
  number = 4,
  pages = "501--538",
  year = 1985,
  month = oct,
}

@inproceedings{Flanagan+Felleisen:SemanticsOfFuture,
    author = "Cormac Flanagan and Matthias Felleisen",
    title = "The Semantics of Future and Its Use in Program
Optimizations",
    booktitle = "22nd {ACM} {SIGPLAN}-{SIGACT} Symposium on Principles
of Programming Languages (POPL'95)",
    address = "San Francisco, California",
    pages = "209--220",
    year = "1995",
    url = "citeseer.nj.nec.com/flanagan95semantics.html"
}

[I believe there is also a more recent journal version of this paper.]

@misc{Niehren+Schwinghammer+Smolka:Futures,
  author = {Joachim Niehren and Jan Schwinghammer and Gert Smolka},
  title = {Concurrent Computation in a Lambda Calculus with Futures},
  institute = {Programming Systems Lab, Universit\"at des Saarlandes},
  year = {2002},
  month = jun,
  note = {Submitted},
  url = "http://www.ps.uni-sb.de/Papers/abstracts/lambdafut.html",
}

-- 
Andreas Rossberg, rossberg@ps.uni-sb.de

"Computer games don't affect kids; I mean if Pac Man affected us
 as kids, we would all be running around in darkened rooms, munching
 magic pills, and listening to repetitive electronic music."
 - Kristian Wilson, Nintendo Inc.
-------------------
To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr
Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/
Beginner's list: http://groups.yahoo.com/group/ocaml_beginners


  reply	other threads:[~2002-08-06 12:48 UTC|newest]

Thread overview: 13+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2002-08-02  3:33 Alexander V. Voinov
2002-08-03 12:33 ` Gerd Stolpmann
2002-08-03 17:27   ` [Caml-list] OCAMLRUNPARAM=b David Fox
2002-08-04  2:50   ` [Caml-list] ocaml-3.05: a performance experience Alexander V. Voinov
2002-08-04 20:45     ` Gerd Stolpmann
2002-08-05 15:18       ` John Max Skaller
2002-08-05 16:24         ` Mike Lin
2002-08-05 16:53           ` Alexander V.Voinov
2002-08-06  3:22           ` John Max Skaller
2002-08-06 13:24             ` Mike Lin
2002-08-06 11:10           ` Noel Welsh
2002-08-06 12:56             ` Andreas Rossberg [this message]
2002-08-04 18:06 Damien Doligez

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=3D4FC792.708E92E@ps.uni-sb.de \
    --to=rossberg@ps.uni-sb.de \
    --cc=caml-list@inria.fr \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html

* If your mail client supports setting the In-Reply-To header
  via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).