{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T06:57:40Z","timestamp":1776409060366,"version":"3.51.2"},"reference-count":49,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1988,2,1]],"date-time":"1988-02-01T00:00:00Z","timestamp":570672000000},"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":9298,"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":[[1988,2]]},"DOI":"10.1016\/0890-5401(88)90005-3","type":"journal-article","created":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T19:24:20Z","timestamp":1101929060000},"page":"95-120","source":"Crossref","is-referenced-by-count":621,"title":["The calculus of constructions"],"prefix":"10.1016","volume":"76","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]},{"given":"G\u00e9rard","family":"Huet","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(88)90005-3_BIB1","author":"Barendregt","year":"1980"},{"key":"10.1016\/0890-5401(88)90005-3_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0019-9958(83)80033-3","article-title":"Semantics for Classical AUTOMATH and Related Systems","volume":"59","author":"Barendregt","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(88)90005-3_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":"de Bruijn","year":"1970"},{"issue":"5","key":"10.1016\/0890-5401(88)90005-3_BIB4","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\/0890-5401(88)90005-3_BIB5","author":"de Bruijn","year":"1974","journal-title":"Some Extensions of Automath: The AUT-4 Family"},{"key":"10.1016\/0890-5401(88)90005-3_BIB6","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","article-title":"A survey of the project Automath","author":"de Bruijn","year":"1980"},{"key":"10.1016\/0890-5401(88)90005-3_BIB7","author":"Cardelli","year":"1986","journal-title":"A Polymorphic \u03bb-Calculus with Type: Type"},{"key":"10.1016\/0890-5401(88)90005-3_BIB8","author":"Cardelli","year":"1985","journal-title":"On Understanding Types, Data Abstraction, and Polymorphism"},{"key":"10.1016\/0890-5401(88)90005-3_BIB9","doi-asserted-by":"crossref","DOI":"10.2307\/1968337","article-title":"A set of postulates for the foundation of logic","author":"Church","year":"1932","journal-title":"Ann. Math."},{"issue":"1","key":"10.1016\/0890-5401(88)90005-3_BIB10","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0890-5401(88)90005-3_BIB11","author":"Church","year":"1941"},{"key":"10.1016\/0890-5401(88)90005-3_BIB12","author":"Constable","year":"1986"},{"key":"10.1016\/0890-5401(88)90005-3_BIB13","author":"Constable","year":"1983"},{"key":"10.1016\/0890-5401(88)90005-3_BIB14","series-title":"Proc. Logic of Programs","article-title":"Recursive definitions in type theory","volume":"Vol. 193","author":"Constable","year":"1985"},{"key":"10.1016\/0890-5401(88)90005-3_BIB15","article-title":"Une th\u00e9orie des constructions","author":"Coquand","year":"1985"},{"key":"10.1016\/0890-5401(88)90005-3_BIB16","series-title":"Logic in Computer Science Conference","article-title":"An analysis of Girard's paradox","author":"Coquand","year":"1986"},{"key":"10.1016\/0890-5401(88)90005-3_BIB17","series-title":"presented at the International Symposium on Semantics of Data Types","article-title":"A Theory of Constructions","author":"Coquand","year":"1984"},{"key":"10.1016\/0890-5401(88)90005-3_BIB18","series-title":"EUROCAL85, Linz","article-title":"Constructions: A higher order proof system of mechanizing mathematics","volume":"Vol. 203","author":"Coquand","year":"1985"},{"key":"10.1016\/0890-5401(88)90005-3_BIB19","series-title":"Concepts Math\u00e9matiques et Informatiques Formalis\u00e9s dans le Calcul des Constructions, Colloque de Logique","author":"Coquand","year":"1985"},{"key":"10.1016\/0890-5401(88)90005-3_BIB20","volume":"Vol. I","author":"Curry","year":"1958"},{"key":"10.1016\/0890-5401(88)90005-3_BIB21","article-title":"The Language Theory of Automath","author":"Van Daalen","year":"1980"},{"key":"10.1016\/0890-5401(88)90005-3_BIB22","author":"Fairbairn","year":"1985","journal-title":"Design and Implementation of a Simple Typed Language Based on the Lambda-Calculus"},{"key":"10.1016\/0890-5401(88)90005-3_BIB23","series-title":"Proceedings of the Second Scandinavian Logic Symposium","first-page":"63","article-title":"Une extension de l'interpr\u00e9tation de G\u00f6del \u00e0 l'analyse, et son application \u00e0 l'\u00e9mination des coupures dans l'analyse et la th\u00e9orie des types","author":"Girard","year":"1970"},{"key":"10.1016\/0890-5401(88)90005-3_BIB24","article-title":"Interpr\u00e9tation fonctionnelle et \u00e9limination des coupures dans l'arithm\u00e9tique d'ordre sup\u00e9rieure","author":"Girard","year":"1972"},{"key":"10.1016\/0890-5401(88)90005-3_BIB25","article-title":"Edinburgh LCF","volume":"Vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/0890-5401(88)90005-3_BIB26_1","author":"Howard","year":"1969","journal-title":"The Formulae-as-Types Notion of Construction"},{"key":"10.1016\/0890-5401(88)90005-3_BIB26_2","series-title":"To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism","year":"1980"},{"key":"10.1016\/0890-5401(88)90005-3_BIB27","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","article-title":"A unification algorithm for typed lambda calculus","volume":"1.1","author":"Huet","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(88)90005-3_BIB28","author":"Jutting","year":"1976"},{"key":"10.1016\/0890-5401(88)90005-3_BIB29","author":"van Benthem Jutting","year":"1984","journal-title":"The Language Theory of \u039b\u221d a Typed \u03bb-Calculus Where Terms Are Types"},{"key":"10.1016\/0890-5401(88)90005-3_BIB30","author":"Kleene","year":"1952"},{"key":"10.1016\/0890-5401(88)90005-3_BIB31","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1090\/conm\/030\/749773","article-title":"Aspects of higher order categorical logic","volume":"30","author":"Lambek","year":"1984","journal-title":"Contemp. Math."},{"key":"10.1016\/0890-5401(88)90005-3_BIB32","author":"Martin-L\u00f6f","year":"1971"},{"key":"10.1016\/0890-5401(88)90005-3_BIB33","series-title":"Paper read at the Orl\u00e9ans Logic Conference","article-title":"About Models for Intuitionistic Type Theories and the Notion of Definitional Equality","author":"Martin-L\u00f6f","year":"1972"},{"key":"10.1016\/0890-5401(88)90005-3_BIB34","first-page":"73","article-title":"An intuitionistic theory of types: Predicative Part","volume":"Vol. 73","author":"Martin-L\u00f6f","year":"1974"},{"key":"10.1016\/0890-5401(88)90005-3_BIB35","first-page":"153","article-title":"Constructive mathematics and computer programming","volume":"Vol. 6","author":"Martin-L\u00f6f","year":"1980"},{"key":"10.1016\/0890-5401(88)90005-3_BIB36","article-title":"Intuitionistic type theory","author":"Martin-L\u00f6f","year":"1984","journal-title":"Studies in Proof Theory, Lecture Notes, Bibliopolis, Naples"},{"key":"10.1016\/0890-5401(88)90005-3_BIB37","article-title":"An Investigation of a Programming Language with a Polymorphic Type Structure","author":"McCraken","year":"1979"},{"key":"10.1016\/0890-5401(88)90005-3_BIB38","doi-asserted-by":"crossref","DOI":"10.1016\/S0049-237X(08)70217-9","article-title":"Strong Normalization in a Typed \u03bb Calculus with \u03bb Structured Types","author":"Nederpelt","year":"1973"},{"key":"10.1016\/0890-5401(88)90005-3_BIB39","series-title":"5th Conference on Automated deduction","article-title":"An approach to theorem proving on the basis of a typed \u03bb-calculus","volume":"Vol. 87","author":"Nederpelt","year":"1980"},{"key":"10.1016\/0890-5401(88)90005-3_BIB40","series-title":"Programming Symposium, Paris","first-page":"408","article-title":"Towards a theory of type structure","volume":"Vol. 19","author":"Reynolds","year":"1974"},{"key":"10.1016\/0890-5401(88)90005-3_BIB41","series-title":"International Symposium on Semantics of Data Types","article-title":"Polymorphism is not set-theoretic","author":"Reynolds","year":"1984"},{"key":"10.1016\/0890-5401(88)90005-3_BIB42","series-title":"Symposium on Automatic Demonstration","article-title":"Constructive validity","volume":"Vol. 125","author":"Scott","year":"1970"},{"key":"10.1016\/0890-5401(88)90005-3_BIB43","doi-asserted-by":"crossref","DOI":"10.1016\/0003-4843(79)90020-2","article-title":"Progress report on generalized functionality","volume":"17","author":"Seldin","year":"1979","journal-title":"Ann. Math. Logic."},{"key":"10.1016\/0890-5401(88)90005-3_BIB44","author":"Stenlund","year":"1972"},{"key":"10.1016\/0890-5401(88)90005-3_BIB45","series-title":"Logic Colloquium","article-title":"A realizability interpretation of the theory of species","volume":"Vol. 453","author":"Tait","year":"1975"},{"key":"10.1016\/0890-5401(88)90005-3_BIB46","doi-asserted-by":"crossref","DOI":"10.4099\/jjm1924.23.0_39","article-title":"On a generalized logic calculus","volume":"23","author":"Takeuti","year":"1953","journal-title":"Japan J. Math."},{"key":"10.1016\/0890-5401(88)90005-3_BIB47","article-title":"Proof theory","volume":"81","author":"Takeuti","year":"1975","journal-title":"Stud. Logic"},{"key":"10.1016\/0890-5401(88)90005-3_BIB48","author":"Whitehead","year":"1911"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540188900053?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540188900053?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T13:28:25Z","timestamp":1549027705000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540188900053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,2]]},"references-count":49,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1988,2]]}},"alternative-id":["0890540188900053"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(88)90005-3","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1988,2]]}}}