{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T23:06:26Z","timestamp":1773097586775,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540563938","type":"print"},{"value":"9783540475491","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56393-8_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:08:27Z","timestamp":1330254507000},"page":"36-50","source":"Crossref","is-referenced-by-count":6,"title":["Explicit cyclic substitutions"],"prefix":"10.1007","author":[{"given":"Kristoffer H\u00f8gsbro","family":"Rose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"M. Abadi, L. Cardelli, P.-L. Curien, and J.-J. L\u00e9vy, Explicit Substitutions, in [21], 31\u201346.","DOI":"10.1145\/96709.96712"},{"key":"3_CR2","unstructured":"S. Abramsky, The Lazy Lambda Calculus, ch. 4, in D. A. Turner (ed.), Research Topics in Functional Programming, Addison-Wesley, 1990, pp. 65\u2013116."},{"key":"3_CR3","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/115865.115878","volume-title":"PEPM '91-Symposium on Partial Evaluation and Semantics-based Program Manipulation","author":"Z. M. Ariola","year":"1991","unstructured":"Z. M. Ariola and Arvind, A Syntactic Approach to Program Transformations, in PEPM '91-Symposium on Partial Evaluation and Semantics-based Program Manipulation (Yale University, New Haven, Connecticut, USA), 17\u201319 June 1991, pp. 116\u2013129."},{"key":"3_CR4","unstructured":"H. Barendregt, The Lambda Calculus: Its Syntax and Semantics, revised edition, North-Holland, 1984."},{"key":"3_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume-title":"PARLE '87-Parallel Architectures and Languages Europe","author":"H. P. Barendregt","year":"1987","unstructured":"H. P. Barendregt, M. C. D. J. van Eekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer, and M. R. Sleep, Term Graph Rewriting, in J. W. de Bakker, A. J. Nijman. and P. C. Treleaven (eds.), PARLE '87-Parallel Architectures and Languages Europe (Eindhoven, The Netherlands), vol. II, LNCS no. 256, Springer-Verlag, June 1987, pp. 141\u2013158."},{"key":"3_CR6","first-page":"381","volume":"75","author":"N. G. Bruijn de","year":"1972","unstructured":"N. G. de Bruijn, Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation with application to the Church-Rosser theorem, Koninkijke Nederlandse Akademie van Wetenschappen, Series A, Mathematical Sciences 75 (1972), 381\u2013392.","journal-title":"Koninkijke Nederlandse Akademie van Wetenschappen, Series A, Mathematical Sciences"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"B. Courcelle, Fundamental Properties of Infinite Trees, Theoretical Computer Science 25 (1983), 95\u2013169.","journal-title":"Theoretical Computer Science"},{"key":"3_CR8","unstructured":"P.-L. Curien, An Abstract Framework for Environment Machines, Unpublished note from LIENS\/CNRS, July 1990."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"G. Gonthier, M. Abadi, and J.-J. L\u00e9vy, The Geometry of Optimal Lambda Reduction, in POPL '92\u2014Nineteenth Annual ACM Symposium on Principles of Programming Languages (Albuquerque, New Mexico), January 1992, pp. 1\u201314.","DOI":"10.1145\/143165.143172"},{"key":"3_CR10","unstructured":"K. Grue, Call-by-Mix: A Reduction Strategy for Pure \u03bb-calculus, Unpublished note from DIKU (University of Copenhagen), 1987."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"C. Hankin, Static Analysis of Term Graph Rewriting Systems, ESPRIT \u201cSemantique\u201d working paper, 1990.","DOI":"10.1007\/978-1-4471-3810-5_5"},{"issue":"no.2","key":"3_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF00976239","volume":"4","author":"C. A. R. R. Hoare","year":"1975","unstructured":"C. A. R. Hoare, Recursive Data Structures, Journal of Computer and Information Sciences 4 (1975), no. 2, 105\u2013132.","journal-title":"Journal of Computer and Information Sciences"},{"key":"3_CR13","series-title":"LNCS","first-page":"191","volume-title":"CAAP '90\u201415th Colloqvium on Trees and Algebra in Programming","author":"K. H. Holm","year":"1990","unstructured":"K. H. Holm, Graph Matching in Operational Semantics and Typing, in A. Arnold (ed.), CAAP '90\u201415th Colloqvium on Trees and Algebra in Programming (Copenhagen, Denmark), LNCS no. 431, Springer-Verlag, March 1990, pp. 191\u2013205."},{"key":"3_CR14","unstructured":"J. R. Kennaway, J. W. Klop, M. R. Sleep, and F. J. de Vries, On the Sdequacy of Graph Rewritng for Simulating Term Rewriting, in [24] ch. 8 (to appear)."},{"key":"3_CR15","unstructured":"P. W. M. Koopman, S. E. W. Smetsers, M. C. D. J. van Eekelen, and M. J. Plasmeijer, Efficient Graph Rewriting using the Annotated Functional Strategy, in [20], 225\u2013250, (available as nijmegen tech. report 91-25)."},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"J. Lamping, An Algorithm for Optimal Lambda Calculus Reduction, in [21], 16\u201330.","DOI":"10.1145\/96709.96711"},{"key":"3_CR17","unstructured":"J.-J. L\u00e9vy, Optimal Reductions in the Lambda Calculus, in J. P. Seldin and J. R. Hindley (eds.), To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, Academic Press, 1980, pp. 159\u2013191."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"L. Maranget, Optimal Derivations in Weak Lambda-Calculi and in Orthogonal Terms Rewriting Systems, in POPL '91\u2014Eightteenth Annual ACM Symposium on Principles of Programming Languages (Orlando, Florida), January 1991, pp. 255\u2013269.","DOI":"10.1145\/99583.99618"},{"key":"3_CR19","unstructured":"S. L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice-Hall, 1987."},{"key":"3_CR20","unstructured":"M. J. Plasmeijer and M. R. Sleep (eds.), SemaGraph '91 Symposium on the Semantics and Pragmatics of Generalized Graph Rewriting (Nijmegen, Holland), December 1991, (available as nijmegen tech. report 91\u201325)."},{"key":"3_CR21","unstructured":"POPL, POPL '90-Seventeenth Annual ACM Symposium on Principles of Programming Languages (San Francisco, California), January 1990."},{"key":"3_CR22","volume-title":"Speciale 92-1-9, DIKU","author":"K. H. Rose","year":"1992","unstructured":"K. H. Rose, GOS\u2014Graph Operational Semantics, Speciale 92-1-9, DIKU (University of Copenhagen), Universitetsparken 1, DK-2100 K\u00f8benhavn \u00d8, Denmark, March 1992, (56pp)."},{"key":"3_CR23","unstructured":"-, Graph-based Operational Semantics for Lazy Functional Languages, in [24] ch. 19 (to appear)."},{"key":"3_CR24","unstructured":"M. R. Sleep, M. J. Plasmeijer, and M. C. D. J. van Eekelen (eds.), Term Graph Rewriting: Theory and Practice, John Wiley & Sons, 1992 (to appear)."},{"key":"3_CR25","first-page":"440","volume-title":"LNCS no. 73","author":"J. Staples","year":"1978","unstructured":"J. Staples, A Graph-like Lambda Calculus for which Leftmost Outermost Reduction is Optimal, in V. Claus, H. Ehrig, and G. Rozenberg (eds.), 1978 International Workshop in Graph Grammars and their Application to Computer Science and Biology (Bad Honnef, F. R. Germany), LNCS no. 73, Springer-Verlag, 1978, pp. 440\u2013454."},{"key":"3_CR26","unstructured":"Y. Toyama, S. Smetsers, M. van Eekelen, and M. J. Plasmeijer, The Functional Strategy and Transitive Term Rewriting Systems, in [20], 99\u2013114, (available as nijmegen tech. report 91-25)."},{"key":"3_CR27","unstructured":"C. P. Wadsworth, Semantics and Pragmatics of the Lambda Calculus, Ph.D. Thesis, Programming Research Group, Oxford University, 1971."}],"container-title":["Lecture Notes in Computer Science","Conditional Term Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56393-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:48:19Z","timestamp":1742593699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56393-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540563938","9783540475491"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-56393-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}