{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:28:25Z","timestamp":1767929305368,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540580850","type":"print"},{"value":"9783540484400","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58085-9_72","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:11:34Z","timestamp":1330269094000},"page":"62-78","source":"Crossref","is-referenced-by-count":76,"title":["Infinite objects in type theory"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Coquand","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"P. Aczel. An introduction to inductive definitions. In J. Barwise, editor, Handbook of Mathematical Logic, 739\u2013782, (1977), Elsevier.","DOI":"10.1016\/S0049-237X(08)71120-0"},{"key":"4_CR2","unstructured":"P. Aczel. Non-Well-Founded Sets CSLI Lecture Notes, Vol. 14 (LSCI, Stanford, 1988)"},{"key":"4_CR3","unstructured":"Th. Coquand. Pattern-Matching in Type Theory. Proceedings of the B.R.A. meeting on Proof and Types, (1992) Bastad."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Inductive definitions, semantics and abstract interpretation. POPL'91, (1991).","DOI":"10.1145\/143165.143184"},{"key":"4_CR5","unstructured":"H. Curry and R. Feys. Combinatory Logic, Vol. 1. North-Holland Publishing Company."},{"key":"4_CR6","unstructured":"O. Dahl. Verifiable Programming. Prentice Hall International, 1992."},{"key":"4_CR7","unstructured":"M. Dummett. Elements of Intuitionism. Oxford University Press, 1977."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"P. Dybjer. Inductive Families. To appear in Formal Aspects of Computing (1993).","DOI":"10.1007\/BF01211308"},{"key":"4_CR9","unstructured":"J.Y. Girard. Proof Theory and Logical Complexity. Bibliopolis, 1988."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0304-3975(87)90073-9","volume":"53","author":"L. Halln\u00e4s","year":"1987","unstructured":"L. Halln\u00e4s. An Intensional Characterization of the Largest Bisimulation. Theoretical Computer Science 53 (1987), 335\u2013343.","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"L. Halln\u00e4s. On the syntax of infinite objects: an extension of Martin-L\u00f6f 's theory of expressions. LNCS 417, COLOG-88, P. Martin-L\u00f6f and G. Mints Eds., (1989), 94\u2013103.","DOI":"10.1007\/3-540-52335-9_50"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"J. Hugues and A. Moran. A semantics for locally bottom-avoiding choice. Proceedings of the Glasogow Functional Programming Workshop'92, WICS (1992).","DOI":"10.1007\/978-1-4471-3215-8_9"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.2307\/2964281","volume":"23","author":"P. Lorenzen","year":"1958","unstructured":"P. Lorenzen. Logical Reflection and Formalism. The Journal of Symbolic Logic, 23, 1958, 241\u2013249.","journal-title":"The Journal of Symbolic Logic"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.2307\/2964572","volume":"24","author":"P. Lorenzen","year":"1959","unstructured":"P. Lorenzen and J. Myhill. Constructive Definition of Certain Sets of Numbers. The Journal of Symbolic Logic, 24, 1959, 37\u201349.","journal-title":"The Journal of Symbolic Logic"},{"key":"4_CR15","unstructured":"P. Martin-L\u00f6f. Intuitionistic Type Theory. Bibliopolis, 1984."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"P. Martin-L\u00f6f. Mathematics of Infinity. LNCS 417, COLOG-88, P. Martin-L\u00f6f and G. Mints Eds., (1989), 146\u2013197.","DOI":"10.1007\/3-540-52335-9_54"},{"key":"4_CR17","unstructured":"N.P. Mendier, P. Panangaden and R.L. Constable. Infinite Objects in Type Theory. Proceeding of the first Logic In Computer Science 1986, 249\u2013255."},{"key":"4_CR18","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0304-3975(91)90033-X","volume":"87","author":"R. Milner","year":"1991","unstructured":"R. Milner, M. Tofte. Co-induction in Relational Semantics Theoretical Computer Science 87 (1991), 209\u2013220.","journal-title":"Co-induction in Relational Semantics Theoretical Computer Science"},{"key":"4_CR19","unstructured":"R. Milner. Communication and Concurrency Prentice Hall International, 1989."},{"key":"4_CR20","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_CR21","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. in P. Deussen, editor, Proceedings of the 5th GI-conference on Theoretical Computer Science, LNCS 104, (1981), 167\u2013183.","DOI":"10.1007\/BFb0017309"},{"key":"4_CR22","unstructured":"L. Paulson. Co-induction and Co-recursion in Higher-order Logic. Draft (1993), University of Cambridge."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"K.V.S. Prasad. Programming with Broadcasts. CONCUR'93, LNCS 715, 173\u2013187.","DOI":"10.1007\/3-540-57208-2_13"},{"key":"4_CR24","unstructured":"C. Raffalli. Fixed points and type systems (Abstract) proceeding of the third B.R.A. meeting on Proofs and Types (1992), Bastad, 309."},{"key":"4_CR25","unstructured":"W. de Roever. On Backtracking and Greatest Fixpoints Formal Description of Programming Concepts, J. Neuhold (ed.), North-Holland, (1978), 621\u2013639."},{"issue":"No4","key":"4_CR26","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1145\/69558.69563","volume":"11","author":"B.A. Sijtsma","year":"1989","unstructured":"B.A. Sijtsma. On the productivity of recursive list functions. ACM Transactions on Programming Language and Systems, Vol. 11, No 4 (1989), 633\u2013649.","journal-title":"ACM Transactions on Programming Language and Systems"},{"key":"4_CR27","unstructured":"M. Tatsuta. Realisability Interpretation of Coinductive Definitions and Program Synthesis with Streams. Proceedings of International Conference on Fifth Generation Computer Systems (1992) 666\u2013673."}],"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_72.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:19:43Z","timestamp":1742595583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58085-9_72"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540580850","9783540484400"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-58085-9_72","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]}}}