{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T22:56:09Z","timestamp":1765666569153},"reference-count":49,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0304-3975(93)90091-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"279-308","source":"Crossref","is-referenced-by-count":158,"title":["Combinatory reduction systems: introduction and survey"],"prefix":"10.1016","volume":"121","author":[{"given":"Jan Willem","family":"Klop","sequence":"first","affiliation":[]},{"given":"Vincent","family":"van Oostrom","sequence":"additional","affiliation":[]},{"given":"Femke","family":"van Raamsdonk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(93)90091-7_BIB1","first-page":"31","article-title":"Explicit substitutions","author":"Abadi","year":"1990","journal-title":"Proc. ACM Conf. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(93)90091-7_BIB2","series-title":"Technical Report","article-title":"A general Church\u2014Rosser theorem","author":"Aczel","year":"1978"},{"year":"1986","series-title":"An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof","author":"Andrews","key":"10.1016\/0304-3975(93)90091-7_BIB3"},{"key":"10.1016\/0304-3975(93)90091-7_BIB4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/malq.19740201902","article-title":"Pairing without conventional restraints","volume":"20","author":"Barendregt","year":"1974","journal-title":"Z. Math. Logik Grundlag. Math."},{"year":"1984","series-title":"The Lambda Calculus, its Syntax and Semantics","author":"Barendregt","key":"10.1016\/0304-3975(93)90091-7_BIB5"},{"key":"10.1016\/0304-3975(93)90091-7_BIB6","first-page":"321","article-title":"Functional programming and lambda-calculus","volume":"Vol. B","author":"Barendregt","year":"1990"},{"key":"10.1016\/0304-3975(93)90091-7_BIB7","first-page":"117","article-title":"Typed lambda-calculi","volume":"Vol. I","author":"Barendregt","year":"1992"},{"key":"10.1016\/0304-3975(93)90091-7_BIB8","series-title":"Technical Report","article-title":"A self-interpreter of \u03bb-calculus having a normal form","author":"Berarducci","year":"1992"},{"key":"10.1016\/0304-3975(93)90091-7_BIB9","series-title":"Proc. 3i\u00e8me Colloque Internat. sur la Programmation","article-title":"S\u00e9quentialit\u00e9 de l'\u00e9valuation formelle des \u03bb-expressions","author":"Berry","year":"1978"},{"key":"10.1016\/0304-3975(93)90091-7_BIB10","first-page":"80","article-title":"Combining algebra and higher-order types","author":"Breazu-Tannen","year":"1988","journal-title":"Proc. 3rd annual IEEE Symposium on Logic in Computer Science"},{"key":"10.1016\/0304-3975(93)90091-7_BIB11","series-title":"Proc. 16th Internat. Coll. on Automata, Languages and Programming","first-page":"137","article-title":"Polymorphic rewriting conserves algebraic strong normalization and confluence","volume":"Vol. 372","author":"Breazu-Tannen","year":"1989"},{"key":"10.1016\/0304-3975(93)90091-7_BIB12","article-title":"The Calculi of Lambda Conversion","volume":"Vol. 6","author":"Church","year":"1941"},{"year":"1956","series-title":"Introduction to Mathematical Logic","author":"Church","key":"10.1016\/0304-3975(93)90091-7_BIB13"},{"key":"10.1016\/0304-3975(93)90091-7_BIB14","series-title":"Research Notes in Theoretical Computer Science","article-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1986"},{"year":"1980","series-title":"Mathematical Theory of Program Correctness","author":"de Bakker","key":"10.1016\/0304-3975(93)90091-7_BIB15"},{"key":"10.1016\/0304-3975(93)90091-7_BIB16","series-title":"Formal Methods and Semantics, Handbook of Theoretical Computer Science, Vol. B","first-page":"243","article-title":"Rewrite systems","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(93)90091-7_BIB17","series-title":"Logic and Computer Science","first-page":"123","article-title":"On Girard's \u2018Candidats de reductibilit\u00e9\u2019","author":"Gallier","year":"1990"},{"key":"10.1016\/0304-3975(93)90091-7_BIB18","series-title":"To. H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"457","article-title":"Proofs of strong normalization","author":"Gandy","year":"1980"},{"year":"1987","series-title":"Proof Theory and Logical Complexity, Vol. I","author":"Girard","key":"10.1016\/0304-3975(93)90091-7_BIB19"},{"key":"10.1016\/0304-3975(93)90091-7_BIB20","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1090\/S0002-9947-1977-0444445-4","article-title":"The equivalence of complete reductions","volume":"229","author":"Hindley","year":"1977","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0304-3975(93)90091-7_BIB21","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1090\/S0002-9947-1978-0492300-7","article-title":"Standard and normal reductions","volume":"241","author":"Hindley","year":"1978","journal-title":"Trans. Amer. Math. Soc."},{"year":"1986","series-title":"Introduction to Combinators and \u03bb-Calculus, Vol. 1: London Mathematical Society Student Texts","author":"Hindley","key":"10.1016\/0304-3975(93)90091-7_BIB22"},{"year":"1990","key":"10.1016\/0304-3975(93)90091-7_BIB23"},{"key":"10.1016\/0304-3975(93)90091-7_BIB24","series-title":"Ph.D. Thesis","article-title":"\u03bb-rewriting","author":"Kahrs","year":"1991"},{"year":"1992","series-title":"Compilation of combinatory reduction systems","author":"Kahrs","key":"10.1016\/0304-3975(93)90091-7_BIB25"},{"issue":"2","key":"10.1016\/0304-3975(93)90091-7_BIB26","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0890-5401(89)90014-X","article-title":"Unique normal forms for lambda calculus with surjective pairing","volume":"80","author":"Klop","year":"1989","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(93)90091-7_BIB27","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0168-0072(89)90024-9","article-title":"Sequential evaluation strategies for parallel-or and related systems","volume":"43","author":"Kennaway","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0304-3975(93)90091-7_BIB28","article-title":"Expression reduction systems","volume":"I","author":"Khasidashvili","year":"1990"},{"key":"10.1016\/0304-3975(93)90091-7_BIB29","article-title":"Church\u2013Rosser theorem in orthogonal combinatory reduction systems","author":"Khasidashvili","year":"1992","journal-title":"INRIA Rocquencourt Report No. 1825"},{"key":"10.1016\/0304-3975(93)90091-7_BIB30","series-title":"Ph.D. Thesis","article-title":"Combinatory reduction systems","author":"Klop","year":"1980"},{"key":"10.1016\/0304-3975(93)90091-7_BIB31","series-title":"Handbook of Logic in Computer Science, Volume II","first-page":"1","article-title":"Term rewriting systems","author":"Klop","year":"1992"},{"key":"10.1016\/0304-3975(93)90091-7_BIB32","series-title":"Proc. Rome Conf. \u03bb-Calculus and Computer Science Theory","first-page":"147","article-title":"An algebraic interpretation of the \u03bb\u03b2K-calculus and a labelled \u03bb-calculus","volume":"Vol. 37","author":"L\u00e9vy","year":"1975"},{"key":"10.1016\/0304-3975(93)90091-7_BIB33","series-title":"Ph.D. Thesis","article-title":"Modular properties of term rewriting systems","author":"Middeldorp","year":"1990"},{"key":"10.1016\/0304-3975(93)90091-7_BIB34","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0022-0000(84)90023-0","article-title":"A complete inference system for a class of regular behaviours","volume":"28","author":"Milner","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(93)90091-7_BIB35","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0020-0190(92)90155-O","article-title":"Confluence of the lambda-calculus with left-linear algebraic rewriting","volume":"41","author":"M\u00fcller","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(93)90091-7_BIB36","series-title":"Ph.D. Thesis","article-title":"Strong normalization for a typed lambda-calculus with lambda structured types","author":"Nederpelt","year":"1973"},{"key":"10.1016\/0304-3975(93)90091-7_BIB37","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1109\/LICS.1991.151658","article-title":"Higher-order critical pairs","author":"Nipkow","year":"1991","journal-title":"Proc. 6th Ann IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(93)90091-7_BIB38","series-title":"Proc. Internat. Conf. on Typed Lambda Calculi and Applications","first-page":"306","article-title":"Orthogonal higher-order rewrite systems are confluent","volume":"Vol. 664","author":"Nipkow","year":"1993"},{"key":"10.1016\/0304-3975(93)90091-7_BIB39","unstructured":"V. van Oostrom and F. van Raamsdonk, Comparing CRSs and HRSs (in preparation)."},{"key":"10.1016\/0304-3975(93)90091-7_BIB40","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(93)90091-7_BIB41","series-title":"Proc. 2nd Scandinavian Logic Symposium","first-page":"235","article-title":"Ideas and results in proof theory","author":"Prawitz","year":"1971"},{"key":"10.1016\/0304-3975(93)90091-7_BIB42","series-title":"Proc. 5th Internat. Conf. on Rewrite Techniques and Applications","first-page":"168","article-title":"Confluence and superdevelopments","volume":"Vol. 690","author":"van Raamsdonk","year":"1993"},{"key":"10.1016\/0304-3975(93)90091-7_BIB43","first-page":"123","article-title":"A guide to polymorphic types","volume":"32","author":"Scedrov","year":"1990"},{"year":"1972","series-title":"Combinators, \u03bb-terms and Proof Theory","author":"Stenlund","key":"10.1016\/0304-3975(93)90091-7_BIB44"},{"key":"10.1016\/0304-3975(93)90091-7_BIB45","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0747-7171(89)80045-8","article-title":"Parallel reductions in \u03bb-calculus","volume":"7","author":"Takahashi","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(93)90091-7_BIB46","series-title":"Proc. Internat. Conf. on Typed Lambda Calculi and Applications","first-page":"406","article-title":"\u03bb-calculi with conditional rules","volume":"Vol. 664","author":"Takahashi","year":"1993"},{"key":"10.1016\/0304-3975(93)90091-7_BIB47","series-title":"Technical Report","article-title":"A theory of binding structures and applications to rewriting","author":"Talcott","year":"1991"},{"key":"10.1016\/0304-3975(93)90091-7_BIB48","series-title":"Proc. 4th Internat. Conf. on Rewriting Techniques and Applications","first-page":"25","article-title":"Rewriting, and equational unification: the higher-order cases","author":"Wolfram","year":"1991"},{"year":"1993","series-title":"The Clausal Theory of Types","author":"Wolfram","key":"10.1016\/0304-3975(93)90091-7_BIB49"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900917?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593900917?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:25:15Z","timestamp":1555115115000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593900917"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":49,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0304397593900917"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90091-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1993,12]]}}}