1585:
1038:
1580:{\displaystyle {\begin{array}{lrcll}{\text{(outeval)}}&M\,|\,\mathrm {outeval} (P).Q&\rightarrow &M\,|\,P\,|\,Q&\\{\text{(read)}}&M\,|\,\mathrm {rd} (t).P\,|\,t'&\rightarrow &M\,|\,P\sigma \,|\,t'&{\text{if exists }}\sigma {\text{ such that }}t\sigma =t'\\{\text{(input)}}&M\,|\,\mathrm {in} (t).P\,|\,t'&\rightarrow &M\,|\,P\sigma &{\text{if exists }}\sigma {\text{ such that }}t\sigma =t'\\{\text{(left choice)}}&M\,|\,P+Q&\rightarrow &M\,|\,P&\\{\text{(right choice)}}&M\,|\,P+Q&\rightarrow &M\,|\,Q&\\{\text{(recursion)}}&M\,|\,\mathbf {rec} X.P&\rightarrow &M\,|\,P\{\mathbf {rec} X.P/X\}&\\\end{array}}}
310:
in treating process coordination as a separate activity from computation, and it is more general in being able to subsume various levels of concurrency—uniprocessor, multi-threaded multiprocessor, or networked—under a single model. Its orthogonality allows processes computing in different
314:
Whereas message-passing models require tightly coupled processes sending messages to each other in some sequence or protocol, Linda processes are decoupled from other processes, communicating only through the tuplespace; a process need have no notion of other processes except for the kinds of tuples
326:
Researchers have proposed more primitives to support different types of communication and co-ordination between (open distributed) computer systems, and to solve particular problems arising from various uses of the model. Researchers have also experimented with various means of implementing the
846:
203:-based company founded by several Yale computer scientists (Gelernter occasionally consulted for them but did not work there). Interest in Linda dropped in the mid-1990s, only to make a comeback in the late 1990s with several corporations implementing Linda in
244:, an ordered sequence of typed data objects; specifically in Linda, a tuple is a sequence of up to 16 typed fields enclosed in parentheses". The tuple space is "logically shared by processes" which are referred to as workers that store and retrieve tuples.
1787:
C-Linda or TCP-Linda - the earliest commercial and a widespread implementation of virtual shared memory for supercomputers and clustered systems from
Scientific Computing Associates, founded by Martin Schultz.
319:(MPI) systems. While not without justification, these claims were largely refuted for an important class of problems. Detailed criticisms of the Linda model can also be found in Steven Ericsson-Zenith's book
661:
652:
568:
512:
1031:
311:
languages and platforms to interoperate using the same primitives. Its generality allows a multi-threaded Linda system to be distributed across multiple computers without change.
438:
392:
199:. There were even companies that specialized in creating specialized parallel computing applications based on Linda, the largest of which was Scientific Computing Associates, a
930:
1612:
996:
898:
458:
976:
2027:
327:
virtual shared memory for this model. Many of these researchers proposed larger modifications to the original Linda model, developing a family of systems known as
332:
950:
588:
315:
consumed or produced. Criticisms of Linda from the multiprocessing community tend to focus on the decreased speed of operations in Linda systems as compared to
2221:
1936:
252:
One of Linda's main advantages is that it's simple, with only six operations that workers perform on the tuples to access tuplespace:
2285:
1638:
841:{\displaystyle P,Q::=t\;|\;\mathrm {outeval} (P).Q\;|\;\mathrm {rd} (t).P\;|\;\mathrm {in} (t).P\;|\;P+Q\;|\;\mathbf {rec} X.P\;|\;X}
1741:
2264:
593:
2172:
27:
2035:
1642:
1996:
1907:
2115:
1768:
517:
265:: Takes out a tuple that matches a given pattern from the tuplespace (if there's no match, the operation is blocked)
165:
It was widely released in 1986, when
Gelernter, along with his Yale colleague Nicholas Carriero and Sudhir Ahuja at
271:: Copies a tuple that matches a given pattern from the tuplespace (if there's no match, the operation is blocked)
2290:
1664:
1755:
1673:
463:
1773:
2092:
1764:
1729:
1691:
413:
204:
101:
357:
1734:
1614:
from the tuple space whereas (read) only reads it. The resulting operational semantics is synchronous.
851:
159:
1915:
Conference: 2nd
International Workshop on Coordination and Adaptation Techniques for Software Entities
1877:
1682:
1005:
336:
316:
229:
2225:
2147:
1977:
Carriero, Nicholas; Gelernter, David (1985-01-01). "The S/Net's Linda kernel (Extended abstract)".
1738:
1634:
1623:
903:
460:
on tuples substituting variables for terms that yields a tuple. For example, given we have a tuple
354:
The Linda-calculus is a formalisation of the above model with the difference that in the following
130:
1849:
1043:
1824:
410:
We abstract the concrete representation of tuples. We just assume that we have a set of tuples
343:
200:
1750:
981:
873:
443:
1819:
955:
22:
2247:
Cridlig, Régis; Goubault, Eric (1993). "Semantics and analysis of linda-based languages".
8:
196:
2057:
Ahuja, Sudhir; Carriero, Nicholas; Gelernter, David (August 1986), "Linda and
Friends",
1592:
307:
2121:
2074:
2002:
1959:
1829:
999:
935:
573:
328:
154:
118:
54:
1793:- a Java-based tuplespace implementation that helped popularize distributed computing.
176:
By the early 1990s, Linda was widely used by corporations to more efficiently conduct
2260:
2191:
2111:
1992:
1814:
2125:
2252:
2187:
2103:
2078:
2066:
2006:
1982:
1963:
1951:
208:
110:
1979:
Proceedings of the tenth ACM symposium on
Operating systems principles - SOSP '85
145:
122:
47:
42:
237:
149:
148:
wrote the first version of Linda as a Ph.D. candidate in 1979, naming it after
2279:
2256:
2107:
2070:
1918:
1655:
125:, it is meant to be used alongside a full-fledged computation language like
2023:
1630:, but has since been implemented in many programming languages, including:
1987:
1955:
1796:
1711:
1703:
233:
181:
1790:
1720:
1695:
1646:
1677:
855:
184:
166:
998:
is the multiset union operation. The semantics is then defined as a
1809:
867:
656:
The Linda-calculus processes are defined by the following grammar.
177:
137:
computational activities and to support communication among them".
858:. The substitution function is extended to processes recursively.
1759:
1707:
1659:
1627:
188:
126:
1699:
162:, which Gelernter considered an "inelegant and bulky" language.
1746:
192:
1777:
1724:
1715:
1686:
1668:
335:(unlike original version). An example of this is the language
1651:
440:
and we are allowed to form and apply a substitution function
241:
158:. At the time, the main language for parallel processing was
2149:
The dRuby Book: Distributed and
Parallel Computing with Ruby
306:
Compared to other parallel-processing models, Linda is more
170:
850:
The syntax includes the aftermentioned Linda operations,
636:
633:
630:
627:
614:
611:
608:
605:
544:
541:
538:
535:
490:
487:
484:
481:
212:
86:
2102:. Vol. 2. San Diego, CA: IEEE. pp. 1804–1808.
1783:
Some of the more notable Linda implementations include:
2219:
1908:"Coordination Languages: Back to the Future with Linda"
2056:
1935:
Gelernter, David; Carriero, Nicholas (February 1992).
1595:
1041:
1008:
984:
958:
938:
906:
876:
664:
647:{\displaystyle ({\mathit {hello}},{\mathit {world}})}
596:
576:
520:
466:
446:
416:
360:
1981:. SOSP '85. New York, NY, USA: ACM. pp. 160–.
342:Linda's approach has also been compared to that of
297:(if there's no match, an error message is returned)
287:(if there's no match, an error message is returned)
117:is a coordination model that aids communication in
2173:"The Linda Alternative to message-passing systems"
1606:
1579:
1025:
990:
970:
944:
924:
892:
840:
646:
582:
562:
506:
452:
432:
386:
1976:
1934:
2277:
2090:
2246:
2204:
2100:Proceedings of the Winter Simulation Conference
1937:"Coordination Languages and their Significance"
563:{\displaystyle \sigma =\{{\mathit {world}}/x\}}
2145:
1799:- a Java-based tuplespace platform from IBM.
1569:
1538:
965:
959:
919:
913:
557:
527:
1928:
2249:Lecture Notes in Computer Science, vol 724
834:
828:
807:
801:
791:
785:
761:
755:
731:
725:
686:
680:
277:: Creates a new process to evaluate tuples
1986:
1870:
1534:
1528:
1497:
1491:
1472:
1466:
1446:
1440:
1421:
1415:
1395:
1389:
1336:
1330:
1311:
1305:
1281:
1275:
1220:
1214:
1207:
1201:
1182:
1176:
1152:
1146:
1127:
1121:
1117:
1111:
1062:
1056:
886:
880:
2170:
152:, who appeared in the pornographic film
2220:J. Paul Rodker Morrison (2 July 2004).
2198:
2022:
1901:
1899:
507:{\displaystyle t=({\mathit {hello}},x)}
2278:
2171:Carriero; et al. (1 April 1994).
2028:"David Gelernter's Romance With Linda"
1878:"David Gelernter, B.A. & M.A. '76"
1847:
1841:
169:, published "Linda and Friends" in an
2152:(0.1 ed.). Pragmatic Programmers
2084:
2018:
2016:
1905:
1589:Note that (input) consumes the tuple
1896:
1622:Linda was originally implemented in
339:designed by Steven Ericsson-Zenith.
2164:
1917:. Rhodes University. Archived from
1850:"Lecture 3: Coordination languages"
433:{\displaystyle t\in {\mathcal {T}}}
13:
2091:John H. Reynolds (December 2002).
2013:
1617:
1286:
1283:
1157:
1154:
1082:
1079:
1076:
1073:
1070:
1067:
1064:
866:A tuple space is represented as a
766:
763:
736:
733:
706:
703:
700:
697:
694:
691:
688:
624:
602:
532:
478:
425:
387:{\displaystyle \mathrm {outeval} }
380:
377:
374:
371:
368:
365:
362:
259:: Puts a tuple into the tuplespace
14:
2302:
2093:"Linda arouses a Sleeping Barber"
2050:
349:
2286:Concurrent programming languages
2251:. Springer, Berlin, Heidelberg.
2146:Masatoshi Seki (February 2017).
1548:
1545:
1542:
1505:
1502:
1499:
815:
812:
809:
2240:
2213:
1026:{\displaystyle M\rightarrow M'}
514:, then applying a substitution
59:Scientific Computing Associates
2139:
1970:
1530:
1520:
1493:
1468:
1458:
1442:
1417:
1407:
1391:
1332:
1322:
1307:
1296:
1290:
1277:
1216:
1203:
1193:
1178:
1167:
1161:
1148:
1123:
1113:
1103:
1092:
1086:
1058:
1012:
882:
830:
803:
787:
776:
770:
757:
746:
740:
727:
716:
710:
682:
641:
597:
501:
473:
1:
1835:
925:{\displaystyle M\uplus \{P\}}
301:
247:
2192:10.1016/0167-8191(94)90032-9
861:
293:: A non-blocking version of
283:: A non-blocking version of
7:
1906:Wells, George (July 2005).
1803:
870:of the processes. We write
228:The Linda model provides a
218:
121:environments. Developed by
69:; 38 years ago
10:
2307:
2207:Process Interaction Models
978:a singleton multiset, and
321:Process Interaction Models
167:AT&T Bell Laboratories
140:
133:where Linda's role is to "
1944:Communications of the ACM
405:
317:Message Passing Interface
230:distributed shared memory
100:
95:
81:
63:
53:
41:
33:
21:
2257:10.1007/3-540-57264-3_30
2205:Ericsson-Zenith (1992).
2108:10.1109/WSC.2002.1166471
852:non-deterministic choice
223:
2222:"Coordination Language"
2071:10.1109/mc.1986.1663305
991:{\displaystyle \uplus }
893:{\displaystyle M\,|\,P}
453:{\displaystyle \sigma }
1825:Flow-based programming
1608:
1581:
1027:
992:
972:
946:
926:
894:
842:
648:
584:
564:
508:
454:
434:
388:
344:flow-based programming
2291:Programming languages
1988:10.1145/323647.323643
1956:10.1145/129630.129635
1857:University of Bologna
1609:
1582:
1355: such that
1241: such that
1028:
993:
973:
971:{\displaystyle \{P\}}
947:
927:
895:
843:
649:
585:
565:
509:
455:
435:
389:
333:orthogonal technology
37:Coordination language
1924:on 19 December 2009.
1820:Dataflow programming
1751:SICStus Prolog Linda
1593:
1039:
1006:
982:
956:
936:
904:
874:
662:
594:
574:
518:
464:
444:
414:
358:
180:analyses, including
2209:. Paris University.
2038:on 30 December 2019
2026:(19 January 1992).
1848:Ciancarini, Paolo.
331:and implemented as
197:United Technologies
64:First appeared
18:
2180:Parallel Computing
2065:(8), IEEE: 26–34,
2032:The New York Times
1884:. 14 February 2011
1830:Parallel computing
1607:{\displaystyle t'}
1604:
1577:
1575:
1023:
1000:reduction relation
988:
968:
942:
922:
890:
838:
644:
580:
560:
504:
450:
430:
384:
329:Linda-like systems
236:because its basic
119:parallel computing
16:
2266:978-3-540-57264-0
1815:Data flow diagram
1484:
1433:
1382:
1356:
1348:
1268:
1242:
1234:
1139:
1049:
945:{\displaystyle M}
583:{\displaystyle t}
107:
106:
2298:
2271:
2270:
2244:
2238:
2237:
2235:
2233:
2224:. Archived from
2217:
2211:
2210:
2202:
2196:
2195:
2177:
2168:
2162:
2161:
2159:
2157:
2143:
2137:
2136:
2134:
2132:
2097:
2088:
2082:
2081:
2054:
2048:
2047:
2045:
2043:
2034:. Archived from
2020:
2011:
2010:
1990:
1974:
1968:
1967:
1941:
1932:
1926:
1925:
1923:
1912:
1903:
1894:
1893:
1891:
1889:
1874:
1868:
1867:
1865:
1863:
1854:
1845:
1613:
1611:
1610:
1605:
1603:
1586:
1584:
1583:
1578:
1576:
1573:
1565:
1551:
1533:
1508:
1496:
1485:
1482:
1477:
1471:
1445:
1434:
1431:
1426:
1420:
1394:
1383:
1380:
1374:
1357:
1354:
1349:
1346:
1335:
1319:
1310:
1289:
1280:
1269:
1266:
1260:
1243:
1240:
1235:
1232:
1228:
1219:
1206:
1190:
1181:
1160:
1151:
1140:
1137:
1132:
1126:
1116:
1085:
1061:
1050:
1047:
1032:
1030:
1029:
1024:
1022:
997:
995:
994:
989:
977:
975:
974:
969:
951:
949:
948:
943:
931:
929:
928:
923:
899:
897:
896:
891:
885:
847:
845:
844:
839:
833:
818:
806:
790:
769:
760:
739:
730:
709:
685:
653:
651:
650:
645:
640:
639:
618:
617:
589:
587:
586:
581:
569:
567:
566:
561:
553:
548:
547:
513:
511:
510:
505:
494:
493:
459:
457:
456:
451:
439:
437:
436:
431:
429:
428:
393:
391:
390:
385:
383:
296:
292:
286:
282:
276:
270:
264:
258:
238:addressable unit
209:Sun Microsystems
111:computer science
91:
88:
77:
75:
70:
43:Designed by
19:
15:
2306:
2305:
2301:
2300:
2299:
2297:
2296:
2295:
2276:
2275:
2274:
2267:
2245:
2241:
2231:
2229:
2218:
2214:
2203:
2199:
2175:
2169:
2165:
2155:
2153:
2144:
2140:
2130:
2128:
2118:
2095:
2089:
2085:
2055:
2051:
2041:
2039:
2021:
2014:
1999:
1975:
1971:
1939:
1933:
1929:
1921:
1910:
1904:
1897:
1887:
1885:
1882:Yale Scientific
1876:
1875:
1871:
1861:
1859:
1852:
1846:
1842:
1838:
1806:
1620:
1618:Implementations
1596:
1594:
1591:
1590:
1574:
1572:
1561:
1541:
1529:
1523:
1518:
1498:
1492:
1486:
1481:
1478:
1476:
1467:
1461:
1456:
1441:
1435:
1430:
1427:
1425:
1416:
1410:
1405:
1390:
1384:
1379:
1376:
1375:
1367:
1353:
1347:if exists
1345:
1343:
1331:
1325:
1320:
1312:
1306:
1282:
1276:
1270:
1265:
1262:
1261:
1253:
1239:
1233:if exists
1231:
1229:
1221:
1215:
1202:
1196:
1191:
1183:
1177:
1153:
1147:
1141:
1136:
1133:
1131:
1122:
1112:
1106:
1101:
1063:
1057:
1051:
1046:
1042:
1040:
1037:
1036:
1015:
1007:
1004:
1003:
983:
980:
979:
957:
954:
953:
952:is a multiset,
937:
934:
933:
905:
902:
901:
881:
875:
872:
871:
864:
829:
808:
802:
786:
762:
756:
732:
726:
687:
681:
663:
660:
659:
623:
622:
601:
600:
595:
592:
591:
575:
572:
571:
549:
531:
530:
519:
516:
515:
477:
476:
465:
462:
461:
445:
442:
441:
424:
423:
415:
412:
411:
408:
361:
359:
356:
355:
352:
304:
294:
290:
284:
280:
274:
268:
262:
256:
250:
226:
221:
146:David Gelernter
143:
123:David Gelernter
85:
73:
71:
68:
48:David Gelernter
12:
11:
5:
2304:
2294:
2293:
2288:
2273:
2272:
2265:
2239:
2212:
2197:
2186:(4): 633–655.
2163:
2138:
2116:
2083:
2049:
2012:
1998:978-0897911740
1997:
1969:
1927:
1895:
1869:
1839:
1837:
1834:
1833:
1832:
1827:
1822:
1817:
1812:
1805:
1802:
1801:
1800:
1794:
1788:
1781:
1780:
1771:
1762:
1753:
1744:
1732:
1727:
1718:
1689:
1680:
1671:
1662:
1649:
1619:
1616:
1602:
1599:
1571:
1568:
1564:
1560:
1557:
1554:
1550:
1547:
1544:
1540:
1537:
1532:
1527:
1524:
1522:
1519:
1517:
1514:
1511:
1507:
1504:
1501:
1495:
1490:
1487:
1480:
1479:
1475:
1470:
1465:
1462:
1460:
1457:
1455:
1452:
1449:
1444:
1439:
1436:
1432:(right choice)
1429:
1428:
1424:
1419:
1414:
1411:
1409:
1406:
1404:
1401:
1398:
1393:
1388:
1385:
1378:
1377:
1373:
1370:
1366:
1363:
1360:
1352:
1344:
1342:
1339:
1334:
1329:
1326:
1324:
1321:
1318:
1315:
1309:
1304:
1301:
1298:
1295:
1292:
1288:
1285:
1279:
1274:
1271:
1264:
1263:
1259:
1256:
1252:
1249:
1246:
1238:
1230:
1227:
1224:
1218:
1213:
1210:
1205:
1200:
1197:
1195:
1192:
1189:
1186:
1180:
1175:
1172:
1169:
1166:
1163:
1159:
1156:
1150:
1145:
1142:
1135:
1134:
1130:
1125:
1120:
1115:
1110:
1107:
1105:
1102:
1100:
1097:
1094:
1091:
1088:
1084:
1081:
1078:
1075:
1072:
1069:
1066:
1060:
1055:
1052:
1045:
1044:
1021:
1018:
1014:
1011:
1002:on a multiset
987:
967:
964:
961:
941:
921:
918:
915:
912:
909:
889:
884:
879:
863:
860:
837:
832:
827:
824:
821:
817:
814:
811:
805:
800:
797:
794:
789:
784:
781:
778:
775:
772:
768:
765:
759:
754:
751:
748:
745:
742:
738:
735:
729:
724:
721:
718:
715:
712:
708:
705:
702:
699:
696:
693:
690:
684:
679:
676:
673:
670:
667:
643:
638:
635:
632:
629:
626:
621:
616:
613:
610:
607:
604:
599:
579:
559:
556:
552:
546:
543:
540:
537:
534:
529:
526:
523:
503:
500:
497:
492:
489:
486:
483:
480:
475:
472:
469:
449:
427:
422:
419:
407:
404:
394:subsumes both
382:
379:
376:
373:
370:
367:
364:
351:
350:Linda-calculus
348:
303:
300:
299:
298:
288:
278:
272:
266:
260:
249:
246:
225:
222:
220:
217:
150:Linda Lovelace
142:
139:
105:
104:
98:
97:
93:
92:
83:
79:
78:
65:
61:
60:
57:
51:
50:
45:
39:
38:
35:
31:
30:
28:Multi-paradigm
25:
9:
6:
4:
3:
2:
2303:
2292:
2289:
2287:
2284:
2283:
2281:
2268:
2262:
2258:
2254:
2250:
2243:
2228:on 2023-09-28
2227:
2223:
2216:
2208:
2201:
2193:
2189:
2185:
2181:
2174:
2167:
2151:
2150:
2142:
2127:
2123:
2119:
2117:0-7803-7614-5
2113:
2109:
2105:
2101:
2094:
2087:
2080:
2076:
2072:
2068:
2064:
2060:
2053:
2037:
2033:
2029:
2025:
2024:Markoff, John
2019:
2017:
2008:
2004:
2000:
1994:
1989:
1984:
1980:
1973:
1965:
1961:
1957:
1953:
1950:(2): 97–107.
1949:
1945:
1938:
1931:
1920:
1916:
1909:
1902:
1900:
1883:
1879:
1873:
1858:
1851:
1844:
1840:
1831:
1828:
1826:
1823:
1821:
1818:
1816:
1813:
1811:
1808:
1807:
1798:
1795:
1792:
1789:
1786:
1785:
1784:
1779:
1775:
1772:
1770:
1766:
1763:
1761:
1757:
1754:
1752:
1748:
1745:
1743:
1740:
1736:
1733:
1731:
1728:
1726:
1722:
1719:
1717:
1713:
1709:
1705:
1701:
1697:
1693:
1690:
1688:
1684:
1681:
1679:
1675:
1672:
1670:
1666:
1663:
1661:
1657:
1653:
1650:
1648:
1644:
1640:
1636:
1633:
1632:
1631:
1629:
1625:
1615:
1600:
1597:
1587:
1566:
1562:
1558:
1555:
1552:
1535:
1525:
1515:
1512:
1509:
1488:
1473:
1463:
1453:
1450:
1447:
1437:
1422:
1412:
1402:
1399:
1396:
1386:
1381:(left choice)
1371:
1368:
1364:
1361:
1358:
1350:
1340:
1337:
1327:
1316:
1313:
1302:
1299:
1293:
1272:
1257:
1254:
1250:
1247:
1244:
1236:
1225:
1222:
1211:
1208:
1198:
1187:
1184:
1173:
1170:
1164:
1143:
1128:
1118:
1108:
1098:
1095:
1089:
1053:
1034:
1019:
1016:
1009:
1001:
985:
962:
939:
916:
910:
907:
887:
877:
869:
859:
857:
853:
848:
835:
825:
822:
819:
798:
795:
792:
782:
779:
773:
752:
749:
743:
722:
719:
713:
677:
674:
671:
668:
665:
657:
654:
619:
577:
554:
550:
524:
521:
498:
495:
470:
467:
447:
420:
417:
403:
401:
397:
347:
345:
340:
338:
334:
330:
324:
322:
318:
312:
309:
289:
279:
273:
267:
261:
255:
254:
253:
245:
243:
239:
235:
232:, known as a
231:
216:
214:
210:
206:
202:
198:
194:
190:
186:
183:
179:
174:
172:
168:
163:
161:
157:
156:
151:
147:
138:
136:
132:
128:
124:
120:
116:
112:
103:
99:
94:
90:
84:
80:
66:
62:
58:
56:
52:
49:
46:
44:
40:
36:
32:
29:
26:
24:
20:
2248:
2242:
2230:. Retrieved
2226:the original
2215:
2206:
2200:
2183:
2179:
2166:
2154:. Retrieved
2148:
2141:
2129:. Retrieved
2099:
2086:
2062:
2058:
2052:
2040:. Retrieved
2036:the original
2031:
1978:
1972:
1947:
1943:
1930:
1919:the original
1914:
1886:. Retrieved
1881:
1872:
1860:. Retrieved
1856:
1843:
1782:
1621:
1588:
1035:
1033:as follows.
865:
849:
658:
655:
409:
402:operations.
399:
395:
353:
341:
325:
320:
313:
305:
251:
227:
207:, including
175:
164:
153:
144:
134:
114:
108:
1647:LinuxTuples
1483:(recursion)
234:tuple space
187:as well as
182:Wall Street
155:Deep Throat
87:lindaspaces
2280:Categories
1836:References
1791:JavaSpaces
1721:JavaScript
1696:JavaSpaces
308:orthogonal
302:Comparison
248:Operations
185:brokerages
173:journal.
96:Influenced
2232:9 January
2156:9 January
2131:8 January
2042:8 January
1888:8 January
1862:9 January
1742:Lua Lanes
1643:TCP-Linda
1521:→
1459:→
1408:→
1362:σ
1351:σ
1341:σ
1323:→
1248:σ
1237:σ
1212:σ
1194:→
1104:→
1048:(outeval)
1013:→
986:⊎
911:⊎
862:Semantics
856:recursion
522:σ
448:σ
421:∈
201:New Haven
55:Developer
2126:62584541
2059:Computer
1810:Dataflow
1804:See also
1656:CppLinda
1601:′
1372:′
1317:′
1258:′
1226:′
1188:′
1020:′
868:multiset
219:Overview
189:AT&T
178:big data
23:Paradigm
2079:5155678
2007:6922183
1964:7748555
1797:TSpaces
1778:pSpaces
1760:PyLinda
1725:pSpaces
1716:pSpaces
1708:LightTS
1704:TSpaces
1687:pSpaces
1678:Erlinda
1669:pSpaces
1639:C-Linda
1628:Fortran
1267:(input)
590:yields
141:History
127:Fortran
82:Website
72: (
2263:
2124:
2114:
2077:
2005:
1995:
1962:
1756:Python
1747:Prolog
1674:Erlang
1660:Boreas
1138:(read)
932:where
854:, and
406:Syntax
195:, and
193:Boeing
135:create
34:Family
2176:(PDF)
2122:S2CID
2096:(PDF)
2075:S2CID
2003:S2CID
1960:S2CID
1940:(PDF)
1922:(PDF)
1911:(PDF)
1853:(PDF)
1774:Swift
1769:Rinda
1739:LuaTS
1700:jRESP
242:tuple
240:is a
224:Model
115:Linda
17:Linda
2261:ISBN
2234:2022
2158:2022
2133:2022
2112:ISBN
2044:2022
1993:ISBN
1890:2022
1864:2022
1765:Ruby
1730:Lisp
1712:LIME
1692:Java
1626:and
900:for
400:eval
398:and
337:Ease
275:eval
211:and
205:Java
171:IEEE
102:Java
89:.com
74:1986
67:1986
2253:doi
2188:doi
2104:doi
2067:doi
2063:19b
1983:doi
1952:doi
1735:Lua
1652:C++
675:::=
570:on
396:out
291:rdp
281:inp
257:out
213:IBM
160:Ada
129:or
109:In
2282::
2259:.
2182:.
2178:.
2120:.
2110:.
2098:.
2073:,
2061:,
2030:.
2015:^
2001:.
1991:.
1958:.
1948:35
1946:.
1942:.
1913:.
1898:^
1880:.
1855:.
1776::
1767::
1758::
1749::
1737::
1723::
1714:,
1710:,
1706:,
1702:,
1698:,
1694::
1685::
1683:Go
1676::
1667::
1665:C#
1658:,
1654::
1645:,
1641:,
1637::
346:.
323:.
295:rd
285:in
269:rd
263:in
215:.
191:,
113:,
2269:.
2255::
2236:.
2194:.
2190::
2184:2
2160:.
2135:.
2106::
2069::
2046:.
2009:.
1985::
1966:.
1954::
1892:.
1866:.
1635:C
1624:C
1598:t
1570:}
1567:X
1563:/
1559:P
1556:.
1553:X
1549:c
1546:e
1543:r
1539:{
1536:P
1531:|
1526:M
1516:P
1513:.
1510:X
1506:c
1503:e
1500:r
1494:|
1489:M
1474:Q
1469:|
1464:M
1454:Q
1451:+
1448:P
1443:|
1438:M
1423:P
1418:|
1413:M
1403:Q
1400:+
1397:P
1392:|
1387:M
1369:t
1365:=
1359:t
1338:P
1333:|
1328:M
1314:t
1308:|
1303:P
1300:.
1297:)
1294:t
1291:(
1287:n
1284:i
1278:|
1273:M
1255:t
1251:=
1245:t
1223:t
1217:|
1209:P
1204:|
1199:M
1185:t
1179:|
1174:P
1171:.
1168:)
1165:t
1162:(
1158:d
1155:r
1149:|
1144:M
1129:Q
1124:|
1119:P
1114:|
1109:M
1099:Q
1096:.
1093:)
1090:P
1087:(
1083:l
1080:a
1077:v
1074:e
1071:t
1068:u
1065:o
1059:|
1054:M
1017:M
1010:M
966:}
963:P
960:{
940:M
920:}
917:P
914:{
908:M
888:P
883:|
878:M
836:X
831:|
826:P
823:.
820:X
816:c
813:e
810:r
804:|
799:Q
796:+
793:P
788:|
783:P
780:.
777:)
774:t
771:(
767:n
764:i
758:|
753:P
750:.
747:)
744:t
741:(
737:d
734:r
728:|
723:Q
720:.
717:)
714:P
711:(
707:l
704:a
701:v
698:e
695:t
692:u
689:o
683:|
678:t
672:Q
669:,
666:P
642:)
637:d
634:l
631:r
628:o
625:w
620:,
615:o
612:l
609:l
606:e
603:h
598:(
578:t
558:}
555:x
551:/
545:d
542:l
539:r
536:o
533:w
528:{
525:=
502:)
499:x
496:,
491:o
488:l
485:l
482:e
479:h
474:(
471:=
468:t
426:T
418:t
381:l
378:a
375:v
372:e
369:t
366:u
363:o
131:C
76:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.