{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:11Z","timestamp":1761611171463},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590484"},{"type":"electronic","value":"9783540491781"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0014053","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T02:50:31Z","timestamp":1132714231000},"page":"186-200","source":"Crossref","is-referenced-by-count":37,"title":["Typed operational semantics"],"prefix":"10.1007","author":[{"given":"Healfdene","family":"Goguen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"13_CR1","unstructured":"T. Altenkirch. Constructions, Inductive Types and Strong Normalization. PhD thesis, University of Edinburgh, 1993."},{"key":"13_CR2","unstructured":"H. Barendregt. The Lambda Calculus: its Syntax and Semantics. North Holland, revised edition, 1984."},{"key":"13_CR3","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."},{"key":"13_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":"13_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":"13_CR6","unstructured":"H. Geuvers. Logics and Type Systems. PhD thesis, Katholieke Universiteit Nijmegen, Sept. 1993."},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"H. Goguen. The metatheory of UTT. Submitted to Proceedings of BRA Workshop on Types for Proofs and Programs, 1994.","DOI":"10.1007\/3-540-60579-7_4"},{"key":"13_CR8","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":"13_CR9","unstructured":"Z. Luo. An Extended Calculus of Constructions. PhD thesis, University of Edinburgh, Nov. 1990."},{"key":"13_CR10","unstructured":"Z. Luo. Computation and Reasoning. Oxford University Press, 1994."},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"P. Martin-L\u00f6f. An intuitionistic theory of types: Predicative part. In H. Rose and J. C. Shepherdson, editors, Logic Colloqium 1973, pages 73\u2013118, 1975.","DOI":"10.1016\/S0049-237X(08)71945-1"},{"key":"13_CR12","unstructured":"P. Martin-L\u00f6f. Intuitionistic Type Theory. Bibliopolis, 1984."},{"key":"13_CR13","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":"13_CR14","doi-asserted-by":"crossref","unstructured":"J. Mitchell. Type systems for programming languages. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. North Holland, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50013-5"},{"key":"13_CR15","unstructured":"A. Salvesen. The Church-Rosser property for pure type systems with \u03b2\u03b7-reduction, Nov. 1991. Unpublished manuscript."},{"key":"13_CR16","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":"13_CR17","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."}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014053","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:38:01Z","timestamp":1586565481000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590484","9783540491781"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0014053","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}