{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:20Z","timestamp":1761611300287},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540580850"},{"type":"electronic","value":"9783540484400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58085-9_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:11:40Z","timestamp":1330269100000},"page":"19-61","source":"Crossref","is-referenced-by-count":13,"title":["Checking algorithms for Pure Type Systems"],"prefix":"10.1007","author":[{"given":"L. S.","family":"Benthem Jutting","sequence":"first","affiliation":[]},{"given":"J.","family":"McKinna","sequence":"additional","affiliation":[]},{"given":"R.","family":"Pollack","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0956796800020025","volume":"1","author":"H. Barendregt","year":"1991","unstructured":"Henk Barendregt. Introduction to generalised type systems. J. Functional Programming, 1(2):125\u2013154, April 1991.","journal-title":"J. Functional Programming"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Henk Barendregt. Lambda calculi with types. In Gabbai Abramsky and Maibaum, editors, Handbook of Logic in Computer Science, volume II. Oxford University Press, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"3_CR3","volume-title":"PhD thesis","author":"S. Berardi","year":"1990","unstructured":"Stefano Berardi. Type Dependence and Constructive Mathematics. PhD thesis, Dipartimento di Informatica, Torino, Italy, 1990."},{"issue":"2\/3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Thierry Coquand and G\u00e9rard Huet. The calculus of constructions. Information and Computation, 76(2\/3):95\u2013120, February\/March 1988.","journal-title":"Information and Computation"},{"key":"3_CR5","volume-title":"Technical Report 77-236","author":"T. Chan","year":"1977","unstructured":"Tat-Hung Chan. An algorithm for checking PL\/CV arithmetical inferences. Technical Report 77-236, Computer Science Department, Cornell University, Ithaca, New York, 1977."},{"key":"3_CR6","unstructured":"Herman Geuvers. The calculus of constructions and higher order logic. In preparation."},{"key":"3_CR7","unstructured":"Herman Geuvers. Logics and Type Systems. PhD thesis, Department of Mathematics and Computer Science, University of Nijmegen, 1993. To appear."},{"issue":"2","key":"3_CR8","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1017\/S0956796800020037","volume":"1","author":"H. Geuvers","year":"1991","unstructured":"Herman Geuvers and Mark-Jan Nederhof. A modular proof of strong normalization for the calculus of constructions. Journal of Functional Programming, 1(2):155\u2013189, April 1991.","journal-title":"Journal of Functional Programming"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Leen Helmink. Goal directed proof construction in type theory. In Logical Frameworks. Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511569807.007"},{"key":"3_CR10","unstructured":"Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. In Proceedings of the Symposium on Logic in Computer Science, pages 194\u2013204, Ithaca, New York, June 1987."},{"issue":"1","key":"3_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/138027.138060","volume":"40","author":"R. Harper","year":"1992","unstructured":"Robert Harper, Furio Honsell, and Gordon Plotkin. A framework for defining logics. Journal of the ACM, 40(1):143\u2013184, 1992. Preliminary version in LICS'87.","journal-title":"Journal of the ACM"},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(90)90108-T","volume":"89","author":"R. Harper","year":"1991","unstructured":"Robert Harper and Robert Pollack. Type checking with universes. Theoretical Computer Science, 89:107\u2013136, 1991.","journal-title":"Theoretical Computer Science"},{"key":"3_CR13","unstructured":"G\u00e9rard Huet. Extending the calculus of constructions with Type:Type. unpublished manuscript, April 1987."},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"G\u00e9rard Huet. The constructive engine. In R. Narasimhan, editor, A Perspective in Theoretical Computer Science. World Scientific Publishing, 1989. Commemorative Volume for Gift Siromoney.","DOI":"10.1142\/0867"},{"key":"3_CR15","volume-title":"Technical Report ECS-LFCS-92-211","author":"Z. Luo","year":"1992","unstructured":"Zhaohui Luo and Robert Pollack. LEGO proof development system: User's manual. Technical Report ECS-LFCS-92-211, LFCS, Computer Science Dept., University of Edinburgh, The King's Buildings, Edinburgh EH9 3JZ, May 1992. Updated version."},{"key":"3_CR16","unstructured":"Zhaohui Luo. An Extended Calculus of Constructions. PhD thesis, Department of Computer Science, University of Edinburgh, June 1990."},{"key":"3_CR17","unstructured":"Per Martin-L\u00f6f. An intuitionistic theory of types. Technical report, University of Stockholm, 1972."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"James McKinna and Robert Pollack. Pure type systems formalized. In M.Bezem and J.F.Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, TLCA'93, pages 289\u2013305. Springer-Verlag, LNCS 664, March 1993.","DOI":"10.1007\/BFb0037113"},{"key":"3_CR19","unstructured":"James McKinna and Robert Pollack. Pure type systems formalized. Available by anonymous ftp from ftp.dcs.ed.ac.uk, directory export\/lego, file PTSproofs.tar.Z, 1994."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Frank Pfenning. Elf: A language for logic definition and verified metaprogramming. In Proceedings of the Fourth Annual Symposium on Logic in Computer Science, Asilomar, California, June 1989.","DOI":"10.1109\/LICS.1989.39186"},{"key":"3_CR21","unstructured":"R. Pollack. Typechecking in pure type systems. In Informal Proceedings of the 1992 Workshop on Types for Proofs and Programs, B\u00e5stad, Sweden, pages 271\u2013288, June 1992. available by ftp."},{"key":"3_CR22","unstructured":"Robert Pollack. The Theory of LEGO; A Proof Checker for the Extended Calculus of Constructions. PhD thesis, University of Edinburgh, 1994. In preparation."},{"issue":"1","key":"3_CR23","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1006\/inco.1993.1038","volume":"105","author":"L.S. Benthem Jutting van","year":"1993","unstructured":"L.S. van Benthem Jutting. Typing in pure type systems. Information and Computation, 105(1):30\u201341, July 1993.","journal-title":"Information and Computation"},{"key":"3_CR24","unstructured":"D. T. van Daalen. The Language Theory of Automath. PhD thesis, Technische Hogeschool Eindhoven, 1980."}],"container-title":["Lecture Notes in Computer Science","Types for Proofs and Programs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58085-9_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T15:44:11Z","timestamp":1713627851000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58085-9_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580850","9783540484400"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58085-9_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}