{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:54:43Z","timestamp":1725551683340},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540309116"},{"type":"electronic","value":"9783540324256"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11601548_19","type":"book-chapter","created":{"date-parts":[[2005,12,10]],"date-time":"2005-12-10T00:39:45Z","timestamp":1134175185000},"page":"368-403","source":"Crossref","is-referenced-by-count":2,"title":["Skew and \u03c9-Skew Confluence and Abstract B\u00f6hm Semantics"],"prefix":"10.1007","author":[{"given":"Zena M.","family":"Ariola","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Blom","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M.: Relating graph and term rewriting via B\u00f6hm models. Applicable Algebra in Engineering, Communication and Computing\u00a07(5) (1996)","DOI":"10.1007\/BF01293598"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(94)00185-L","volume":"146","author":"Z.M. Ariola","year":"1995","unstructured":"Ariola, Z.M., Arvind: Properties of a first-order functional language with sharing. Theoretical Computer Science\u00a0146, 69\u2013108 (1995)","journal-title":"Theoretical Computer Science"},{"key":"19_CR3","unstructured":"Ariola, Z.M., Blom, S.: Lambda calculi plus letrec. Technical Report CIS-TR-97-05, Department of computer and information science, University of Oregon"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BFb0014548","volume-title":"Theoretical Aspects of Computer Software","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Blom, S.: Cyclic lambda calculi. In: Ito, T., Abadi, M. (eds.) TACS 1997. LNCS, vol.\u00a01281, pp. 77\u2013106. Springer, Heidelberg (1997)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Blom, S.: Lambda calculi plus letrec. Technical Report IR-434, Department of Mathematics and Computer Science, Vrije Universiteit Amsterdam (October 1997)","DOI":"10.1007\/BFb0014548"},{"issue":"1-3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0168-0072(01)00104-X","volume":"117","author":"Z.M. Ariola","year":"2002","unstructured":"Ariola, Z.M., Blom, S.: Skew confluence and the lambda calculus with letrec. Annals of Pure and Applied Logic\u00a0117(1-3), 95\u2013168 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Felleisen, M.: The call-by-need lambda calculus. Journal of Functional Programming\u00a07(3) (1997)","DOI":"10.1017\/S0956796897002724"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Felleisen, M., Maraist, J., Odersky, M., Wadler, P.: The call-by-need lambda calculus. In: Proc. ACM Conference on Principles of Programming Languages, pp. 233\u2013246 (1995)","DOI":"10.1145\/199448.199507"},{"issue":"3,4","key":"19_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Z.M. Ariola","year":"1996","unstructured":"Ariola, Z.M., Klop, J.W.: Equational term graph rewriting. Fundamentae Informaticae\u00a026(3,4), 207\u2013240 (1996); Extended version: CWI Report CS-R9552.","journal-title":"Fundamentae Informaticae"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1006\/inco.1997.2651","volume":"139","author":"Z.M. Ariola","year":"1997","unstructured":"Ariola, Z.M., Klop, J.W.: Lambda calculus with explicit recursion. Information and computation\u00a0139(2), 154\u2013233 (1997)","journal-title":"Information and computation"},{"issue":"1\/2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1999.2824","volume":"156","author":"Z.M. Ariola","year":"2000","unstructured":"Ariola, Z.M., Klop, J.W., Plump, D.: Bisimilarity in term graphs rewriting. Information and Computation\u00a0156(1\/2), 2\u201324 (2000)","journal-title":"Information and Computation"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"PARLE Parallel Architectures and Languages Europe","author":"H. Barendregt","year":"1987","unstructured":"Barendregt, H., Brus, T., van Eekelen, M., Glauert, J., Kennaway, J., van Leer, M., Plasmeijer, M., Sleep, M.R.: Towards an intermediate language based on graph rewriting. In: de Bakker, J.W., Nijman, A.J., Treleaven, P.C. (eds.) PARLE 1987. LNCS, vol.\u00a0259. Springer, Heidelberg (1987)"},{"key":"19_CR13","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1984","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol.\u00a0103. Elsevier, Amsterdam (1984) (revised edition)"},{"key":"19_CR14","unstructured":"Blom, S.: Term Graph Rewriting - syntax and semantics. PhD thesis, Vrije Universiteit Amsterdam (2001)"},{"key":"19_CR15","unstructured":"Blom, S.: Lifting Infinite Normal Form Definitions from Term Rewriting to Term Graph Rewriting. In: TERMGRAPH 2002 - International Workshop on Term Graph Rewriting (2002)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Blom, S.: An approximation based approach to infinitary lambda calculi. In: van Oostrom (ed.) [33], pp. 221\u2013232 (2004)","DOI":"10.1007\/978-3-540-25979-4_16"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-56610-4_83","volume-title":"TAPSOFT \u201993: Theory and Practice of Software Development","author":"A. Corradini","year":"1993","unstructured":"Corradini, A.: Term rewriting in CT \u03a3. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol.\u00a0668, pp. 468\u2013484. Springer, Heidelberg (1993)"},{"key":"19_CR18","unstructured":"de Medeiros Santos, A.L.: Compilation by Transformation in Non-Strict Functional Languages. PhD thesis, University of Glasgow (July 1995)"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Dezani-Ciancaglini, M., Giovannetti, E.: From B\u00f6hm\u2019s theorem to observational equivalences: an informal account. Electronic Notes in Theoretical Computer Science, vol.\u00a050(2) (2001)","DOI":"10.1016\/S1571-0661(04)00167-7"},{"key":"19_CR20","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)"},{"issue":"1&2","key":"19_CR21","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(93)90090-G","volume":"121","author":"G. Kahn","year":"1993","unstructured":"Kahn, G., Plotkin, G.D.: Concrete domains. Theor. Comput. Sci.\u00a0121(1&2), 187\u2013277 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR22","first-page":"157","volume-title":"Term Graph Rewriting: Theory and Practice","author":"J.R. Kennaway","year":"1993","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: The adequacy of term graph rewriting for simulating term rewriting. In: Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.D.J. (eds.) Term Graph Rewriting: Theory and Practice, pp. 157\u2013168. John Wiley & Sons, Chichester (1993)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Infinitary lambda calculus. In: Proc. Rewriting Techniques and Applications, Kaiserslautern (1995)","DOI":"10.1007\/3-540-59200-8_62"},{"key":"19_CR24","doi-asserted-by":"crossref","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M.R., de Vries, F.J.: Transfinite reductions in orthogonal term rewriting systems. Information and Computation\u00a0119(1) (1995)","DOI":"10.1006\/inco.1995.1075"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Ketema, J.: B\u00f6hm-like trees for term rewriting systems. In: van Oostrom (ed.) [33], pp. 233\u2013248.","DOI":"10.1007\/978-3-540-25979-4_17"},{"key":"19_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-32033-3_32","volume-title":"Term Rewriting and Applications","author":"J. Ketema","year":"2005","unstructured":"Ketema, J., Simonsen, J.G.: Infinitary combinatory reduction systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 438\u2013452. Springer, Heidelberg (2005)"},{"key":"19_CR27","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"J.W. Klop","year":"1992","unstructured":"Klop, J.W.: Term rewriting systems. In: Abramsky, S., Gabbay, D., Maibaum, T. (eds.) Handbook of Logic in Computer Science, vol.\u00a0II, pp. 1\u2013116. Oxford University Press, Oxford (1992)"},{"key":"19_CR28","unstructured":"L\u00e9vy, J.-J.: R\u00e9ductions Correctes et Optimales dans le Lambda-Calcul. PhD thesis, Universite Paris VII (October 1978)"},{"key":"19_CR29","series-title":"Applications, Languages and Tools","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1142\/9789812815149_0001","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"D. Plump","year":"1999","unstructured":"Plump, D.: Term graph rewriting. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation. Applications, Languages and Tools, vol.\u00a02, ch.1, pp. 3\u201361. World Scientific, Singapore (1999)"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-45610-4_12","volume-title":"Rewriting Techniques and Applications","author":"P. Severi","year":"2002","unstructured":"Severi, P., de Vries, F.-J.: An extensional b\u00f6hm model. In: Tison, S. (ed.) RTA 2002. LNCS, vol.\u00a02378, pp. 159\u2013173. Springer, Heidelberg (2002)"},{"volume-title":"Term Graph Rewriting: Theory and Practice","year":"1993","key":"19_CR31","unstructured":"Sleep, M.R., Plasmeijer, M.J., van Eekelen, M.C.D.J. (eds.): Term Graph Rewriting: Theory and Practice. John Wiley & Sons, Chichester (1993)"},{"key":"19_CR32","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","volume-title":"Rewriting Techniques and Applications","year":"2004","unstructured":"van Oostrom, V. (ed.): RTA 2004. LNCS, vol.\u00a03091. Springer, Heidelberg (2004)"},{"key":"19_CR34","unstructured":"Wadsworth, C.: Semantics And Pragmatics Of The Lambda-Calculus. PhD thesis, University of Oxford (September 1971)"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Wadsworth, C.: The Relation between Computational and Denotational Properties for Scott\u2019s D\u2009\u221e\u2009-Models of the Lambda-Calculus. Theoretical Computer Science\u00a05 (1976)","DOI":"10.1137\/0205036"},{"key":"19_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0029522","volume-title":"Lambda-Calculus and Computer Science Theory","author":"P. Welch","year":"1975","unstructured":"Welch, P.: Continuous Semantics and Inside-out Reductions. In: B\u00f6hm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037. Springer, Heidelberg (1975)"}],"container-title":["Lecture Notes in Computer Science","Processes, Terms and Cycles: Steps on the Road to Infinity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11601548_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T09:26:08Z","timestamp":1586597168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11601548_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540309116","9783540324256"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/11601548_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}