{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:44:30Z","timestamp":1725565470656},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642156397"},{"type":"electronic","value":"9783642156403"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15640-3_5","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T04:11:29Z","timestamp":1284523889000},"page":"73-86","source":"Crossref","is-referenced-by-count":2,"title":["Functions as Processes: Termination and the $\\lambda\\mu\\widetilde{\\mu}$ -Calculus"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Cimini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claudio Sacerdoti","family":"Coen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Sangiorgi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"The Lambda Calculus: Its Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H.: The Lambda Calculus: Its Syntax and Semantics. Studies in Logic and the Foundations of Mathematics, vol.\u00a0103. North-Holland, Amsterdam (1984) (revised edition)"},{"key":"5_CR2","unstructured":"Boudol, G.: Asynchrony and the pi-calculus. Technical Report RR-1702, INRIA (1992)"},{"key":"5_CR3","unstructured":"Cimini, M., Coen, C.S., Sangiorgi, D.: Online appendix, \n                    \n                      http:\/\/nemendur.ru.is\/matteo\/appendixForFaPTaL.pdf"},{"key":"5_CR4","series-title":"SIGPLAN Notices","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1145\/351240.351262","volume-title":"Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP 2000)","author":"P.-L. Curien","year":"2000","unstructured":"Curien, P.-L., Herbelin, H.: The duality of computation. In: Proceedings of the Fifth ACM SIGPLAN International Conference on Functional Programming (ICFP 2000), Montreal, Canada, September 18-21. SIGPLAN Notices, vol.\u00a035(9), pp. 233\u2013243. ACM, New York (2000)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-642-04164-8_13","volume-title":"Semantics and Algebraic Specification","author":"R. Demangeon","year":"2009","unstructured":"Demangeon, R., Hirschkoff, D., Sangiorgi, D.: Mobile processes and termination. In: Palsberg, J. (ed.) Semantics and Algebraic Specification. LNCS, vol.\u00a05700, pp. 250\u2013273. Springer, Heidelberg (2009)"},{"issue":"7","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ic.2006.03.002","volume":"204","author":"Y. Deng","year":"2006","unstructured":"Deng, Y., Sangiorgi, D.: Ensuring termination by typability. Inf. Comput.\u00a0204(7), 1045\u20131082 (2006)","journal-title":"Inf. Comput."},{"key":"5_CR7","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (1989)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0022247","volume-title":"Computer Science Logic","author":"H. Herbelin","year":"1994","unstructured":"Herbelin, H.: A lambda-calculus structure isomorphic to Gentzen-style sequent calculus structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 61\u201375. Springer, Heidelberg (1994)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BFb0057019","volume-title":"ECOOP \u201991 European Conference on Object-Oriented Programming","author":"K. Honda","year":"1991","unstructured":"Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol.\u00a0512, pp. 133\u2013147. Springer, Heidelberg (1991)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0032030","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1990","unstructured":"Milner, R.: Functions as processes. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol.\u00a0443, pp. 167\u2013180. Springer, Heidelberg (1990)"},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, part I. Information and Computation (I&C)\u00a0100(1), 1\u201340 (1992); An earlier version of this paper appeared as Technical Report ECS-LFCS-89-85 of University of Edinburgh (1989)","journal-title":"Information and Computation (I&C)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1007\/3-540-60084-1_114","volume-title":"Automata, Languages and Programming","author":"D. Sangiorgi","year":"1995","unstructured":"Sangiorgi, D.: Internal mobility and agent passing calculi. In: F\u00fcl\u00f6p, Z., Gecseg, F. (eds.) ICALP 1995. LNCS, vol.\u00a0944, pp. 672\u2013684. Springer, Heidelberg (1995)"},{"issue":"4","key":"5_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0960129599002881","volume":"9","author":"D. Sangiorgi","year":"1999","unstructured":"Sangiorgi, D.: From lambda to pi; or, rediscovering continuations. Mathematical Structures in Computer Science\u00a09(4), 367\u2013401 (1999)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0960129505004810","volume":"16","author":"D. Sangiorgi","year":"2006","unstructured":"Sangiorgi, D.: Termination of processes. Mathematical Structures in Computer Science\u00a016(1), 1\u201339 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR16","volume-title":"The \u03c0-calculus: A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"5_CR17","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Lectures on the Curry-Howard Isomorphism","author":"M.H. S\u00f8rensen","year":"2006","unstructured":"S\u00f8rensen, M.H., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Studies in Logic and the Foundations of Mathematics, vol.\u00a0149. Elsevier Science Inc., New York (2006)"},{"key":"5_CR18","unstructured":"van Bakel, S., Cardelli, L., Vigliotti, M.G.: From X to Pi: Representing Classical Sequent Calculus in Pi-calculus. In: International Workshop on Classical Logic and Computation (CLC 2008) (2009)"},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1017\/S0956796804005386","volume":"15","author":"V.T. Vasconcelos","year":"2005","unstructured":"Vasconcelos, V.T.: Lambda and pi calculi, cam and secd machines. Journal of Functional Programming\u00a015(1), 101\u2013127 (2005)","journal-title":"Journal of Functional Programming"},{"key":"5_CR20","first-page":"311","volume-title":"16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001)","author":"N. Yoshida","year":"2001","unstructured":"Yoshida, N., Berger, M., Honda, K.: Strong normalisation in the \u03c0-Calculus. In: 16th Annual IEEE Symposium on Logic in Computer Science (LICS 2001), pp. 311\u2013322. IEEE Computer Society, Los Alamitos (2001)"}],"container-title":["Lecture Notes in Computer Science","Trustworthly Global Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15640-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T14:09:36Z","timestamp":1553090976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15640-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642156397","9783642156403"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15640-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}