Kind of like music starts at 9pm :-)
We're all anxious to see the results of your work. Thanks (in
advance) for sharing it.
On Fri, Jan 4, 2013 at 10:51 AM, Alan Kay alan.n...@yahoo.com wrote:
It turns out that the due date is actually a due interval that starts
Jan 1st and extends for a few
A discussion of logging, testing and reasoning to establish confidence
in actor-based systems.
http://www.dalnefre.com/wp/2012/07/debugging-actor-systems/
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
Do a little yak shaving with an actor-based approach to the Sleeping
Barber problem.
http://www.dalnefre.com/wp/2012/04/sleeping-barber-in-humus/
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
Exploring explicit Futures and using Object Capability Security to
control access
http://www.dalnefre.com/wp/2012/03/futures-and-capabilities/
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
On Mon, Feb 27, 2012 at 5:23 PM, Charles Perkins ch...@memetech.com wrote:
I think of the code size reduction like this:
A book of logarithm tables may be hundreds of pages in length and yet the
equation producing the numbers can fit on one line.
VPRI is exploring runnable math and is
actor behaviors as Iteratees, is
that something you've explored as well?
Cheers,
√
On Fri, Feb 17, 2012 at 5:29 AM, Dale Schumacher
dale.schumac...@gmail.com wrote:
When Steele and Sussman wanted to explore Actors, they built an
evaluator in LISP. Their work eventually resulted in Scheme
Thanks for disseminating the latest report. It is, as always, an
inspiration to see all the fine work being done. I can hardly wait to
play with the final system, and perhaps extend and build on it.
One of the first things I did was re-create (in Humus) the Fibonacci
Machine from the Nile
You might also find David Harel's article Can Programming Be
Liberated, Period?
(http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.3837)
interesting. He takes quite a different approach to specification
of system behavior, as well as programming in general.
On Sat, Jun 25, 2011 at 6:00 AM, BGB cr88...@gmail.com wrote:
... the more a language moves towards being
practical and useful, the more it will likely tend to resemble more
mainstream languages. which I suspect more work through a sort of long-term
distilation/refinement process, where useful
On Mon, Jun 13, 2011 at 4:50 AM, BGB cr88...@gmail.com wrote:
however, unlike full image-based development, the app will generally
forget everything that was going on once it is exited and restarted.
I think this is one of the most annoying features of our current
computer systems. If I have
On Mon, Jun 13, 2011 at 2:21 PM, Casey Ransberger
casey.obrie...@gmail.com wrote:
Comments below.
On Jun 13, 2011, at 6:00 AM, Dale Schumacher dale.schumac...@gmail.com
wrote:
On Mon, Jun 13, 2011 at 4:50 AM, BGB cr88...@gmail.com wrote:
however, unlike full image-based development, the app
On Sun, Jun 5, 2011 at 8:13 PM, Casey Ransberger
casey.obrie...@gmail.com wrote:
On Jun 5, 2011, at 4:25 PM, Dale Schumacher dale.schumac...@gmail.com wrote:
If someone has, I would sure like to hear about it! There was the
Apiary machine, but I don't think that was ever physically built, only
On Sun, Jun 5, 2011 at 5:23 PM, Casey Ransberger
casey.obrie...@gmail.com wrote:
Has anyone taken the actor model down to the metal?
If someone has, I would sure like to hear about it! There was the
Apiary machine, but I don't think that was ever physically built, only
simulated.
This is a
Parsing Expression Grammars, part 4 (http://bit.ly/iVXPEJ) addresses
the issue of left-recursive grammars, often used for left-associative
arithmetic operators. Accumulating a value via iteration is proposed
as an appropriate solution for recursive-descent parsers like PEGs.
Parsing Expression Grammars, part 2 (http://bit.ly/gDrbmi) goes beyond
simple matching with semantic values, predicates and actions.
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
Parsing Expression Grammars, part 1 (http://bit.ly/gR9Xdu) describes
an actor-based PEG implementation that illustrates the use of multiple
continuations to manage flow control. It also shows several
examples of lazy-initialized executable specifications.
After many requests, I've finally built an online simulator/debugger
to let people experiment with Humus. I've just published a brief
tutorial Playing the Stooge with Humus (http://bit.ly/gYL4cm) to
showcase the new simulator environment. Here's your chance to try
some hands-on examples.
I just posted the final piece of the meta-circular Humus evaluator.
Evaluating Expressions, part 7 – Transactions and Exceptions
(http://bit.ly/fl6Z3O)
Throughout the series, I've had the opportunity to present a wide
variety of powerful language constructs. Of course, concurrent
Another way to define semantics is the kernel language approach
where the kernel language has a formal (possibly Operational)
semantics. Van Roy and Haridi used this in CTM [1] for Oz/Mozart.
My Humus language [2] is a sort of kernel language based on a pure
implementation of the Actor model.
Implementing language features using Actors has reached the point
where the actor primitives themselves can be described
meta-circularly.
http://bit.ly/9KfHLI
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
Pattern equations extend the use of pattern matching to the realm of
definitions. These are true equations which establish equality
relationships, sometimes in a conditional context. Unlike most
computer languages, these equations exhibit symmetric treatment of
both sides of the equation.
Conditional special forms implemented via pattern matching rather than
Boolean predicates and lambda abstractions defined in terms of pattern
matching (http://bit.ly/9VZtIH)
___
fonc mailing list
fonc@vpri.org
http://vpri.org/mailman/listinfo/fonc
Evaluating Expressions, part 1 – Core Lambda Calculus http://bit.ly/cImxrf
(http://www.dalnefre.com/wp/2010/08/evaluating-expressions-part-1-core-lambda-calculus/)
With only a handful of actor behaviors, this article shows how to
create a behavior-driven evaluator for pure lambda calculus
I've just published the second part of a two-part article exploring
what we mean when we say message-passing (http://bit.ly/9y0NkV).
Specifically, I illustrate implementations of Synchronous Rendezvous
[1] and Object-Oriented Method Invocation [2] in terms of asynchronous
actor messaging.
[1]
The example of implementing a queue (using a serializer) is definitely
part of a meta-circular definition of actor behavior. Serializers are
one of the critical mechanisms identified by Hewitt, et. al. long ago.
I believe that maintaining multiple virtual configurations of actors
provides
On Sun, Jun 20, 2010 at 12:44 AM, Saul Caganoff scagan...@gmail.com wrote:
It strikes me that the actor model is very closely related to a lot of the
principles I have used with MOM and I'm keen to get hands-on with an
actor-based programming language to try it out and explore the parallels.
, but does not excuse
hand-wavy explanations.
Looking forward to your future blogging!
Cheers,
Z-Bo
On Fri, Jun 18, 2010 at 10:58 PM, Dale Schumacher
dale.schumac...@gmail.com wrote:
Published:
Actors in Clojure — Why Not? (http://bit.ly/9ZUXaQ)
http://www.dalnefre.com/wp/2010/06/actors
Hi David,
I've actually read quite a bit of your actor-related material and I'm
aware of your criticisms. I respect the fact that your opinion has
grown out of experience, rather than just thought-experiments.
However, my own experimentation has led me to different conclusions.
To be clear, the
Published:
Actors in Clojure — Why Not? (http://bit.ly/9ZUXaQ)
http://www.dalnefre.com/wp/2010/06/actors-in-clojure-why-not/
This article provides a counterpoint to Rich Hickey's rationale for
not including actor-based concurrency in Clojure.
___
fonc
Published:
Solving “Same Fringe” with Stream Generators
http://www.dalnefre.com/wp/2010/06/solving-same-fringe-with-stream-generators
This article explores mutable and immutable streams on the way to
building a solution to the same-fringe problem based on incremental
fringe generation and
Groups of collaborating actors can be treated as a single actor with
the help of a serializer. My new article Composing Actors
(http://www.dalnefre.com/wp/2010/05/composing-actors/) describes a
generic transparent serializer for request-response services built
from actors. Code samples are
On Tue, May 11, 2010 at 3:16 AM, Michael FIG mich...@fig.org wrote:
Hi,
Dale Schumacher dale.schumac...@gmail.com writes:
I'll have to give some thought to the larger-scale blackboard
mechanism. It seems like it will take a few combined abstractions to
get there.
I have a relatively
:37 PM, Dale Schumacher
dale.schumac...@gmail.com wrote:
Hi Alan,
Thanks for the encouragement. After a little searching I found
Naming and Synchronization in a Decentralized Computer System, D. P.
Reed, 1978 [1]. Is that the paper you had in mind? It looks
interesting, but I haven't had
in object design and communication.
Cheers,
Alan
[1] http://www.iam.unibe.ch/~ducasse/FreeBooks/SmalltalkHistoryHOPL.pdf
From: Dale Schumacher dale.schumac...@gmail.com
To: Fundamentals of New Computing fonc@vpri.org
Cc: Tristan Slominski tristan.slomin
On Sun, May 9, 2010 at 8:39 PM, Steve Dekorte st...@dekorte.com wrote:
On Sun, May 9, 2010 at 6:38 PM, Dale Schumacher
Are the messages that a Humus actor sends internally (calling methods on
itself, etc) also asynchronous? And if so, does this mean that a given
instance will never need more
Adrian correctly pointed out that tagging is a time/space trade-off. I did
demonstrate that different processors did perform differently by varying
tagging schemes.
Yes, the current tagging scheme (with 0 as nil) seemed to perform best
in your benchmark. But will it make a difference for
36 matches
Mail list logo
