{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:03:44Z","timestamp":1725516224984},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705888"},{"type":"electronic","value":"9783540705901"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-70590-1_29","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"425-440","source":"Crossref","is-referenced-by-count":2,"title":["Reduction Under Substitution"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Endrullis","sequence":"first","affiliation":[]},{"given":"Roel","family":"de Vrijer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","volume-title":"Non-definability of \u03b4","author":"H.P. Barendregt","year":"1972","unstructured":"Barendregt, H.P.: Non-definability of \u03b4 (unpublished manuscript)(1972)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/malq.19740201902","volume":"20","author":"H.P. Barendregt","year":"1974","unstructured":"Barendregt, H.P.: Pairing without conventional restraints. Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik\u00a020, 289\u2013306 (1974)","journal-title":"Zeitschrift f\u00fcr mathematische Logik und Grundlagen der Mathematik"},{"key":"29_CR3","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, 2nd revised edn. Studies in Logic and the Foundations of Mathematics, vol.\u00a0103. North-Holland, Amsterdam (1984)","edition":"2"},{"key":"29_CR4","unstructured":"Berry, G.: S\u00e9quentialit\u00e9 de l\u2019\u00e9valuation formelle des \u03bb-expressions. In: Robinet, B. (ed.) Program Transformations, Troisi\u00e9me Colloque International sur la Programmation, pp. 65\u201378. Dunod (1978)"},{"key":"29_CR5","unstructured":"Berry, G.: Mod\u00e8les compl\u00e8tement ad\u00e9quats et stables des \u03bb-calculs typ\u00e9s. PhD thesis, Universit\u00e9 de Paris 7 (1979)"},{"key":"29_CR6","unstructured":"Byun, S., Kennaway, J.R., van Oostrom, V., de Vries, F.-J.: Separability and translatability of sequential term rewrite systems into the lambda calculus (unpublished) (1999)"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/inco.2000.2876","volume":"159","author":"I. Bethke","year":"2000","unstructured":"Bethke, I., Klop, J.W., de Vrijer, R.C.: Descendants and origins in term rewriting. Information and Computation\u00a0159, 59\u2013124 (2000)","journal-title":"Information and Computation"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1017\/S0956796899003548","volume":"9","author":"H.P. Barendregt","year":"1999","unstructured":"Barendregt, H.P., Statman, R.: Applications of Plotkin-terms: partitions and morphisms for closed terms. J. Funct. Prog.\u00a09, 565\u2013575 (1999)","journal-title":"J. Funct. Prog."},{"key":"29_CR9","unstructured":"van Daalen, D.T.: The Language Theory of Automath. PhD thesis, Technische Universiteit Eindhoven. Large parts of this thesis, including the treatment of RuS, have been reproduced. In: [NGdV94] (1980)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Glauert, J.R.W., Khasidashvili, Z.: Relative normalization in orthogonal expression reduction systems. In: Conditional Term Rewriting Systems, pp. 144\u2013165 (1994)","DOI":"10.1007\/3-540-60381-6_9"},{"key":"29_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BFb0029523","volume-title":"\u03bb-calculus and Computer Science Theory, Proceedings of the Symposium held in Rome","author":"J.-J. L\u00e9vy","year":"1975","unstructured":"L\u00e9vy, J.-J.: An algebraic interpretation of the \u03bb\u03b2 K-calculus and a labelled \u03bb-calculus. In: B\u00f6hm, C. (ed.) Lambda-Calculus and Computer Science Theory. LNCS, vol.\u00a037, pp. 147\u2013165. Springer, Heidelberg (1975)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BFb0026981","volume-title":"Category Theory and Computer Science","author":"P.-A. Melli\u00e8s","year":"1997","unstructured":"Melli\u00e8s, P.-A.: Axiomatic rewriting theory III: A factorisation theorem in rewriting theory. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol.\u00a01290, pp. 46\u201368. Springer, Heidelberg (1997)"},{"key":"29_CR13","first-page":"287","volume-title":"Proc. of the 14th Annual Symposium on Logic in Computer Science, LICS 1998","author":"P.-A. Melli\u00e8s","year":"1998","unstructured":"Melli\u00e8s, P.-A.: Axiomatic rewriting theory IV: A stability theorem in rewriting theory. In: Proc. of the 14th Annual Symposium on Logic in Computer Science, LICS 1998, pp. 287\u2013298. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"29_CR14","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Selected Papers on Automath","author":"R.P. Nederpelt","year":"1994","unstructured":"Nederpelt, R.P., Geuvers, J.H., de Vrijer, R.C.: Selected Papers on Automath. Studies in Logic and the Foundations of Mathematics, vol.\u00a0133. North-Holland, Amsterdam (1994)"},{"key":"29_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/3-540-62950-5_80","volume-title":"Rewriting Techniques and Applications","author":"V. Oostrom van","year":"1997","unstructured":"van Oostrom, V.: Finite family developments. In: Comon, H. (ed.) RTA 1997. LNCS, vol.\u00a01232, pp. 308\u2013322. Springer, Heidelberg (1997)"},{"key":"29_CR16","volume-title":"Term Rewriting Systems","author":"Terese","year":"2003","unstructured":"Terese: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"29_CR17","unstructured":"de Vrijer, R.C.: Surjective Pairing and Strong Normalization: Two Themes in Lambda Calculus. PhD thesis, Universiteit van Amsterdam (January 1987)"},{"key":"29_CR18","unstructured":"de Vrijer, R.C.: Barendregt\u2019s lemma. In: Barendsen, Geuvers, Capretta, Niqui (eds.) Reflections on Type Theory, Lambda Calculus, and the Mind, pp. 275\u2013284. Radboud University Nijmegen (2007)"}],"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-70590-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T08:02:26Z","timestamp":1557734546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70590-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540705888","9783540705901"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70590-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}