Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Janus (concurrent constraint programming language)
open-in-new
<p>Janus is a <a href="/facts/Computer_programming_language/cWTYbgWa">computer programming language</a> partially described by K. Kahn and Vijay A. Saraswat in the paper "Actors as a special case of concurrent constraint (logic) programming" in 1990. It is a <a href="/facts/Concurrent_constraint_logic_programming/txgnB9Br">concurrent constraint</a> language without backtracking. </p><p>Janus models concurrency through the use of <i>bag channels</i>. Code that needs to send a message to a process does so by constraining a bag to be the union of another bag and the singleton bag of the message. The other bag is then available to be constrained for sending subsequent messages. </p><p>The process receives the message by matching the bag to a pattern that says it is the union of some singleton and some other bag. The logic of the bag channels produces a property shared by the <a href="/facts/Actor_model/MJ49opnU">actor model</a>, namely that the order of arrival of the messages is not guaranteed. However, unlike actors in the actor model, processes in Janus can pass around their "mailboxes" so to speak, in the form of bags, and can hold more than one. This ability to pass mailboxes around and hold more than one is inherited in computer programming language <a href="/facts/ToonTalk_computer_programming_language/9WdBzbLd">ToonTalk</a>, which is influenced by Janus. </p><p>Janus, the programming language, is named after <a href="/facts/Janus_(mythology)/KRUwyb9m">Janus</a>, the two-faced Roman god, because every logical variable in Janus has as its two "faces", two aspects that can be passed as arguments. These are called the <i>asker</i> and the <i>teller</i>. These represent, respectively, the right to ask the value of the variable (or some characteristic of the value) and the right to tell the value (or to tell some constraint on what the value can be). The asker and teller aspects can be passed around as arguments independently of each other. Neither right implies the other right. The syntax of the language prevents copying a teller or exercising it more than once. Logical contradiction is statically prevented, according to Kahn and Saraswat. </p> <ul><li>VA Saraswat, KM Kahn, J Levy (1990). "Janus: A step towards distributed constraint programming." NACLP.</li> <li>VA Saraswat, M Rinard, P Panangaden (1991). "The semantic foundations of concurrent constraint programming." POPL.</li> <li>David Gudeman, Koenraad De Bosschere, Saumya K. Debray (1992). "jc: An Efficient and Portable Sequential Implementation of Janus". Proc. Joint International Conference and Symposium on Logic Programming.</li></ul>