{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:55:31Z","timestamp":1760079331433},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76637-7_27","type":"book-chapter","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T07:47:52Z","timestamp":1195544872000},"page":"399-414","source":"Crossref","is-referenced-by-count":8,"title":["Call-by-Name and Call-by-Value in Normal Modal Logic"],"prefix":"10.1007","author":[{"given":"Yoshihiko","family":"Kakutani","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"27_CR1","unstructured":"Abe, T.: Completeness of modal proofs in first-order predicate logic. Computer Software, JSSST Journal (to appear)"},{"key":"27_CR2","unstructured":"Barber, A.: Dual intuitionistic linear logic. Technical report, LFCS, University of Edinburgh (1996)"},{"key":"27_CR3","first-page":"117","volume-title":"Handbook of Logic in Computer Science","author":"H.P. Barendregt","year":"1992","unstructured":"Barendregt, H.P.: Lambda calculi with types. In: Abramski, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a02, pp. 117\u2013309. Oxford University Press, Oxford (1992)"},{"key":"27_CR4","unstructured":"Bellin, G., de Paiva, V.C.V., Ritter, E.: Extended Curry-Howard correspondence for a basic constructive modal logic. In: Proceedings of Methods for Modalities (2001)"},{"key":"27_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/BFb0014046","volume-title":"Typed Lambda Calculi and Applications","author":"G.M. Bierman","year":"1995","unstructured":"Bierman, G.M.: What is a categorical model of intuitionistic linear logic. In: Dezani-Ciancaglini, M., Plotkin, G. (eds.) TLCA 1995. LNCS, vol.\u00a0902, pp. 78\u201393. Springer, Heidelberg (1995)"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1023\/A:1005291931660","volume":"65","author":"G.M. Bierman","year":"2000","unstructured":"Bierman, G.M., de Paiva, V.C.V.: On an intuitionistic modal logic. Studia Logica\u00a065(3), 383\u2013416 (2000)","journal-title":"Studia Logica"},{"key":"27_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107050884","volume-title":"Modal Logic","author":"P. Blackburn","year":"2001","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)"},{"issue":"3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/382780.382785","volume":"48","author":"R. Davies","year":"2001","unstructured":"Davies, R., Pfenning, F.: A modal analysis of staged computation. Journal of the ACM\u00a048(3), 555\u2013604 (2001)","journal-title":"Journal of the ACM"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/BFb0017475","volume-title":"Trees in Algebra and Programming - CAAP 1994","author":"P. Groote de","year":"1994","unstructured":"de Groote, P.: A cps-translation of the \u03bb\u03bc-calculus. In: Tison, S. (ed.) CAAP 1994. LNCS, vol.\u00a0787, pp. 85\u201399. Springer, Heidelberg (1994)"},{"key":"27_CR10","unstructured":"Filinski, A.: Declarative continuations and categorical duality. Master\u2019s thesis, Computer Science Department, University of Copenhagen (1989)"},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/800235.807077","volume-title":"Proving Assertions about Programs","author":"M. Fischer","year":"1972","unstructured":"Fischer, M.: Lambda calculus schemata. In: Proving Assertions about Programs, pp. 104\u2013109. ACM Press, New York (1972)"},{"issue":"1","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"Girard, J.-Y.: Linear logic. Theoretical Computer Science\u00a050(1), 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"27_CR13","first-page":"47","volume-title":"Principles of Programming Languages","author":"T.G. Griffin","year":"1990","unstructured":"Griffin, T.G.: A formulae-as-types notion of control. In: Principles of Programming Languages, pp. 47\u201358. ACM Press, New York (1990)"},{"key":"27_CR14","first-page":"387","volume-title":"Logic in Computer Science","author":"M. Hofmann","year":"1997","unstructured":"Hofmann, M., Streicher, T.: Continuation models are universal for \u03bb\u03bc-calculus. In: Logic in Computer Science, pp. 387\u2013397. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"27_CR15","first-page":"479","volume-title":"Essays on Combinatory Logic, Lambda Calculus and Formalism","author":"W.A. Howard","year":"1980","unstructured":"Howard, W.A.: The formulae-as-types notion of construction. In: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp. 479\u2013490. Academic Press, London (1980)"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1007\/3-540-45793-3_34","volume-title":"Computer Science Logic","author":"Y. Kakutani","year":"2002","unstructured":"Kakutani, Y.: Duality between call-by-name recursion and call-by-value iteration. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, pp. 506\u2013521. Springer, Heidelberg (2002)"},{"key":"27_CR17","unstructured":"Kakutani, Y.: Calculi for intuitionistic normal modal logic. In: Proceedings of Programming and Programming Languages (2007)"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1002\/malq.19630090502","volume":"9","author":"S. Kripke","year":"1963","unstructured":"Kripke, S.: Semantic analysis of modal logic I, normal propositional logic. Zeitschrift f\u00fcr Mathemathische Logik und Grundlagen der Mathematik\u00a09, 67\u201396 (1963)","journal-title":"Zeitschrift f\u00fcr Mathemathische Logik und Grundlagen der Mathematik"},{"key":"27_CR19","volume-title":"Introduction to Higher-Order Categorical Logic","author":"J. Lambek","year":"1986","unstructured":"Lambek, J., Scott, P.J.: Introduction to Higher-Order Categorical Logic. Cambridge University Press, Cambridge (1986)"},{"key":"27_CR20","volume-title":"Categories for the Working Mathematician","author":"S. Mac Lane","year":"1997","unstructured":"Mac Lane, S.: Categories for the Working Mathematician, 2nd edn. Springer, Heidelberg (1997)","edition":"2"},{"issue":"1","key":"27_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10485-004-3134-z","volume":"13","author":"M.E. Maietti","year":"2005","unstructured":"Maietti, M.E., Maneggia, P., de Paiva, V.C.V., Ritter, E.: Relating categorical semantics for intuitionistic linear logic. Applied Categorical Structures\u00a013(1), 1\u201336 (2005)","journal-title":"Applied Categorical Structures"},{"key":"27_CR22","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-94-017-2798-3_12","volume-title":"Proof Theory of Modal Logics","author":"S. Martini","year":"1996","unstructured":"Martini, S., Masini, A.: A computational interpretation of modal proofs. In: Proof Theory of Modal Logics, pp. 213\u2013241. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"27_CR23","unstructured":"Miyamoto, K., Igarashi, A.: A modal foundation for secure information flow. In: Proceedings of Foundations of Computer Security (2004)"},{"key":"27_CR24","first-page":"14","volume-title":"Logic in Computer Science","author":"E. Moggi","year":"1989","unstructured":"Moggi, E.: Computational lambda-calculus and monads. In: Logic in Computer Science, pp. 14\u201323. IEEE Computer Society Press, Los Alamitos (1989)"},{"key":"27_CR25","first-page":"215","volume-title":"Principle of Programming Languages","author":"C.-H.L. Ong","year":"1997","unstructured":"Ong, C.-H.L., Stewart, C.A.: A Curry-Howard foundation for functional computation with control. In: Principle of Programming Languages, pp. 215\u2013227. ACM Press, New York (1997)"},{"key":"27_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)"},{"issue":"2","key":"27_CR27","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0304-3975(75)90017-1","volume":"1","author":"G.D. Plotkin","year":"1975","unstructured":"Plotkin, G.D.: Call-by-name, call-by-value and the lambda calculus. Theoretical Computer Science\u00a01(2), 125\u2013159 (1975)","journal-title":"Theoretical Computer Science"},{"issue":"2,3","key":"27_CR28","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/S0022-4049(00)00161-4","volume":"159","author":"D. Pym","year":"2001","unstructured":"Pym, D., Ritter, E.: On the semantics of classical disjunction. Journal of Pure and Applied Algebra\u00a0159(2,3), 315\u2013338 (2001)","journal-title":"Journal of Pure and Applied Algebra"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Seely, R.A.G.: Linear logic, \u2217-autonomous categories and cofree coalgebras. In: Categories in Computer Science and Logic. Contemporary Mathematics, vol.\u00a092, pp. 371\u2013389. AMS (1989)","DOI":"10.1090\/conm\/092\/1003210"},{"issue":"2","key":"27_CR30","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S096012950000311X","volume":"11","author":"P. Selinger","year":"2001","unstructured":"Selinger, P.: Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science\u00a011(2), 207\u2013260 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"27_CR31","unstructured":"Selinger, P.: Some remarks on control categories. Manuscript (2003)"},{"key":"27_CR32","unstructured":"Shan, C.-C.: A computastional interpretation of classical S4 modality. In: Proceedings of Intuitionistic Modal Logics and Applications (2005)"},{"key":"27_CR33","unstructured":"Simpson, A.K.: The Proof Theory and Semantics of Intuitionistic Modal Logics. PhD thesis, University of Edinburgh (1993)"},{"key":"27_CR34","first-page":"189","volume-title":"International Conference on Functional Programming","author":"P. Wadler","year":"2003","unstructured":"Wadler, P.: Call-by-value is dual to call-by-name. In: International Conference on Functional Programming, pp. 189\u2013201. ACM Press, New York (2003)"},{"key":"27_CR35","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0168-0072(90)90059-B","volume":"50","author":"D. Wijesekera","year":"1990","unstructured":"Wijesekera, D.: Constructive modal logic I. Annals of Pure and Applied Logic\u00a050, 271\u2013301 (1990)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76637-7_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:56:25Z","timestamp":1619520985000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76637-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766360"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76637-7_27","relation":{},"subject":[]}}