{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:30Z","timestamp":1725456990443},"publisher-location":"Berlin\/Heidelberg","reference-count":20,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032031","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T01:05:31Z","timestamp":1134263131000},"page":"181-194","source":"Crossref","is-referenced-by-count":4,"title":["A domain-theoretic model for a higher-order process calculus"],"prefix":"10.1007","author":[{"given":"Radha","family":"Jagadeesan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Panangaden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"S. Abramsky and C. H. L. Ong. Full abstraction in the lazy lambda calculus. Submitted to Information and Computation, 1988."},{"key":"15_CR2","series-title":"Studies in Logic","volume-title":"The Lambda Calculus, Its Syntax and Semantics","author":"H. P. Barendregt","year":"1984","unstructured":"H. P. Barendregt. The Lambda Calculus, Its Syntax and Semantics. Studies in Logic. North-Holland, Amsterdam, revised edition edition, 1984.","edition":"revised edition"},{"key":"15_CR3","unstructured":"G. Berry. Some syntactic and categorical constructions of lambda-calculus models. Technical Report 80, Institute National de Recherche en Informatique et en Automatique (INRIA), 1981."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"G. Berry and G. Boudol. The chemical abstract machine. In Proceedings of the 17th Annual ACM Symposium on Principles of Programming Languages, 1990.","DOI":"10.1145\/96709.96717"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/3-540-50939-9_130","volume":"351","author":"G. Boudol","year":"1989","unstructured":"G. Boudol. Towards a lambda-calculus for concurrent and communicating systems. In J. Diaz, editor, TAPSOFT 89, Lecture Notes in Computer Science 351, pages 149\u2013161. Springer-Verlag, 1989.","journal-title":"TAPSOFT 89, Lecture Notes in Computer Science"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"U. Engberg and M. Neilsen. A calculus of communicating systems with label passing. DAIMI PB-208, Aarhus University, 1986.","DOI":"10.7146\/dpb.v15i208.7559"},{"key":"15_CR7","unstructured":"M. Hennessy. Algebraic Theory of Processes. MIT Press, 1988."},{"key":"15_CR8","unstructured":"R. Jagadeesan and P. Panangaden. A domain-theoretic model for a higher-order process calculus. Technical Report TR 89-1058, Cornell, 1989."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"B. Jonsson. A fully abstract trace model for dataflow networks. In Proceedings of the Sixteenth Annual ACM Symposium On Principles Of Programming Languages, 1989.","DOI":"10.1145\/75277.75291"},{"key":"15_CR10","first-page":"993","volume":"74","author":"G. Kahn","year":"1977","unstructured":"G. Kahn. The semantics of a simple language for parallel programming. In Information Process 74, pages 993\u2013998. North-Holland, 1977.","journal-title":"Information Process"},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/3-540-17945-3_20","volume-title":"Proceedings of Parallel Architectures And Languages Europe 1987","author":"J. Kok","year":"1987","unstructured":"J. Kok. A fully abstract semantics for dataflow nets. In Proceedings of Parallel Architectures And Languages Europe 1987, pages 351\u2013368, Berlin, 1987. Springer-Verlag."},{"key":"15_CR12","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"15_CR13","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/3-540-51285-3_52","volume":"366","author":"F. Neilson","year":"1989","unstructured":"F. Neilson. The typed lambda-calculus with first-class processes. In PARLE89, Lecture Notes in Computer Science 366, pages 357\u2013373, 1989.","journal-title":"Lecture Notes in Computer Science"},{"key":"15_CR14","unstructured":"C. H. L. Ong. The Lazy Lambda Calculus: An Investigation into the Foundations of Functional Programming. PhD thesis, Imperial College of Science and Technology, 1988."},{"issue":"3","key":"15_CR15","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G. D. Plotkin","year":"1976","unstructured":"G. D. Plotkin. A powerdomain construction. SIAM Journal of Computing, 5(3):452\u2013487, 1976.","journal-title":"SIAM Journal of Computing"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"J. H. Reppy. Synchronous operations as first-class values. In Proceedings of the SIGPLAN conference on Programming language design and implementation, 1988.","DOI":"10.1145\/53990.54015"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"J. R. Russell. Full abstraction for nondeterministic dataflow networks. In Proceedings of the 30th Annual Symposium of Foundations of Computer Science, pages 170\u2013177, 1989.","DOI":"10.1109\/SFCS.1989.63474"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"M. B. Smyth and G. D. Plotkin. The category theoretic solution of recursive domain equations. Siam Journal of Computing, 11(4), 1982.","DOI":"10.1137\/0211062"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"B. Thomsen. A calculus of higher-order communicating systems. In Proceedings of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, 1988.","DOI":"10.1145\/75277.75290"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"C. P. Wadsworth. The relation between computational and denotational properties for Scott's D \u221e models of the \u03bb-calculus. SIAM J. Computing, 5:488\u2013521, 76.","DOI":"10.1137\/0205036"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0032031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:45:08Z","timestamp":1586598308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032031"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/bfb0032031","relation":{},"subject":[]}}