{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:27:20Z","timestamp":1725481640804},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402541"},{"type":"electronic","value":"9783540448815"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44881-0_8","type":"book-chapter","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T11:39:56Z","timestamp":1173094796000},"page":"88-106","source":"Crossref","is-referenced-by-count":3,"title":["Diagrams for Meaning Preservation"],"prefix":"10.1007","author":[{"given":"Joe B.","family":"Wells","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Detlef","family":"Plump","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fairouz","family":"Kamareddine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola, S. Blom. Cyclic lambda calculi. In Theoretical Aspects Comput. Softw.: Int\u2019l Conf., Berlin, 1997. Springer.","DOI":"10.1007\/BFb0014548"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola, S. Blom. Skew confluence and the lambda calculus with letrec. Ann. Pure Appl. Logic, 117(1\u20133), 2002.","DOI":"10.1016\/S0168-0072(01)00104-X"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola, M. Felleisen. The call-by-need lambda calculus. J. Funct. Programming, 3(7), 1997.","DOI":"10.1017\/S0956796897002724"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola, M. Felleisen, J. Maraist, M. Odersky, P. Wadler. The call-by-need lambda calculus. In Conf. Rec. 22nd Ann. ACM Symp. Princ. of Prog. Langs., 1995.","DOI":"10.1145\/199448.199507"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Z. M. Ariola, J. W. Klop. Lambda calculus with explicit recursion. Inform. & Comput., 139, 1997.","DOI":"10.1006\/inco.1997.2651"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"F. Baader, T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"8_CR7","unstructured":"H. P. Barendregt. The Lambda Calculus:Its Syntax and Semantics. North-Holland, revised edition, 1984."},{"key":"8_CR8","series-title":"Lect Notes Comput Sci","volume-title":"Programming Languages & Systems, 9th European Symp. Programming","year":"2000","unstructured":"Programming Languages & Systems, 9th European Symp. Programming, vol. 1782 of LNCS. Springer-Verlag, 2000."},{"key":"8_CR9","unstructured":"M. Felleisen, D. Friedman. Control operators, the SECD-machine, and the \u03bb-calculus. In M. Wirsing, ed., Formal Description of Programming Concepts \u2014 III. North-Holland, 1986."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"M. Felleisen, D. P. Friedman. A syntactic theory of sequential state. Theoret. Comput. Sci., 69(3), 1989.","DOI":"10.1016\/0304-3975(89)90069-8"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"M. Felleisen, R. Hieb. The revised report on the syntactic theories of sequential control and state. Theoret. Comput. Sci., 102, 1992.","DOI":"10.1016\/0304-3975(92)90014-7"},{"key":"8_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46425-5_9","volume-title":"Programming Languages & Systems, 9th European Symp. Programming","author":"K. Fisher","year":"2000","unstructured":"K. Fisher, J. Reppy, J. G. Riecke. A calculus for compiling and linking classes. In ESOP\u2019 00 [8]."},{"key":"8_CR13","unstructured":"G. Gonthier, J.-J. L\u00e9vy, P.-A. Melli\u00e8s. An abstract standardisation theorem. In Proc. 7th Ann. IEEE Symp. Logic in Comput. Sci., 1992."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"D. J. Howe. Equality in lazy computation systems. In Proc. 4th Ann. Symp. Logic in Comput. Sci., Pacific Grove, CA, U.S.A., 1989. IEEE Comput. Soc. Press.","DOI":"10.1109\/LICS.1989.39174"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"D. J. Howe. Proving congruence of bisimulation in functional programming languages. Inform. & Comput., 124(2), 1996.","DOI":"10.1006\/inco.1996.0008"},{"key":"8_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Programming Languages & Systems, 9th European Symp. Programming","author":"E. Machkasova","year":"1998","unstructured":"E. Machkasova. Techniques for proving observational equivalence. ASCII notes that later turned into [17]. Not sure about year, 1998."},{"key":"8_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46425-5_17","volume-title":"Programming Languages & Systems, 9th European Symp. Programming","author":"E. Machkasova","year":"2000","unstructured":"E. Machkasova, F. A. Turbak. A calculus for link-time compilation. In ESOP\u2019 00 [8]."},{"key":"8_CR18","unstructured":"E. L. Machkasova. Computational Soundness of Non-Confluent Calculi with Applications to Modules and Linking. PhD thesis, Boston Univ., 2002."},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"J. Maraist, M. Odersky, P. Wadler. The call-by-need lambda calculus. J. Funct. Programming, 8(3), 1998.","DOI":"10.1017\/S0956796898003037"},{"key":"8_CR20","unstructured":"P.-A. Melli\u00e8s. Axiomatic Rewriting Theory IV: A diagrammatic standardization theorem. Submitted, 2001."},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"R. Muller. M-LISP: A representation-independent dialect of LISP with reduction semantics. ACM Trans. on Prog. Langs. & Systs., 14(4), 1992.","DOI":"10.1145\/133233.133254"},{"key":"8_CR22","doi-asserted-by":"crossref","unstructured":"M. H. A. Newman. On theories with a combinatorial definition of \u201cequivalence\u201d. Annals of Math., 43(2), 1942.","DOI":"10.2307\/1968867"},{"key":"8_CR23","unstructured":"M. Odersky. A syntactic method for proving observational equivalences. Research Report YALEU\/DCS\/RR-964, Yale Univ., Dept. of Comp. Science, 1993."},{"key":"8_CR24","doi-asserted-by":"crossref","unstructured":"A. M. Pitts. Operationally-based theories of program equivalence. In Semantics and Logics of Computation, vol. 14 of Publications of the Newton Institute. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511526619.007"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"G. D. Plotkin. Call-by-name, call-by-value and the lambda calculus. Theoret. Comput. Sci., 1, 1975.","DOI":"10.1016\/0304-3975(75)90017-1"},{"key":"8_CR26","doi-asserted-by":"crossref","unstructured":"W. Taha. A sound reduction semantics for untyped CBN multi-stage computation: Or, the theory of MetaML is non-trivial. In Proceedings of the 2000 ACM SIGPLAN Workshop on Evaluation and Semantics-Based Program Manipulation (PEPM-00), N.Y., 2000. ACM Press.","DOI":"10.1145\/328690.328697"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44881-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T06:57:14Z","timestamp":1587365834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44881-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402541","9783540448815"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44881-0_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}