{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:01:28Z","timestamp":1760079688306},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642396335"},{"type":"electronic","value":"9783642396342"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39634-2_26","type":"book-chapter","created":{"date-parts":[[2013,7,22]],"date-time":"2013-07-22T09:52:36Z","timestamp":1374486756000},"page":"354-369","source":"Crossref","is-referenced-by-count":10,"title":["Circular Coinduction in Coq Using Bisimulation-Up-To Techniques"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Endrullis","sequence":"first","affiliation":[]},{"given":"Dimitri","family":"Hendriks","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Bodin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44904-3_1","volume-title":"Typed Lambda Calculi and Applications","author":"A. Abel","year":"2003","unstructured":"Abel, A.: Termination and Productivity Checking with Continuous Types. In: Hofmann, M.O. (ed.) TLCA 2003. LNCS, vol.\u00a02701, pp. 1\u201315. Springer, Heidelberg (2003)"},{"key":"26_CR2","unstructured":"The Agda\u00a0team. The Agda Wiki (2011), \n                    \n                      http:\/\/wiki.portal.chalmers.se\/agda"},{"key":"26_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, New York (2003)"},{"key":"26_CR4","unstructured":"The Coq\u00a0development team. The Coq Proof Assistant Reference Manual. LogiCal Project, version 8.3 (2012), \n                    \n                      http:\/\/coq.inria.fr"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-58085-9_72","volume-title":"Types for Proofs and Programs","author":"T. Coquand","year":"1994","unstructured":"Coquand, T.: Infinite Objects in Type Theory. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol.\u00a0806, pp. 62\u201378. Springer, Heidelberg (1994)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Danielsson, N.A.: Beating the Productivity Checker Using Embedded Languages. In: Proc. Workshop on Partiality and Recursion in Interactive Theorem Provers (PAR\u00a02010). EPTCS, vol.\u00a043, pp. 29\u201348 (2010)","DOI":"10.4204\/EPTCS.43.3"},{"key":"26_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-89439-1_6","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Endrullis","year":"2008","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D.: Data-Oblivious Stream Productivity. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 79\u201396. Springer, Heidelberg (2008)"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.W.: Productivity of Stream Definitions. Theoretical Computer Science\u00a0411 (2010)","DOI":"10.1016\/j.tcs.2009.10.014"},{"issue":"28","key":"26_CR9","doi-asserted-by":"publisher","first-page":"3203","DOI":"10.1016\/j.tcs.2011.03.024","volume":"412","author":"J. Endrullis","year":"2011","unstructured":"Endrullis, J., Hendriks, D.: Lazy Productivity via Termination. Theoretical Computer Science\u00a0412(28), 3203\u20133225 (2011)","journal-title":"Theoretical Computer Science"},{"key":"26_CR10","unstructured":"Endrullis, J., Hendriks, D., Bodin, M.: Coq Formalization for Circular Coinduction (2012), \n                    \n                      http:\/\/www.cs.vu.nl\/~diem\/research\/up_to.tgz"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","first-page":"39","volume-title":"Types for Proofs and Programs","author":"E. Gim\u00e9nez","year":"1994","unstructured":"Gim\u00e9nez, E.: Codifying Guarded Definitions with Recursive Schemes. In: Barendregt, H., Nipkow, T. (eds.) TYPES 1993. LNCS, vol.\u00a0806, pp. 39\u201359. Springer, Heidelberg (1994)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Goguen, J., Lin, K., Ro\u015fu, G.: Circular Coinductive Rewriting. In: Proc. of Automated Software Engineering, pp. 123\u2013131. IEEE (2000)","DOI":"10.1109\/ASE.2000.873657"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Hughes, J., Pareto, L., Sabry, A.: Proving the Correctness of Reactive Systems Using Sized Types. In: Symposium on Principles of Programming Languages (POPL\u00a01996), pp. 410\u2013423 (1996)","DOI":"10.1145\/237721.240882"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Hur, C.-K., Neis, G., Dreyer, D., Vafeiadis, V.: The Power of Parameterization in Coinductive Proof. In: Proc. Symp. on Principles of Programming Languages (POPL\u00a02013), pp. 193\u2013206. ACM (2013)","DOI":"10.1145\/2480359.2429093"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1007\/978-3-642-10373-5_33","volume-title":"Formal Methods and Software Engineering","author":"D. Lucanu","year":"2009","unstructured":"Lucanu, D., Ro\u015fu, G.: Circular Coinduction with Special Contexts. In: Breitman, K., Cavalcanti, A. (eds.) ICFEM 2009. LNCS, vol.\u00a05885, pp. 639\u2013659. Springer, Heidelberg (2009)"},{"key":"26_CR16","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall International Series in Computer Science. Prentice-Hall (1989)"},{"key":"26_CR17","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"E.L. Post","year":"1943","unstructured":"Post, E.L.: Formal Reductions of the General Combinatorial Decision Problem. American Journal of Mathematics\u00a0(65), 197\u2013215 (1943)","journal-title":"American Journal of Mathematics"},{"key":"26_CR18","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Advanced Topics in Bisimulation and Coinduction","author":"D. Pous","year":"2011","unstructured":"Pous, D., Sangiorgi, D.: Enhancements of the Coinductive Proof Method. In: Sangiorgi, D., Rutten, J.J.M.M. (eds.) Advanced Topics in Bisimulation and Coinduction. Cambridge Tracts in Theoretical Computer Science, vol.\u00a052, ch. 6, Cambridge University Press, Cambridge (2011)"},{"key":"26_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-642-03741-2_10","volume-title":"Algebra and Coalgebra in Computer Science","author":"G. Ro\u015fu","year":"2009","unstructured":"Ro\u015fu, G., Lucanu, D.: Circular Coinduction: A Proof Theoretical Foundation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 127\u2013144. Springer, Heidelberg (2009)"},{"key":"26_CR20","doi-asserted-by":"crossref","unstructured":"Severi, P., de Vries, F.-J.: Pure Type Systems with Corecursion on Streams: From Finite to Infinitary Normalisation. In: Proc. Int. Conf. on Functional Programming (ICFP\u00a02012), pp. 141\u2013152. ACM (2012)","DOI":"10.1145\/2398856.2364550"},{"key":"26_CR21","unstructured":"Zantema, H., Endrullis, J.: Proving Equality of Streams Automatically. In: Proc. Conf. on Rewriting Techniques and Applications (RTA\u00a02011). LIPIcs, vol.\u00a010, pp. 393\u2013408. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011)"}],"container-title":["Lecture Notes in Computer Science","Interactive Theorem Proving"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39634-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T22:15:41Z","timestamp":1557958541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39634-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642396335","9783642396342"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39634-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}