{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:08:48Z","timestamp":1761610128004,"version":"build-2065373602"},"reference-count":14,"publisher":"Elsevier BV","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":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(04)80539-5","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"35-48","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations"],"prefix":"10.1016","volume":"67","author":[{"given":"Gopalan","family":"Nadathur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1571-0661(04)80539-5_NEWBIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"1","author":"Abadi","year":"1991","journal-title":"Journal of Functional Programming"},{"issue":"5","key":"10.1016\/S1571-0661(04)80539-5_NEWBIB2","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1017\/S0956796800001945","article-title":"\u03bbv, a calculus of explicit substitutions which preserves strong normalization","volume":"6","author":"Benaissa","year":"1996","journal-title":"Journal of Functional Programming"},{"issue":"5","key":"10.1016\/S1571-0661(04)80539-5_NEWBIB3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/1385-7258(72)90034-0","article-title":"Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem","volume":"34","author":"de Bruijn","year":"1972","journal-title":"Indag. Math"},{"key":"10.1016\/S1571-0661(04)80539-5_NEWBIB4","doi-asserted-by":"crossref","unstructured":"R. David and B. Guillaume. A \u03bb-calculus with explicit weakening and explicit substitution. To appear in Mathematical Structure in Computer Science, 2000.","DOI":"10.1017\/S0960129500003224"},{"key":"10.1016\/S1571-0661(04)80539-5_NEWBIB5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1006\/inco.1999.2837","article-title":"Higher-order unification via explicit substitutions","volume":"157","author":"Dowek","year":"2000","journal-title":"Information and Computation"},{"issue":"4","key":"10.1016\/S1571-0661(04)80539-5_NEWBIB6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1017\/S0956796800003695","article-title":"The \u03bbse-calculus does not preserve strong normalisation","volume":"10","author":"Guillaume","year":"2000","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)80539-5_NEWBIB7","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed \u03bb-calculus","volume":"1","author":"Huet","year":"1975","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"10.1016\/S1571-0661(04)80539-5_NEWBIB8","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1017\/S0956796897002785","article-title":"Extending the \u03bb-calculus with explicit substitution which preserves strong normalization into a confluent calculus on open terms","volume":"7","author":"Kamareddine","year":"1997","journal-title":"Journal of Functional Programming"},{"key":"10.1016\/S1571-0661(04)80539-5_NEWBIB9","series-title":"Rewriting Techniques and Applications","article-title":"Tradeoffs in the intensional representation of lambda terms","author":"Liang","year":"2002"},{"key":"10.1016\/S1571-0661(04)80539-5_NEWBIB10","series-title":"Typed Lambda Calculi and Applications, number 902 in Lecture Notes in Computer Science","first-page":"328","article-title":"Typed \u03bb-calculi with explicit substitutions may not terminate","author":"Mellies","year":"1995"},{"issue":"4","key":"10.1016\/S1571-0661(04)80539-5_NEWBIB11","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1093\/logcom\/1.4.497","article-title":"A logic programming language with lambda-abstraction, function variables, and simple unification","volume":"1","author":"Miller","year":"1991","journal-title":"Journal of Logic and Computation"},{"key":"10.1016\/S1571-0661(04)80539-5_NEWBIB12","series-title":"Automated Deduction\u2013CADE-16, number 1632 in Lecture Notes in Artificial Intelligence","first-page":"287","article-title":"System description: Teyjus-a compiler and abstract machine based implementation of \u03bbProlog","author":"Nadathur","year":"1999"},{"issue":"1-2","key":"10.1016\/S1571-0661(04)80539-5_NEWBIB13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/S0304-3975(97)00184-9","article-title":"A notation for lambda terms: A generalization of environments","volume":"198","author":"Nadathur","year":"1998","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(04)80539-5_NEWBIB14","doi-asserted-by":"crossref","unstructured":"Z. Shao, C. League, and S. Monnier. Implementing typed intermediate languages. In Proc. 1998 ACM SIGPLAN International Conference on Functional Programming, pages 313\u2013323. ACM Press, September 1998.","DOI":"10.1145\/289423.289460"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805395?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805395?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:35Z","timestamp":1761609935000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":14,"alternative-id":["S1571066104805395"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80539-5","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The Suspension Notation for Lambda Terms and its Use in Metalanguage Implementations","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80539-5","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}