{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:59:12Z","timestamp":1725551952362},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642122507"},{"type":"electronic","value":"9783642122514"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12251-4_11","type":"book-chapter","created":{"date-parts":[[2010,4,9]],"date-time":"2010-04-09T23:32:42Z","timestamp":1270855962000},"page":"134-149","source":"Crossref","is-referenced-by-count":13,"title":["Standardization and B\u00f6hm Trees for \u039b\u03bc-Calculus"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Saurin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1007\/3-540-45061-0_68","volume-title":"Automata, Languages and Programming","author":"Z. Ariola","year":"2003","unstructured":"Ariola, Z., Herbelin, H.: Minimal classical logic and control operators. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 871\u2013885. Springer, Heidelberg (2003)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Baba, K., Hirokawa, S., etsu Fujita, K.: Parallel reduction in type free lambda\/mu-calculus. Electronic Notes in Theoretical Computer Science\u00a042 (2001)","DOI":"10.1016\/S1571-0661(04)80878-8"},{"key":"11_CR3","series-title":"Lecture Notes in Pure and Applied Mathematics Series","first-page":"339","volume-title":"Logic and Algebra (Pontignano 1994)","author":"A. Berarducci","year":"1996","unstructured":"Berarducci, A.: Infinite lambda-calculus and non-sensible models. In: Ursini, A., Aglian\u00f2, P. (eds.) Logic and Algebra (Pontignano 1994). Lecture Notes in Pure and Applied Mathematics Series, vol.\u00a0180, pp. 339\u2013378. Marcel Dekker Inc., New York (1996)"},{"issue":"1-2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0304-3975(98)00135-2","volume":"212","author":"A. Berarducci","year":"1999","unstructured":"Berarducci, A., Dezani, M.: Infinite lambda-calculus and types. TCS\u00a0212(1-2), 29\u201375 (1999)","journal-title":"TCS"},{"key":"11_CR5","unstructured":"B\u00f6hm, C.: Alcune propriet\u00e0 delle forme \u03b2\u03b7-normali nel \u03bbK-calcolo. Publicazioni dell\u2019Istituto per le Applicazioni del Calcolo, 696 (1968)"},{"key":"11_CR6","volume-title":"Third Fuji International Symposium on Functional and Logic Programming","author":"P.-L. Curien","year":"1998","unstructured":"Curien, P.-L., Herbelin, H.: Computing with abstract B\u00f6hm trees. In: Third Fuji International Symposium on Functional and Logic Programming, Kyoto. World Scientific, Singapore (1998)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Danvy, O., Filinski, A.: Abstracting control. In: LISP and Functional Programming, pp. 151\u2013160 (1990)","DOI":"10.1145\/91556.91622"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"David, R., Py, W.: \u03bb\u03bc-calculus and B\u00f6hm\u2019s theorem. Journal of Symbolic Logic (2001)","DOI":"10.2307\/2694930"},{"issue":"298","key":"11_CR9","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(02)00809-5","volume":"2","author":"M. Dezani","year":"2003","unstructured":"Dezani, M., Severi, P., de Vries, F.-J.: Infinitary lambda calculus and discrimination of Berarducci trees. TCS\u00a02(298), 275\u2013302 (2003)","journal-title":"TCS"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(87)90109-5","volume":"52","author":"M. Felleisen","year":"1987","unstructured":"Felleisen, M., Friedman, D.P., Kohlbecker, E.E., Duba, B.F.: A syntactic theory of sequential control. TCS\u00a052, 205\u2013237 (1987)","journal-title":"TCS"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Filinski, A.: Representing monads. In: Conf. Record 21st ACM SIGPLAN-SIGACT Symp. on Principles of Programming Languages, POPL 1994, Portland, OR, USA, January 17-21, pp. 446\u2013457. Association for Computing Machinery (1994)","DOI":"10.1145\/174675.178047"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1017\/S096012950100336X","volume":"11","author":"J.-Y. Girard","year":"2001","unstructured":"Girard, J.-Y.: Locus solum. Mathematical Structures in Computer Science\u00a011, 301\u2013506 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"11_CR13","volume-title":"Principles of Programming Languages","author":"T. Griffin","year":"1990","unstructured":"Griffin, T.: A formulae-as-types notion of control. In: Principles of Programming Languages. IEEE Computer Society Press, Los Alamitos (1990)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Herbelin, H., Ghilezan, S.: An approach to call-by-name delimited continuations. In: Principles of Programming Languages, ACM Sigplan (January 2008)","DOI":"10.1145\/1328438.1328484"},{"key":"11_CR15","first-page":"479","volume-title":"To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-type notion of construction. In: Seldin, J.P., Hindley, R. (eds.) To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus, and Formalism, pp. 479\u2013490. Academic Press, New York (1980)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-59200-8_62","volume-title":"Rewriting Techniques and Applications","author":"R. Kennaway","year":"1995","unstructured":"Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Infinitary lambda calculi and b\u00f6hm models. In: Hsiang, J. (ed.) RTA 1995. LNCS, vol.\u00a0914, pp. 257\u2013270. Springer, Heidelberg (1995)"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00171-5","volume":"175","author":"R. Kennaway","year":"1997","unstructured":"Kennaway, R., Klop, J.W., Sleep, M.R., de Vries, F.-J.: Infinitary lambda calculus. TCS\u00a0175(1), 93\u2013125 (1997)","journal-title":"TCS"},{"key":"11_CR18","unstructured":"Kiselyov, O.: Call-by-name linguistic side effects. In: ESSLLI 2008 Workshop on Symmetric calculi and Ludics for the semantic interpretation (2008)"},{"key":"11_CR19","unstructured":"Klop, J.W.: Combinatory Reduction Systems. Ph.D. thesis, State University of Utrecht (1980)"},{"key":"11_CR20","unstructured":"Krivine, J.-L.: Lambda-calculus, Types and Models. Ellis Horwood (1993)"},{"key":"11_CR21","volume-title":"Logic In Computer Science","author":"S. Lassen","year":"2006","unstructured":"Lassen, S.: Head normal form bisimulation for pairs and the \u03bb\u03bc-calculus. In: Logic In Computer Science. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"11_CR22","unstructured":"Loew, T.: Locally Boolean Domains and Universal Models for Infinitary Sequential Languages. PhD thesis, Darmstadt University (2006)"},{"key":"11_CR23","unstructured":"Maurel, F.: Un cadre quantitatif pour la Ludique. PhD thesis, Universit\u00e9 Paris VII (2004)"},{"key":"11_CR24","unstructured":"Pagani, M., Saurin, A.: Stream associative nets and \u039b\u03bc-calculus. Technical Report 6431, INRIA (January 2008)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-55460-2_27","volume-title":"Logic Programming","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: Free deduction: An analysis of \u201ccomputations\u201d in classical logic. In: Voronkov, A. (ed.) RCLP 1990 and RCLP 1991. LNCS, vol.\u00a0592, pp. 361\u2013380. Springer, Heidelberg (1992)"},{"key":"11_CR26","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.: \u03bb\u03bc-calculus: an algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/LICS.1993.287602","volume-title":"Eighth Annual Symposium on Logic in Computer Science","author":"M. Parigot","year":"1993","unstructured":"Parigot, M.: Strong normalization for second order classical natural deduction. In: Vardi, M. (ed.) Eighth Annual Symposium on Logic in Computer Science, pp. 39\u201346. IEEE, Los Alamitos (1993)"},{"issue":"4","key":"11_CR28","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.2307\/2275652","volume":"62","author":"M. Parigot","year":"1997","unstructured":"Parigot, M.: Proofs of strong normalisation for second order classical natural deduction. Journal of Symbolic Logic\u00a062(4), 1461\u20131479 (1997)","journal-title":"Journal of Symbolic Logic"},{"key":"11_CR29","unstructured":"Py, W.: Confluence en \u03bb\u03bc-calcul. PhD thesis, Universit\u00e9 de Savoie (1998)"},{"key":"11_CR30","first-page":"356","volume-title":"Logic In Computer Science","author":"A. Saurin","year":"2005","unstructured":"Saurin, A.: Separation with streams in the \u039b\u03bc-calculus. In: Logic In Computer Science, Chicago, pp. 356\u2013365. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-87531-4_13","volume-title":"Computer Science Logic","author":"A. Saurin","year":"2008","unstructured":"Saurin, A.: On the relations between the syntactic theories of \u03bb\u03bc-calculi. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 154\u2013168. Springer, Heidelberg (2008)"},{"key":"11_CR32","unstructured":"Saurin, A.: Une \u00e9tude logique du contr\u00f4le, appliqu\u00e9e \u00e0 la programmation fonctionnelle et logique. PhD thesis, \u00c9cole Polytechnique (September 2008)"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Saurin, A.: Typing streams in the \u039b\u03bc-calculus. ACM Transactions on Computational Logic (2009) (to appear)","DOI":"10.1145\/1805950.1805958"},{"key":"11_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/978-3-642-12032-9_26","volume-title":"FOSSACS 2010","author":"A. Saurin","year":"2010","unstructured":"Saurin, A.: A hierarchy for delimited continuations in call-by-name. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 374\u2013388. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12251-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:51:59Z","timestamp":1606186319000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12251-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642122507","9783642122514"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12251-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}