Searching for "A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A constructive proof of the soundness of the encoding of random access machines in a linda calculus
by Claudio Sacerdoti Coen — 2003 — In Theoretical Computer Science: 8th Italian Conference, ICTCS 2003, volume LNCS, 2841
… A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda…
Cited by 1 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB