{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:30:29Z","timestamp":1770291029685,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540875307","type":"print"},{"value":"9783540875314","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87531-4_13","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T08:40:53Z","timestamp":1220085653000},"page":"154-168","source":"Crossref","is-referenced-by-count":7,"title":["On the Relations between the Syntactic Theories of \u03bb\u03bc-Calculi"],"prefix":"10.1007","author":[{"given":"Alexis","family":"Saurin","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Ariola, Z.M., Herbelin, H., Sabry, A.: A type-theoretic foundation of delimited continuations. Higher-order symbolic computation (2007)","DOI":"10.1007\/s10990-007-9006-0"},{"key":"13_CR2","unstructured":"B\u00f6hm, C.: Alcune propriet\u00e0 delle forme \u03b2\u03b7-normali nel \u03bbK-calcolo. Publicazioni dell\u2019Istituto per le Applicazioni del Calcolo,\u00a0696 (1968)"},{"key":"13_CR3","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"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming and Automated Reasoning","author":"P. de Groote","year":"1994","unstructured":"de Groote, P.: On the relation between the \u03bb\u03bc-calculus and the syntactic theory of sequential control. In: Pfenning, F. (ed.) LPAR 1994. LNCS (LNAI), vol.\u00a0822. Springer, Heidelberg (1994)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"de Groote, P.: An environment machine for the \u03bb\u03bc-calculus. MSCS\u00a08 (1998)","DOI":"10.1017\/S0960129598002667"},{"issue":"82","key":"13_CR6","first-page":"1","volume":"68","author":"K. Dosen","year":"2000","unstructured":"Dosen, K., Petric, Z.: The maximality of the typed lambda caluclus and of cartesian closed categories. Publication de l\u2019Institut Math\u00e9matique\u00a068(82), 1\u201319 (2000)","journal-title":"Publication de l\u2019Institut Math\u00e9matique"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Dosen, K., Petric, Z.: The typed B\u00f6hm theorem. ENTCS\u00a050(2) (2001); In : Proceedings of BOTH 2001","DOI":"10.1016\/S1571-0661(04)00168-9"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Griffin, T.: A formulae-as-types notion of control. In: POPL 1990 (1990)","DOI":"10.1145\/96709.96714"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Herbelin, H., Ghilezan, S.: An approach to call-by-name delimited continuations. In: POPL (January 2008)","DOI":"10.1145\/1328438.1328484"},{"key":"13_CR10","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, 1969. 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":"13_CR11","unstructured":"Joly, T.: Codages, s\u00e9parabilit\u00e9 et repr\u00e9sentation de fonctions en \u03bb-calcul simplement typ\u00e9 et dans d\u2019autres syst\u00e9mes de types. PhD thesis, Universit\u00e9 Paris VII (2000)"},{"key":"13_CR12","unstructured":"Ong, L.: A semantic view of classical proofs. In: LICS 1996 (1996)"},{"key":"13_CR13","unstructured":"Pagani, M., Saurin, A.: Stream Associative Nets and Lambda-mu-calculus. Technical Report RR-6431, INRIA (January 2008)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","first-page":"361","volume-title":"Logic Programming","author":"M. Parigot","year":"1991","unstructured":"Parigot, M.: Free deduction: An analysis of \u201dcomputations\u201d in classical logic. In: Voronkov, A. (ed.) RCLP 1990 and RCLP 1991. LNCS, vol.\u00a0592, pp. 361\u2013380. Springer, Heidelberg (1991)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (1992)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BFb0022575","volume-title":"Computational Logic and Proof Theory","author":"M. Parigot","year":"1993","unstructured":"Parigot, M.: Classical proofs as programs. In: Mundici, D., Gottlob, G., Leitsch, A. (eds.) KGC 1993. LNCS, vol.\u00a0713, pp. 263\u2013276. Springer, Heidelberg (1993)"},{"key":"13_CR17","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 (June 1993)"},{"issue":"4","key":"13_CR18","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":"13_CR19","unstructured":"Py, W.: Confluence en \u03bb\u03bc-calcul. PhD thesis, Universit\u00e9 de Savoie (1998)"},{"key":"13_CR20","volume-title":"Twentieth Annual Symposium on Logic in Computer Science","author":"A. Saurin","year":"2005","unstructured":"Saurin, A.: Separation with streams in the \u039b\u03bc-calculus. In: Twentieth Annual Symposium on Logic in Computer Science. IEEE, Los Alamitos (2005)"},{"key":"13_CR21","unstructured":"Saurin, A.: Typing streams in the \u039b\u03bc-calculus. In: LPAR 2007 (2007)"},{"key":"13_CR22","first-page":"1","volume":"22","author":"R. Statman","year":"1983","unstructured":"Statman, R.: \u03bb-definable functionals and \u03b2\u03b7 conversion. Archiv f\u00fcr Mathematische Logik und Grundlagenforschung\u00a022, 1\u20136 (1983)","journal-title":"Archiv f\u00fcr Mathematische Logik und Grundlagenforschung"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87531-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:12:45Z","timestamp":1715058765000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87531-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540875307","9783540875314"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87531-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}