Dynamic Networks Everything I described so far is common to CSP (Communicating Sequential Processes) and the Actor model. Here’s what makes actors more general: Connections between actors are dynamic. Unlike processes in CSP, actors may establish communication channels dynamically. They may pass messages containing references to actors (or mailboxes). They can then send messages to those actors. Here’s a Scala example: receive { case (name: String, actor: Actor) => actor ! lookup(name) } The original message is a tuple combining a string and an actor object. The receiver sends the result of lookup(name) to the actor it has just learned about. Thus a new communication channel between the receiver and the unknown actor can be established at runtime. (In Kilim the same is possible by passing mailboxes via messages.)
Constraints - This journal provides a common forum for the many disciplines interested in constraint programming and constraint satisfaction and optimization, and the many application domains in which constraint technology is employ...
Strasheela is a highly expressive constraint-based music composition system.2 The Strasheela user declaratively states a music theory and the computer generates music which complies with this theory. A theory is formulated as a constraint satisfaction problem (CSP) by a set of rules (constraints) applied to a music representation in which some aspects are expressed by variables (unknowns). Music constraint programming is style-independent and is well-suited for highly complex theories (e.g. a fully-fledged theory of harmony). User-interface is the programming language Oz. The results can be output into various formats including MIDI, Csound, and Lilypond.
J. Swalens, S. Marr, J. De Koster, and T. Van Cutsem. Proceedings of the Workshop on Programming Language Approaches to Concurrency and communication-cEntric Software (PLACES), volume 155 of PLACES '14, page 54--60. (April 2014)
P. Welch, N. Brown, J. Moores, K. Chalmers, and B. Sputh. Communicating Process Architectures 2007CPA, volume 65 of Concurrent Systems Engineering Series, page 349--370. IOS Press, (2007)
R. Bakker, F. Dikker, F. Tempelman, and P. Wogmim. Proceedings of the 13th International Joint Conference on Artifical Intelligence, page 276--281. San Francisco, CA, USA, Morgan Kaufmann Publishers Inc., (1993)
D. Jannach. Intelligent Techniques and Tools for Novel System Architectures, volume 109 of Studies in Computational Intelligence, Springer, Berlin / Heidelberg, (2008)
B. O’Callaghan, B. O’Sullivan, and E. Freuder. Principles and Practice of Constraint Programming - CP 2005, volume 3709 of Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (2005)