{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:00:47Z","timestamp":1762459247669,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662459164"},{"type":"electronic","value":"9783662459171"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45917-1_11","type":"book-chapter","created":{"date-parts":[[2014,12,22]],"date-time":"2014-12-22T14:34:17Z","timestamp":1419258857000},"page":"159-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Corecursion and Non-divergence in Session-Typed Processes"],"prefix":"10.1007","author":[{"given":"Bernardo","family":"Toninho","sequence":"first","affiliation":[]},{"given":"Luis","family":"Caires","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Pfenning","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,23]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1007\/3-540-57208-2_35","volume-title":"CONCUR\u201993","author":"K Honda","year":"1993","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 509\u2013523. Springer, Heidelberg (1993)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/BFb0053567","volume-title":"Programming Languages and Systems","author":"K Honda","year":"1998","unstructured":"Honda, K., Vasconcelos, V.T., Kubo, M.: Language primitives and type discipline for structured communication-based programming. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 122\u2013138. Springer, Heidelberg (1998)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: POPL, pp. 273\u2013284 (2008)","DOI":"10.1145\/1328897.1328472"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-642-15375-4_16","volume-title":"CONCUR 2010 - Concurrency Theory","author":"L Caires","year":"2010","unstructured":"Caires, L., Pfenning, F.: Session types as intuitionistic linear propositions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 222\u2013236. Springer, Heidelberg (2010)"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Propositions as sessions. In: ICFP 2012, pp. 273\u2013286 (2012)","DOI":"10.1145\/2398856.2364568"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Dependent session types via intuitionistic linear type theory. In: PPDP 2011, pp. 161\u2013172 (2011)","DOI":"10.1145\/2003476.2003499"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-25379-9_4","volume-title":"Certified Programs and Proofs","author":"F Pfenning","year":"2011","unstructured":"Pfenning, F., Caires, L., Toninho, B.: Proof-carrying code in a session-typed process calculus. In: Jouannaud, J.-P., Shao, Z. (eds.) CPP 2011. LNCS, vol. 7086, pp. 21\u201336. Springer, Heidelberg (2011)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-642-37036-6_19","volume-title":"Programming Languages and Systems","author":"L Caires","year":"2013","unstructured":"Caires, L., P\u00e9rez, J.A., Pfenning, F., Toninho, B.: Behavioral polymorphism and parametricity in session-based communication. In: Felleisen, M., Gardner, P. (eds.) Programming Languages and Systems. LNCS, vol. 7792, pp. 330\u2013349. Springer, Heidelberg (2013)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-37036-6_20","volume-title":"Programming Languages and Systems","author":"B Toninho","year":"2013","unstructured":"Toninho, B., Caires, L., Pfenning, F.: Higher-order processes, functions, and sessions: A monadic integration. In: Felleisen, M., Gardner, P. (eds.) Programming Languages and Systems. LNCS, vol. 7792, pp. 350\u2013369. Springer, Heidelberg (2013)"},{"key":"11_CR10","unstructured":"Sangiorgi, D., Walker, D.: The $$\\pi $$-calculus: A Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"11_CR11","unstructured":"The Coq Development Team: The Coq Proof Assistant Reference Manual (2013)"},{"key":"11_CR12","unstructured":"Norell, U.: Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology (2007)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Abel, A., Pientka, B.: Wellfounded recursion with copatterns: A unified approach to termination and productivity. In: LICS (2013)","DOI":"10.1145\/2500365.2500591"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/978-3-642-28869-2_27","volume-title":"Programming Languages and Systems","author":"JA P\u00e9rez","year":"2012","unstructured":"P\u00e9rez, J.A., Caires, L., Pfenning, F., Toninho, B.: Linear logical relations for session-based concurrency. In: Seidl, H. (ed.) Programming Languages and Systems. LNCS, vol. 7211, pp. 539\u2013558. Springer, Heidelberg (2012)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-74792-5_9","volume-title":"Formal Methods for Components and Objects","author":"J Aranda","year":"2007","unstructured":"Aranda, J., Di Giusto, C., Palamidessi, C., Valencia, F.: On recursion, replication and scope mechanisms in process calculi. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2006. LNCS, vol. 4709, pp. 185\u2013206. Springer, Heidelberg (2007)"},{"issue":"2\u20133","key":"11_CR16","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s00236-005-0177-z","volume":"42","author":"S Gay","year":"2005","unstructured":"Gay, S., Hole, M.: Subtyping for Session Types in the Pi Calculus. Acta Informatica 42(2\u20133), 191\u2013225 (2005)","journal-title":"Acta Informatica"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2003.08.004","volume":"191","author":"N Yoshida","year":"2004","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the pi -calculus. Inf. Comput. 191(2), 145\u2013202 (2004)","journal-title":"Inf. Comput."},{"issue":"1","key":"11_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1017\/S0956796809990268","volume":"20","author":"S Gay","year":"2010","unstructured":"Gay, S., Vasconcelos, V.T.: Linear type theory for asynchronous session types. J. Funct. Programming 20(1), 19\u201350 (2010)","journal-title":"J. Funct. Programming"},{"key":"11_CR19","series-title":"International Federation for Information Processing","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1007\/1-4020-8141-3_47","volume-title":"TCS 2004","author":"Y Deng","year":"2004","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring Termination by Typability. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IFIP, vol. 155, pp. 619\u2013632. Springer, Boston (2004)"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129505004810","volume":"16","author":"D Sangiorgi","year":"2006","unstructured":"Sangiorgi, D.: Termination of processes. Math. Struct. in Comp. Sci. 16(1), 1\u201339 (2006)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"11_CR21","unstructured":"Morris, J.G., Lindley, S., Wadler, P.: The least must speak with the greatest (2014) Draft"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Baelde, D.: Least and greatest fixed points in linear logic. TOCL 13(1) (January 2012)","DOI":"10.1145\/2071368.2071370"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-73228-0_3","volume-title":"Typed Lambda Calculi and Applications","author":"A Abel","year":"2007","unstructured":"Abel, A.: Strong normalization and equi-(co)inductive types. In: Della Rocca, S.R. (ed.) TLCA 2007. LNCS, vol. 4583, pp. 8\u201322. Springer, Heidelberg (2007)"},{"issue":"12","key":"11_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0168-0072(91)90069-X","volume":"5","author":"NP Mendler","year":"1991","unstructured":"Mendler, N.P.: Inductive types and type constraints in the second-order lambda calculus. Annals of Pure and Applied Logic 5(12), 159\u2013172 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BFb0055070","volume-title":"Automata, Languages and Programming","author":"E Gim\u00e9nez","year":"1998","unstructured":"Gim\u00e9nez, E.: Structural recursive definitions in type theory. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 397\u2013408. Springer, Heidelberg (1998)"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-642-16242-8_24","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B Gr\u00e9goire","year":"2010","unstructured":"Gr\u00e9goire, B., Sacchini, J.L.: On strong normalization of the calculus of constructions with type-based termination. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol. 6397, pp. 333\u2013347. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45917-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T12:23:47Z","timestamp":1675254227000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-45917-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662459164","9783662459171"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45917-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"23 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}