{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:43:36Z","timestamp":1725565416289},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221531"},{"type":"electronic","value":"9783540259794"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25979-4_17","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T01:32:53Z","timestamp":1284168773000},"page":"233-248","source":"Crossref","is-referenced-by-count":3,"title":["B\u00f6hm-Like Trees for Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Jeroen","family":"Ketema","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H.P. Barendregt","year":"1985","unstructured":"Barendregt, H.P.: The Lambda Calculus: Its Syntax and Semantics, 2nd edn. Elsevier Science, Amsterdam (1985)","edition":"2"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029523","volume-title":"Lambda-Calculus and Computer Science Theory","author":"J.J. L\u00e9vy","year":"1975","unstructured":"L\u00e9vy, J.J.: An algebraic interpretation of the \u03bb\u03b2K-calculus and the labelled \u03bb- calculus. In: B\u00f6hm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037, pp. 147\u2013165. Springer, Heidelberg (1975)"},{"key":"17_CR3","first-page":"339","volume-title":"Logic and Algebra, Marcel Dekker","author":"A. Berarducci","year":"1996","unstructured":"Berarducci, A.: Infinite \u03bb-calculus and non-sensible models. In: Ursini, A., Aglian\u00f2, P. (eds.) Logic and Algebra, Marcel Dekker, pp. 339\u2013378. Marcel Dekker, New York (1996)"},{"key":"17_CR4","unstructured":"L\u00e9vy, J.J.: R\u00e9ductions correctes et optimales dans le lambda-calcul. PhD thesis, Universit\u00e9 de Paris VII (1978)"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","volume":"12","author":"M. Hyland","year":"1976","unstructured":"Hyland, M.: A syntactic characterization of the equality in some models for the lambda calculus. Journal of the London Mathematical Society\u00a012(2), 361\u2013370 (1976)","journal-title":"Journal of the London Mathematical Society"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C.P. Wadsworth","year":"1976","unstructured":"Wadsworth, C.P.: The relation between computational and denotational properties for Scott\u2019s D\u221e-models of the lambda-calculus. SIAM Journal on Computing\u00a05, 488\u2013521 (1976)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"J.R. Kennaway","year":"1997","unstructured":"Kennaway, J.R., Klop, J.W., Sleep, M., de Vries, F.J.: Infinitary lambda calculus. Theoretical Computer Science\u00a0175, 93\u2013125 (1997)","journal-title":"Theoretical Computer Science"},{"key":"17_CR8","unstructured":"Blom, S.C.C.: Term Graph Rewriting: syntax and semantics. PhD thesis, Vrije Universiteit Amsterdam (2001)"},{"key":"17_CR9","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, 95\u2013168 (2002)","journal-title":"Annals of Pure and Applied Logic"},{"key":"17_CR10","first-page":"169","volume-title":"Algebraic methods in semantics","author":"G. Boudol","year":"1985","unstructured":"Boudol, G.: Computational semantics of term rewriting systems. In: Nivat, M., Reynolds, J.C. (eds.) Algebraic methods in semantics, pp. 169\u2013236. Cambridge University Press, Cambridge (1985)"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF01293598","volume":"7","author":"Z.M. Ariola","year":"1996","unstructured":"Ariola, Z.M.: Relating graph and term rewriting via B\u00f6hm models. Applicable Algebra in Engineering, Communication and Computing\u00a07, 401\u2013426 (1996)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"17_CR12","unstructured":"Kennaway, R., van Oostrom, V., de Vries, F.J.: Meaningless terms in rewriting. The Journal of Functional and Logic Programming\u00a01 (1999)"},{"key":"17_CR13","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139172752","volume-title":"Term Rewriting and All That","author":"F. Baader","year":"1998","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)"},{"key":"17_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139166386","volume-title":"Mathematical Theory of Domains","author":"V. Stoltenberg-Hansen","year":"1994","unstructured":"Stoltenberg-Hansen, V., Lindstr\u00f6m, I., Griffor, E.R.: Mathematical Theory of Domains. Cambridge University Press, Cambridge (1994)"},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0747-7171(08)80124-1","volume":"12","author":"J.W. Klop","year":"1991","unstructured":"Klop, J.W., Middeldorp, A.: Sequentiality in orthogonal term rewriting systems. Journal of Symbolic Computation\u00a012, 161\u2013195 (1991)","journal-title":"Journal of Symbolic Computation"},{"key":"17_CR16","first-page":"395","volume-title":"Computational Logic","author":"G. Huet","year":"1991","unstructured":"Huet, G., L\u00e9vy, J.J.: Computations in orthogonal rewriting systems. In: Lassez, J.L., Plotkin, G. (eds.) Computational Logic, pp. 395\u2013443. MIT Press, Cambridge (1991)"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25979-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T09:48:32Z","timestamp":1553075312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-25979-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221531","9783540259794"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25979-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}