{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T06:42:28Z","timestamp":1750488148997},"reference-count":32,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0168-0072(01)00104-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:21:05Z","timestamp":1027657265000},"page":"95-168","source":"Crossref","is-referenced-by-count":22,"title":["Skew confluence and the lambda calculus with letrec"],"prefix":"10.1016","volume":"117","author":[{"given":"Zena M.","family":"Ariola","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Blom","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0168-0072(01)00104-X_BIB1","unstructured":"Z.M. Ariola, S. Blom, Lambda calculi plus letrec, Technical Report CIS-TR-97-05, Department of Computer and Information Science, University of Oregon, http:\/\/www.cs.uoregon.edu\/\u223c ariola\/cycles.html."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB2","doi-asserted-by":"crossref","unstructured":"Z.M. Ariola, S. Blom, Cyclic lambda calculi, Proc. TACS 94, Sendai, Japan, 1997.","DOI":"10.1007\/BFb0014548"},{"issue":"1","key":"10.1016\/S0168-0072(01)00104-X_BIB3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"4","author":"Abadi","year":"1991","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB4","doi-asserted-by":"crossref","unstructured":"Z.M. Ariola, J.W. Klop, Lambda calculus with explicit recursion, Information and Computation 139 (1997) 154\u2013233. Department of Computer and Information Science, University of Oregon.","DOI":"10.1006\/inco.1997.2651"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB5","doi-asserted-by":"crossref","unstructured":"Z.M. Ariola, J.W. Klop, Cyclic lambda graph rewriting, Proc. 9th Symp. on Logic in Computer Science (LICS\u201994), Paris, France, 1994, pp. 416\u2013425.","DOI":"10.1109\/LICS.1994.316066"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB6","doi-asserted-by":"crossref","unstructured":"Z.M. Ariola, J.W. Klop, Equational term graph rewriting, Fund. Inform. 26(3,4):207\u2013240, 1996. Extended version: CWI Report CS-R9552.","DOI":"10.3233\/FI-1996-263401"},{"issue":"2","key":"10.1016\/S0168-0072(01)00104-X_BIB7","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1006\/inco.1997.2651","article-title":"Lambda calculus with explicit recursion","volume":"139","author":"Ariola","year":"1997","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB8","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1017\/S0960129500000566","article-title":"Interaction systems I: The theory of optimal reductions","volume":"4","author":"Asperti","year":"1994","journal-title":"Math. Structures for Comput. Sci."},{"issue":"5","key":"10.1016\/S0168-0072(01)00104-X_BIB9","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF01293598","article-title":"Relating graph and term rewriting via B\u00f6hm models","volume":"7","author":"Ariola","year":"1996","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB10","series-title":"The Lambda Calculus: Its Syntax and Semantics","author":"Barendregt","year":"1984"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB11","doi-asserted-by":"crossref","unstructured":"A. Berarducci, Infinite \u03bb-calculus and non-sensible \u03bb-models, in: Logic and Algebra. Lecture notes in pure and applied Mathematics 180, Marcel Dekker, New York, 1996, pp. 339\u2013378.","DOI":"10.1201\/9780203748671-17"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB12","unstructured":"S.C.C. Blom, Term graph rewriting \u2014 syntax and semantics, Ph.D. Thesis, Vrije Universiteit Amsterdam, http:\/\/www.cwi.nl\/\u223csccblom\/publications, 2001."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB13","doi-asserted-by":"crossref","unstructured":"Z. Benaissa, P. Lescanne, K.H. Rose, Modeling sharing and recursion for weak reduction strategies using explicit substitution, PLIP\u201996, 1996.","DOI":"10.7146\/brics.v3i56.18681"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB14","first-page":"243","article-title":"Rewrite systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB15","unstructured":"A.L. de Medeiros Santos, Compilation by transformation in non-strict functional languages, Ph.D. Thesis, University of Glasgow, July 1995."},{"issue":"4","key":"10.1016\/S0168-0072(01)00104-X_BIB16","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1145\/322217.322230","article-title":"Confluent reductions: abstract properties and applications to term rewriting systems","volume":"27","author":"Huet","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB17","unstructured":"J.R. Kennaway, J.W. Klop, M.R. Sleep, F.J. de Vries, Infinitary lambda calculus, Proc. Rewriting Techniques and Applications, Kaiserslautern, 1995."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB18","first-page":"1","article-title":"Term rewriting systems","volume":"Vol. II","author":"Klop","year":"1992"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB19","doi-asserted-by":"crossref","unstructured":"Y. Lafont, Interaction nets, Proc. ACM Conf. on Principles of Programming Languages, San Francisco, 1990.","DOI":"10.1145\/96709.96718"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB20","doi-asserted-by":"crossref","unstructured":"P. Lescanne, From \u03bb\u03c3 to \u03bb v a journey through calculi of explicit substitutions, Proc. 21st Symposium on Principles of Programming Languages (POPL \u201994), Portland, OR, 1994, pp. 60\u201369.","DOI":"10.1145\/174675.174707"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB21","unstructured":"J.-J. L\u00e9vy, R\u00e9ductions Corrects et Optimales dans le Lambda-Calcul., Ph.D. Thesis, Universite Paris VII, October 1978."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB22","unstructured":"I.C. Mackie, The geometry of implementation, Ph.D. Thesis, University of London, 1994."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB23","doi-asserted-by":"crossref","unstructured":"J. Niehren, Functional computation as concurrent computation, Proc. ACM Conference on Principles of Programming Languages, 1996, pp. 333\u2013343.","DOI":"10.1145\/237721.237801"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB24","series-title":"The Implementation of Functional Programming Languages","author":"Peyton Jones","year":"1987"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB25","article-title":"A fully-lazy lambda lifter in haskell","volume":"21","author":"Peyton Jones","year":"1991","journal-title":"Software Practice Experience"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB26","series-title":"Proc. 3rd Internat. Workshop on Conditional Term Rewriting Systems (CTRS-92), Pont-\u00e0-Mousson, France","first-page":"36","article-title":"Explicit cyclic substitutions","volume":"Vol. 656","author":"Rose","year":"1992"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB27","doi-asserted-by":"crossref","unstructured":"P. Selinger, Order-incompleteness and finite lambda models, Proc. Symp. on Logic in Computer Science (LICS\u201996), 1996.","DOI":"10.1109\/LICS.1996.561459"},{"key":"10.1016\/S0168-0072(01)00104-X_BIB28","unstructured":"D. Sangiorgi, R. Milner, Techniques of \u201cweak bisimulation up to\u201d, Technical Report, 1993."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB29","unstructured":"J.E.W. Smetsers, Graph rewriting and functional languages, Ph.D. Thesis, University of Nijmegen, 1993."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB30","unstructured":"V. Van Oostrom, Confluence for abstract and higher-order rewriting, Ph.D. Thesis, Vrije Universiteit, 1994."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB31","unstructured":"C. Wadsworth. Semantics and Pragmatics of the lambda-calculus, Ph.D. Thesis, University of Oxford, 1971."},{"key":"10.1016\/S0168-0072(01)00104-X_BIB32","doi-asserted-by":"crossref","unstructured":"P.H. Welch, Continuous semantics and inside-out reductions, in: \u03bb-Calculus and Computer Science Theory, Italy, Lecture Notes in Computer Science, Vol. 37, eds. G. Goos and J. Hartmanis, Springer, Berlin, March 1975.","DOI":"10.1007\/BFb0029522"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016800720100104X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016800720100104X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T14:43:32Z","timestamp":1580913812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016800720100104X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":32,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S016800720100104X"],"URL":"https:\/\/doi.org\/10.1016\/s0168-0072(01)00104-x","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}