A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics

Claudio Sacerdoti Coen. A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics. In Carlo Blundo, Cosimo Laneve, editors, Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings. Volume 2841 of Lecture Notes in Computer Science, pages 37-57, Springer, 2003. [doi]

@inproceedings{Coen03:0,
  title = {A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics},
  author = {Claudio Sacerdoti Coen},
  year = {2003},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2841&spage=37},
  tags = {semantics},
  researchr = {https://researchr.org/publication/Coen03%3A0},
  cites = {0},
  citedby = {0},
  pages = {37-57},
  booktitle = {Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings},
  editor = {Carlo Blundo and Cosimo Laneve},
  volume = {2841},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-20216-1},
}