{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:19Z","timestamp":1761611299810},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580270"},{"type":"electronic","value":"9783540484196"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58027-1_14","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:07:57Z","timestamp":1330268877000},"page":"293-303","source":"Crossref","is-referenced-by-count":4,"title":["A chemical abstract machine for graph reduction extended abstract"],"prefix":"10.1007","author":[{"given":"Alan","family":"Jeffrey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"14_CR1","unstructured":"Abramsky, S. (1989). The lazy lambda calculus. In Turner, D., editor, Declarative Programming. Addison-Wesley."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Augustsson, L. (1984). A compiler for lazy ML. In Proc. ACM Symp. Lisp and Functional Programming, pages 218\u2013227.","DOI":"10.1145\/800055.802038"},{"key":"14_CR3","unstructured":"Barendregt, H. (1984). The Lambda Calculus. North-Holland. Studies in logic 103."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Barendregt, H. P., Van Eekelen, M. C. J. D., Glauert, J. R. W., Kennaway, J. R., Plasmeijer, M. J., and Sleep, M. R. (1987). Term graph rewriting. In Proc. PARLE 87, volume 2, pages 141\u2013158. Springer-Verlag. LNCS 259.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Berry, G. and Boudol, G. (1990). The chemical abstract machine. In Proc. 17th Ann. Symp. Principles of Programming Languages.","DOI":"10.1145\/96709.96717"},{"key":"14_CR6","unstructured":"Boudol, G. (1992). Asynchrony and the pi-calculus. INRIA Sophia-Antipolis."},{"key":"14_CR7","unstructured":"Church, A. (1941). The Calculi of Lambda Conversion. Princeton University Press."},{"key":"14_CR8","unstructured":"Hughes, R. J. M. (1984). The Design and Implementation of Programming Languages. D.Phil thesis, Oxford University."},{"key":"14_CR9","unstructured":"Jeffrey, A. (1992). A chemical abstract machine for graph reduction. Technical report 3\/92, University of Sussex."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Johnnson, T. (1984). Effecient compilation of lazy evaluation. In Proc.Sigplan 84 Symp.Compiler Construction, pages 58\u201369.","DOI":"10.1145\/502874.502880"},{"key":"14_CR11","unstructured":"Jones, M. (1992). The Gofer technical manual. Part of the Gofer distribution."},{"key":"14_CR12","unstructured":"Lester, D. (1989). Combinator Graph Reduction: A Congruence and its Applications. D.Phil thesis, Oxford University."},{"key":"14_CR13","unstructured":"Mccarthy, J., Abrahams, P. W., Edwards, D. J., Hart, T. P., and Levin, M. I. (1962). The Lisp 1.5 Programmers Kit. MIT Press."},{"key":"14_CR14","unstructured":"Milner, R. (1989). Communication and Concurrency. Prentice-Hall."},{"key":"14_CR15","unstructured":"Milner, R. (1991). The polyadic \u03c0-calculus: a tutorial. In Proc. International Summer School on Logic and Algebra of Specification, Marktoberdorf."},{"key":"14_CR16","unstructured":"Milner, R. (1992). Functions as processes. Math. Struct. in Comput. Science, 2:119\u2013141."},{"key":"14_CR17","unstructured":"Milner, R., Parrow, J., and Walker, D. (1989). A calculus of mobile processes. Technical reports ECS-LFCS-89-86 and-87, LFCS, University of Edinburgh."},{"key":"14_CR18","unstructured":"Peyton Jones, S. (1987). The Implementation of Functional Programming Languages. Prentice-Hall."},{"key":"14_CR19","unstructured":"Sangiorgi, D. (1991). The lazy lambda calculus in a concurrency scenario. Technical Report ECS-LFCS-91-189, LFCS, Edinburgh University."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Stoye, W. R., Clarke, T. J. W., and Norman, A. C. (1984). Some practical methods for rapid combinator reduction. In Proc. ACM Symp. Lisp and Functional Programming, pages 159\u2013166.","DOI":"10.1145\/800055.802032"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Turner, D. (1985). Miranda: A non-strict functional language with polymorphic types. In Proc. IFIP Conf. Functional Programming Languages and Computer Architecture. Springer-Verlag. LNCS 201.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"14_CR22","unstructured":"Wadsworth, C. P. (1971). Semantics and Pragmatics of the Lambda Calculus. D.Phil thesis, Oxford University."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Programming Semantics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58027-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:24Z","timestamp":1605647784000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58027-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580270","9783540484196"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-58027-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}