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 evaluation/execution has been an ongoing theme. Pattern matching as part of the resolution of equations is one of my favorites. Single-assignment data-flow variables played an important role in automatic resolution of data dependencies. The lambda-abstraction mechanism is applied universally to support parameterization of not only expressions, but statement blocks too. I hope this series can serve as an interesting and informative reference. ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org |
Thanks, Dale. I have been enjoying these!
Owen and I have a backburner project where we'd like to employ the Actor model in a distributed Javascript system using nodeJS on servers communicating via websockets to the browswers. Have you seen anything like this done already? As a proof-of-concept, we plan to try a large-scale traffic model distributed over 10 or 20 nodes and see how it performs. -S _____________________________________________________________ [hidden email] (m) 505-216-6226 (o) 505-995-0206 sfcomplex.org | simtable.com | ambientpixel.com | redfish.com On Dec 6, 2010, at 5:21 PM, Dale Schumacher wrote: > 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 > evaluation/execution has been an ongoing theme. Pattern matching as > part of the resolution of equations is one of my favorites. > Single-assignment data-flow variables played an important role in > automatic resolution of data dependencies. The lambda-abstraction > mechanism is applied universally to support parameterization of not > only expressions, but statement blocks too. I hope this series can > serve as an interesting and informative reference. > > ============================================================ > FRIAM Applied Complexity Group listserv > Meets Fridays 9a-11:30 at cafe at St. John's College > lectures, archives, unsubscribe, maps at http://www.friam.org ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org |
Wow, that sounds super-awesome.
On Tue, Dec 7, 2010 at 10:40 PM, Stephen Guerin <[hidden email]> wrote: Thanks, Dale. I have been enjoying these! ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org |
Free forum by Nabble | Edit this page |