{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:50:38Z","timestamp":1725558638611},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540202165"},{"type":"electronic","value":"9783540452089"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45208-9_5","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:49:20Z","timestamp":1277686160000},"page":"37-57","source":"Crossref","is-referenced-by-count":0,"title":["A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics"],"prefix":"10.1007","author":[{"given":"Claudio Sacerdoti","family":"Coen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1\/2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1006\/inco.1999.2823","volume":"156","author":"N. Busi","year":"2000","unstructured":"Busi, N., Gorrieri, R., Zavattaro, G.: On the Expressiveness of Linda Coordination Primitives. Information and Computation\u00a0156(1\/2), 90\u2013121 (2000)","journal-title":"Information and Computation"},{"key":"5_CR2","unstructured":"The Coq proof-assistant, \n \n http:\/\/coq.inria.fr\/"},{"key":"5_CR3","unstructured":"Hofmann, M.: Extensional concepts in intensional type theory. Ph.D. thesis, University of Edinburgh (July 1995)"},{"key":"5_CR4","unstructured":"McBride, C.: Dependently Typed Functional Programs and their Proofs. Ph.D. thesis, University of Edinburgh (2000)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/2363.2433","volume":"7","author":"D. Gelernter","year":"1985","unstructured":"Gelernter, D.: Generative Communication in Linda. ACM Transactions on Programming Languages and Systems\u00a07(1), 80\u2013112 (1985)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"5_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/129630.129635","volume":"35","author":"D. Gelernter","year":"1992","unstructured":"Gelernter, D., Carriero, N.: Coordination Languages and their Significance. Communications of the ACM\u00a035(2), 97\u2013102 (1992)","journal-title":"Communications of the ACM"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-45685-6_4","volume-title":"Theorem Proving in Higher Order Logics","author":"G. Barthe","year":"2002","unstructured":"Barthe, G., Courtieu, P.: Efficient Reasoning about executable specifications in Coq. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 31\u201346. Springer, Heidelberg (2002)"},{"key":"5_CR8","unstructured":"Asperti, A., Guidi, F., Padovani, L., Sacerdoti Coen, C., Schena, I.: Mathematical Knowledge Management in HELM. In: On-Line Proceedings of the First International Workshop on Mathematical Knowledge Management (MKM 2001), RISCLinz, Austria (September 2001)"},{"key":"5_CR9","unstructured":"Asperti, A., Guidi, F., Padovani, L., Sacerdoti Coen, C., Schena, I.: XML, Stylesheets and the re-mathematization of Formal Content. In: On-Line Proceedings of EXTREME 2001 (2001)"},{"key":"5_CR10","unstructured":"Milner, R.: The Polyadic \u03c0-Calculus: A Tutorial Technical Report, Department of Computer Science, University of Edinburgh, ECS-LFCS-91-180 (October 1991)"},{"key":"5_CR11","volume-title":"Computation: finite and infinite machines","author":"M.L. Minsky","year":"1967","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1145\/321160.321170","volume":"10","author":"J.C. Shepherdson","year":"1963","unstructured":"Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM\u00a010, 217\u2013255 (1963)","journal-title":"Journal of the ACM"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0304-3975(97)00149-7","volume":"192","author":"N. Busi","year":"1998","unstructured":"Busi, N., Gorrieri, R., Zavattaro, G.: A Process Algebraic View of Linda Coordination Primitives. Theoretical Computer Science\u00a0192(2), 167\u2013199 (1998)","journal-title":"Theoretical Computer Science"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45745-3_27","volume-title":"Web Engineering and Peer-to-Peer Computing","author":"N. Busi","year":"2002","unstructured":"Busi, N., Zavattaro, G.: On the Expressiveness of Movement in Pure Mobile Ambients. In: Gregori, E., Cherkasova, L., Cugola, G., Panzieri, F., Picco, G.P. (eds.) NETWORKING 2002. LNCS, vol.\u00a02376, Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45208-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T00:10:17Z","timestamp":1552608617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45208-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540202165","9783540452089"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45208-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}