On 2/13/12 12:58 PM, David Nolen wrote:
Clojure is another Lisp that puts Objects at the bottom. Depending on
how its implemented I don't think it needs to be complex - for example
ClojureScript is hosted on JavaScript (which brings it's own Objects)
and the ClojureScript compiler is only
We would have to define what you mean by the term computation.
Computation is a way to transform a language syntactically by defined
rules.
The lambda calculus is a fundamental way of performing such
transformation via reduction rules (the alpha, beta, gamma rules).
In the end the beta-reduction
Simplicity, like productivity, is an engineering metric that can only be
measured in the context of a particular application. Most successful
programming languages aren't mathematically pure but some make it easier
than others to use functional idioms (by which I mean some mechanism to
emulate the
There's always
http://en.wikipedia.org/wiki/Actor_model
and
http://www.dalnefre.com/wp/humus/
...which seem to make concurrency less of a PITA. Like most languages that
crystalize a particular style, though, there's some learning involved for
folks (like me!) who hadn't really thought about
On 2/12/12 11:15 AM, Steve Wart wrote:
Can the distributed computation model you describe be formalized as a
set of rewrite rules, or is the black box model really about a
protocol for message dispatch? Attempts to build distributed messaging
systems haven't been particularly simple. In fact I
Am 12.02.2012 20:01, schrieb Kurt Stephens:
Many languages do not reify the message itself as an object.
I have been musing lately how the Linda model (tuple spaces) could be helpful.
Tuples can be understood as messages sent to an anonymous receiver (whoever
does a get with a matching
Droid Charge on Verizon 4GLTE
--Original Message--
From: Kurt Stephens k...@kurtstephens.com
To: Fundamentals of New Computing fonc@vpri.org
Date: Saturday, February 11, 2012 7:23:01 PM GMT-0600
Subject: [fonc] COLAs or CLOAs? : are lambda systems fundamentally simpler than
object systems
On 2/12/12 1:19 PM, Hans-Martin Mosner wrote:
Am 12.02.2012 20:01, schrieb Kurt Stephens:
Many languages do not reify the message itself as an object.
I have been musing lately how the Linda model (tuple spaces) could be helpful.
We've been using tuple spaces at my current job for 5+ years.
Sent from my Droid Charge on Verizon 4GLTE
--Original Message--
From: Hans-Martin Mosner h...@heeg.de
To: Fundamentals of New Computing fonc@vpri.org
Date: Sunday, February 12, 2012 8:19:37 PM GMT+0100
Subject: Re: [fonc] COLAs or CLOAs? : are lambda systems fundamentally simpler
than
On 13/02/2012, at 6:01 AM, Kurt Stephens wrote:
On 2/12/12 11:15 AM, Steve Wart wrote:
Can the distributed computation model you describe be formalized as a
set of rewrite rules, or is the black box model really about a
protocol for message dispatch? Attempts to build distributed messaging
On 2/12/12 4:11 PM, Julian Leviston wrote:
On 13/02/2012, at 6:01 AM, Kurt Stephens wrote:
If send(sel, rcvr, args) can decomposed into apply(lookup(sel, rcvr, args),
rcvr, args), then this follows:
Message.new(sel, rcvr, args).lookup().apply()
...
I don't follow why a message isn't
Hiya,
On 13/02/2012, at 2:47 PM, Kurt Stephens wrote:
Read Ian Piumarta's Open, extensible object models (
http://piumarta.com/software/cola/objmodel2.pdf ).
At a certain level, send(), lookup() and apply() have bootstrap
implementations to break the infinite regress. TORT was directly
12 matches
Mail list logo
