{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:19:44Z","timestamp":1725664784949},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540605799"},{"type":"electronic","value":"9783540477709"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60579-7_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:42:38Z","timestamp":1330288958000},"page":"60-82","source":"Crossref","is-referenced-by-count":2,"title":["The metatheory of UTT"],"prefix":"10.1007","author":[{"given":"Healfdene","family":"Goguen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"4_CR1","unstructured":"R. Backhouse. On the meaning and construction of the rules in Martin-L\u00f6f's theory of types. In A. Avron et al., editors, Workshop on General Logic. LFCS Report Series, ECS-LFCS-88-52, Dept. of Computer Science, University of Edinburgh, 1988."},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"H. Barendregt. Lambda calculi with types. In S. Abramsky, D. M. Gabbai, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford University Press, 1991.","DOI":"10.1093\/oso\/9780198537618.003.0002"},{"key":"4_CR3","unstructured":"T. Coquand. An analysis of Girard's paradox. In Proc. of the Symposium on Logic in Computer Science, pages 227\u2013236, Boston, June 1986."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"T. Coquand. An algorithm for testing conversion in type theory. In G. Huet and G. Plotkin, editors, Logical Frameworks. Cambridge University Press, 1991.","DOI":"10.1017\/CBO9780511569807.011"},{"key":"4_CR5","unstructured":"T. Coquand and J. Gallier. A proof of strong normalization for the theory of constructions using a Kripke-like interpretation. In Workshop on Logical Frameworks-Preliminary Proceedings, 1990."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"T. Coquand and C. Paulin-Mohring. Inductively defined types. Lecture Notes In Computer Science, 417, 1990.","DOI":"10.1007\/3-540-52335-9_47"},{"key":"4_CR7","unstructured":"P. Dybjer. An inversion principle for Martin-L\u00f6f's type theory. In P. Dybjer et al., editors, Workshop on Programming Logic. Programming Methodology Group, Report 54, 1989."},{"key":"4_CR8","volume-title":"PhD thesis","author":"H. Geuvers","year":"1993","unstructured":"H. Geuvers. Logics and Type Systems. PhD thesis, Katholieke Universiteit Nijmegen, Sept. 1993."},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"H. Goguen. A Typed Operational Semantics for Type Theory. PhD thesis, University of Edinburgh, Aug. 1994.","DOI":"10.1007\/BFb0014053"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"H. Goguen. Typed operational semantics. To appear in Proceedings of the International Conference on Typed Lambda Calculi and Applications, 1995.","DOI":"10.1007\/BFb0014053"},{"issue":"3","key":"4_CR11","doi-asserted-by":"crossref","first-page":"782","DOI":"10.2307\/2274330","volume":"50","author":"G. Koletsos","year":"1985","unstructured":"G. Koletsos. Church-Rosser theorem for typed functional systems. Journal of Symbolic Logic, 50(3):782\u2013790, 1985.","journal-title":"Journal of Symbolic Logic"},{"key":"4_CR12","unstructured":"C. L\u00f6fwall and G. Sj\u00f6din. Strong normalisability in Martin-L\u00f6f's type theory. Technical Report R91:09, SICS, 1991."},{"key":"4_CR13","unstructured":"Z. Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, Nov. 1990."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Z. Luo. A unifying theory of dependent types: the schematic approach. In Proceedings of the Symposium on Logical Foundations of Computer Science, volume 620 of Lecture Notes in Computer Science. Springer-Verlag, 1992.","DOI":"10.1007\/BFb0023883"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Z. Luo. Program specification and data refinement in type theory. Mathematical Structures in Computer Science, 3(3), 1993.","DOI":"10.1017\/S0960129500000256"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Z. Luo. Computation and Reasoning. Oxford University Press, 1994.","DOI":"10.1093\/oso\/9780198538356.001.0001"},{"key":"4_CR17","unstructured":"P. Martin-L\u00f6f. An intuitionistic theory of types, 1972. Unpublished manuscript."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"J. McKinna. Deliverables: a categorical approach to program development in type theory. PhD thesis, University of Edinburgh, 1992.","DOI":"10.1007\/3-540-57182-5_3"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"J. McKinna and R. Burstall. Deliverables: a categorical approach to program development in type theory. Proc of Mathematical Foundations of Computer Science, LNCS 711, 1993.","DOI":"10.1007\/3-540-57182-5_3"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"J. McKinna and R. Pollack. Pure type systems formalized. In M. Bezem and J. F. Groote, editors, Proceedings of the International Conference on Typed Lambda Calculi and Applications, pages 289\u2013305. Springer-Verlag, LNCS 664, Mar. 1993.","DOI":"10.1007\/BFb0037113"},{"key":"4_CR21","unstructured":"B. Nordstr\u00f6m, K. Petersson, and J. Smith. Programming in Martin-L\u00f6f's Type Theory: An Introduction. Oxford University Press, 1990."},{"key":"4_CR22","unstructured":"E. Ritter. Categorical Abstract Machine for Higher-Order Typed Lambda Calculus. PhD thesis, University of Cambridge, Sept. 1992."},{"key":"4_CR23","unstructured":"A. Salvesen. The Church-Rosser property for pure type systems with \u03b2\u03bb-reduction, Nov. 1991. Unpublished manuscript."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"T. Streicher. Semantics of Type Theory: Correctness, Completeness and Independence Results. Birkh\u00e4user, 1991.","DOI":"10.1007\/978-1-4612-0433-6"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"W. W. Tait. Intensional interpretation of functionals of finite type I. Journal of Symbolic Logic, 32, 1967.","DOI":"10.2307\/2271658"},{"key":"4_CR26","unstructured":"L. van Benthem Jutting, J. McKinna, and R. Pollack. Typechecking in pure type systems. In H. Barendregt and T. Nipkow, editors, Types for Proofs and Programming. Springer-Verlag, 1993."},{"key":"4_CR27","unstructured":"B. Werner. Une Th\u00e9orie des Constructions Inductives. PhD thesis, Universit\u00e9 Paris 7, 1994."}],"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-60579-7_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T17:01:00Z","timestamp":1713632460000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60579-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540605799","9783540477709"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-60579-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}