{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:10:00Z","timestamp":1767928200586,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"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":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0167-6423(95)00021-6","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"167-177","source":"Crossref","is-referenced-by-count":46,"title":["An algorithm for type-checking dependent types"],"prefix":"10.1016","volume":"26","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/0167-6423(95)00021-6_BIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"1","author":"Abadi","year":"1991","journal-title":"J. Funct. Programming"},{"key":"10.1016\/0167-6423(95)00021-6_BIB2","series-title":"Structure and Interpretation of Computer Programs","author":"Abelson","year":"1986"},{"key":"10.1016\/0167-6423(95)00021-6_BIB3_1","unstructured":"L. Augustsson, Haskell B. User's manual available over WWW from"},{"key":"10.1016\/0167-6423(95)00021-6_BIB4","article-title":"Lambda calculi with types","volume":"Vol. II","author":"Barendregt","year":"1992"},{"key":"10.1016\/0167-6423(95)00021-6_BIB5","series-title":"Formal Description of Programming Concepts","article-title":"Typeful programming","author":"Cardelli","year":"1991"},{"key":"10.1016\/0167-6423(95)00021-6_BIB6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1017\/S0956796800000952","article-title":"A-translation and looping combinators in pure type system","volume":"4","author":"Coquand","year":"1994","journal-title":"J. Funct. Programming"},{"key":"10.1016\/0167-6423(95)00021-6_BIB7","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 Comput."},{"key":"10.1016\/0167-6423(95)00021-6_BIB8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1016\/0304-3975(91)90230-Y","article-title":"An abstract framework for environment machines","volume":"82","author":"Curien","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(95)00021-6_BIB9","series-title":"Logical Framework","first-page":"40","article-title":"A plea for weaker frameworks","author":"de Bruijn","year":"1991"},{"key":"10.1016\/0167-6423(95)00021-6_BIB10","article-title":"Edinburgh LCF \u2014 a Mechanised Logic of Computation","volume":"Vol. 78","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(95)00021-6_BIB11","first-page":"598","article-title":"Purely Functional Implementation of a Logic","volume":"Vol. 230","author":"Hanna","year":"1986"},{"key":"10.1016\/0167-6423(95)00021-6_BIB12","doi-asserted-by":"crossref","first-page":"81","DOI":"10.2307\/2266967","article-title":"Completeness in the theory of types","volume":"15","author":"Henkin","year":"1950","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0167-6423(95)00021-6_BIB13","article-title":"Introduction to Combinators and \u03bb-calculus","volume":"Vol. 1","author":"Hindley","year":"1986"},{"key":"10.1016\/0167-6423(95)00021-6_BIB14","series-title":"A Perspective in Theoretical Computer Science","article-title":"The Constructive Engine","author":"Huet","year":"1989"},{"key":"10.1016\/0167-6423(95)00021-6_BIB15","series-title":"Logic and Computer Science","first-page":"361","article-title":"Isabelle: The Next 700 Theorem Provers","volume":"Vol. 31","author":"Paulson","year":"1990"},{"key":"10.1016\/0167-6423(95)00021-6_BIB16","series-title":"Types for Proofs and Programs","first-page":"313","article-title":"Closure under Alpha Conversion","volume":"Vol. 806","author":"Pollack","year":"1993"},{"key":"10.1016\/0167-6423(95)00021-6_BIB17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(88)90149-1","article-title":"Substitution revisited","volume":"59","author":"Stoughton","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(95)00021-6_BIB18","series-title":"Denotational Semantics","author":"Stoy","year":"1977"},{"key":"10.1016\/0167-6423(95)00021-6_BIB19","article-title":"Formulation of Martin-L\u00f6f's Theory of Types with Explicit Substitution","author":"Tatsitro","year":"1993"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642395000216?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642395000216?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T13:20:57Z","timestamp":1556544057000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642395000216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":19,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0167642395000216"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(95)00021-6","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}