This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dcthttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n4https://global.dbpedia.org/id/
schemahttp://schema.org/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Janus_(concurrent_constraint_programming_language)
rdf:type
wikidata:Q9143 wikidata:Q315 owl:Thing dbo:Language schema:Language dbo:ProgrammingLanguage
rdfs:label
Janus (concurrent constraint programming language)
rdfs:comment
Janus is a computer programming language 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 concurrent constraint language without backtracking. Janus models concurrency through the use of bag channels. 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.
foaf:name
Janus
dbp:name
Janus
foaf:isPrimaryTopicOf
wikipedia-en:Janus_(concurrent_constraint_programming_language)
dct:subject
dbc:Concurrent_programming_languages dbc:Logic_programming_languages dbc:Constraint_programming_languages
dbo:wikiPageID
50304023
dbo:wikiPageRevisionID
933242889
dbo:wikiPageWikiLink
dbc:Concurrent_programming_languages dbr:Janus dbr:Actor_model dbr:ToonTalk dbr:Ken_Kahn dbc:Logic_programming_languages dbc:Constraint_programming_languages dbr:Vijay_A._Saraswat dbr:Concurrent_constraint_logic_programming
owl:sameAs
n4:4o4Zg wikidata:Q6155940
dbp:wikiPageUsesTemplate
dbt:Reflist dbt:Infobox_programming_language
dbp:designer
Ken Kahn and Vijay A. Saraswat
dbp:implementations
dbp:paradigm
dbr:Concurrent_constraint_logic_programming
dbp:year
1990
dbo:abstract
Janus is a computer programming language 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 concurrent constraint language without backtracking. Janus models concurrency through the use of bag channels. 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. 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 actor model, 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 ofbags, and can hold more than one. This ability to pass mailboxes around and hold more than one is inherited in computer programming language ToonTalk, which is influenced by Janus. Janus, the programming language, is named after Janus, 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 asker and the teller. 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.
dbp:turingComplete
Yes
dbo:designer
dbr:Vijay_A._Saraswat dbr:Ken_Kahn
prov:wasDerivedFrom
wikipedia-en:Janus_(concurrent_constraint_programming_language)?oldid=933242889&ns=0
dbo:wikiPageLength
3661