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.
M. Bilal, и S. Kang. International Journal of Communication Systems, 30 (5):
e3309(2017)cite arxiv:1702.04055Comment: This article is accepted for the publication in "International Journal of Communication Systems".
S. Fowler, S. Lindley, и P. Wadler. 31st European Conference on Object-Oriented Programming (ECOOP 2017), том 74 из Leibniz International Proceedings in Informatics (LIPIcs), стр. 11:1--11:28. Dagstuhl, Germany, Schloss Dagstuhl--Leibniz-Zentrum für Informatik, (2017)
M. Bilal, и S. Kang. (2017)cite arxiv:1702.04055Comment: This article is accepted for the publication in "International Journal of Communication Systems".
C. Ritson, и J. Simpson. Communicating Process Architectures 2008, том 66 из Concurrent Systems Engineering Series, стр. 293--307. Amsterdam, The Netherlands, IOS Press, (сентября 2008)
T. Mossakowski, M. Roggenbach, и L. Schröder. Coalgebraic Methods in Computer Science, том 82 из Electronic Notes in Theoretical Computer Science, Elsevier Science; http://www.elsevier.nl/, (2003)