The S/Net's Linda kernel (extended abstract)

@inproceedings{Carriero1985TheSL,
  title={The S/Net's Linda kernel (extended abstract)},
  author={Nicholas Carriero and David Gelernter},
  booktitle={SOSP '85},
  year={1985}
}
L i n d a cons i s t s o f a few s i m p l e o p e r a t o r s t h a t , w h e n i n j ec t ed in to a h o s t l a n g u a g e h, t u r n h in to a pa ra l l e l p r o g r a m m i n g l a n g u a g e . ( M o s t o f o u r p r o g r a m m i n g e x p e r i m e n t s so f a r h a v e been c o n d u c t e d in C L i n d a , b u t we h a v e r ecen t ly i m p l e m e n t e d a F o r t r a n L i n d a prep r o c e s s o r as well . ) T h e S / N e t is a m u l t i c o m p u t e r t h a t can also f… Expand
A Calculus for Attribute-Based Memory Updates
TLDR
AbU is presented as a new ECA-inspired calculus with attribute-based communication, an interaction model recently introduced for coordinating large numbers of nodes, and it is shown how to encode into AbU components written in AbC, the archetypal calculus with attributions, and the correctness of such encoding is proved. Expand
Process calculi as a tool for studying coordination, contracts and session types
TLDR
It is shown how techniques based on the theory of process calculi recently contributed to the clarification of aspects that were unclear about session types, in particular, asynchronous session subtyping that was considered decidable since 2009, while it was proved to be undecidable in 2017. Expand
Remote memory in the age of fast networks
TLDR
This paper enumerates the challenges of remote memory, discusses their feasibility, explain how some of them are addressed by recent work, and indicates other promising ways to tackle them. Expand