{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,11]],"date-time":"2026-08-11T10:48:41Z","timestamp":1786445321431,"version":"3.56.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,4,1]],"date-time":"1991-04-01T00:00:00Z","timestamp":670464000000},"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":8143,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,4]]},"DOI":"10.1016\/0890-5401(91)90066-b","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"189-204","source":"Crossref","is-referenced-by-count":43,"title":["Telescopic mappings in typed lambda calculus"],"prefix":"10.1016","volume":"91","author":[{"given":"N.G.","family":"de Bruijn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90066-B_BIB1","series-title":"Mathematical Logic and Theoretical Computer Science","first-page":"15","article-title":"Lambda calculus extended with segments","volume":"Vol. 106","author":"Balsters","year":"1987"},{"key":"10.1016\/0890-5401(91)90066-B_BIB2","series-title":"Proceedings of the Third Italian Converence on Theoretical Computer Science","article-title":"Introduction to generalised type systems","author":"Barendregt","year":"1989"},{"key":"10.1016\/0890-5401(91)90066-B_BIB3","series-title":"Symposium on Automatic Demonstration","first-page":"29","article-title":"The mathematical language AUTOMATH, its usage, and some of its extensions","volume":"Vol. 125","author":"Bruijn","year":"1970"},{"key":"10.1016\/0890-5401(91)90066-B_BIB4","author":"Bruijn","year":"1971"},{"key":"10.1016\/0890-5401(91)90066-B_BIB5","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":"Bruijn","year":"1972","journal-title":"Nederl. Akad. Wetensch. Indag. Math."},{"key":"10.1016\/0890-5401(91)90066-B_BIB6","author":"Bruijn","year":"1978"},{"key":"10.1016\/0890-5401(91)90066-B_BIB7","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","first-page":"579","article-title":"A survey of the project Automath","author":"Bruijn","year":"1980"},{"key":"10.1016\/0890-5401(91)90066-B_BIB8","series-title":"Papers Dedicated to J. J. Feidel","first-page":"76","article-title":"Formalization of constructivity in Automath","author":"Bruijn","year":"1984"},{"key":"10.1016\/0890-5401(91)90066-B_BIB9","series-title":"Mathematical Logic and Theoretical Computer Science","first-page":"71","article-title":"Generalizing Automath by means of a lambda-typed lambda calculus","volume":"Vol. 106","author":"Bruijn","year":"1987"},{"key":"10.1016\/0890-5401(91)90066-B_BIB10","series-title":"Proceedings of Colog-88","first-page":"9","article-title":"The use of justification systems for integrated semantics","volume":"Vol. 417","author":"Bruijn","year":"1990"},{"key":"10.1016\/0890-5401(91)90066-B_BIB11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","article-title":"The calculus of constructions","volume":"76","author":"Coquand","year":"1988","journal-title":"Inform. and Computat."},{"key":"10.1016\/0890-5401(91)90066-B_BIB12","article-title":"The language theory of AUTOMATH","author":"Daalen","year":"1980"},{"key":"10.1016\/0890-5401(91)90066-B_BIB13","author":"Martin-L\u00f6f","year":"1984"},{"key":"10.1016\/0890-5401(91)90066-B_BIB14","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)70217-9","article-title":"Strong Normalization in a Typed Lambda Calculus with Lambda Structured Types","author":"Nederpelt","year":"1973"},{"key":"10.1016\/0890-5401(91)90066-B_BIB15","series-title":"Colloque International de Logique","first-page":"135","article-title":"Formalization of classical mathematics in AUTOMATH","author":"Zucker","year":"1975"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190066B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190066B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T01:25:43Z","timestamp":1548897943000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190066B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,4]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,4]]}},"alternative-id":["089054019190066B"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90066-b","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,4]]}}}