{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:12:15Z","timestamp":1760080335241,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030367541"},{"type":"electronic","value":"9783030367558"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-36755-8_15","type":"book-chapter","created":{"date-parts":[[2019,12,16]],"date-time":"2019-12-16T10:05:16Z","timestamp":1576490716000},"page":"236-248","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Modal Type Theory Based on the Intuitionistic Modal Logic $$\\mathbf{IEL}^{-}$$"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6180-4323","authenticated-orcid":false,"given":"Daniel","family":"Rogozin","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1017\/S1755020315000374","volume":"9","author":"S Artemov","year":"2016","unstructured":"Artemov, S., Protopopescu, T.: Intuitionistic epistemic logic. Rev. Symb. Log. 9(2), 266\u2013298 (2016). \nhttps:\/\/doi.org\/10.1017\/S1755020315000374","journal-title":"Rev. Symb. Log."},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1017\/S0956796898002998","volume":"8","author":"PN Benton","year":"1998","unstructured":"Benton, P.N., Bierman, G.M., de Paiva, V.: Computational types from a logical perspective. J. Funct. Program. 8(2), 177\u2013193 (1998). \nhttps:\/\/doi.org\/10.1017\/S0956796898002998","journal-title":"J. Funct. Program."},{"issue":"3135","key":"15_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1002\/malq.19810273104","volume":"27","author":"RI Goldblatt","year":"1981","unstructured":"Goldblatt, R.I.: Grothendieck topology as geometric modality. Math. Log. Q. 27(3135), 495\u2013529 (1981). \nhttps:\/\/doi.org\/10.1002\/malq.19810273104","journal-title":"Math. Log. Q."},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-540-76637-7_27","volume-title":"Programming Languages and Systems","author":"Y Kakutani","year":"2007","unstructured":"Kakutani, Y.: Call-by-name and call-by-value in normal modal logic. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 399\u2013414. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-76637-7_27"},{"key":"15_CR5","unstructured":"Kavvos, G.A.: The many worlds of modal $$\\lambda $$-calculi: I. curry-howard for necessity, possibility and time. CoRR abs\/1605.08106 (2016). \nhttp:\/\/arxiv.org\/abs\/1605.08106"},{"key":"15_CR6","unstructured":"Krishnaswami, N.: A computational lambda calculus for applicative functors. \nhttp:\/\/semantic-domain.blogspot.com\/2012\/08\/a-computational-lambda-calculus-for.html"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-27683-0_14","volume-title":"Logical Foundations of Computer Science","author":"VN Krupski","year":"2016","unstructured":"Krupski, V.N., Yatmanov, A.: Sequent calculus for intuitionistic epistemic logic IEL. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 187\u2013201. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27683-0_14"},{"issue":"1","key":"15_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796807006326","volume":"18","author":"C McBride","year":"2008","unstructured":"McBride, C., Paterson, R.: Applicative programming with effects. J. Funct. Program. 18(1), 1\u201313 (2008). \nhttps:\/\/doi.org\/10.1017\/S0956796807006326","journal-title":"J. Funct. Program."},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0890-5401(91)90052-4","volume":"93","author":"E Moggi","year":"1991","unstructured":"Moggi, E.: Notions of computation and monads. Inform. Comput. 93(1), 55\u201392 (1991). \nhttps:\/\/doi.org\/10.1016\/0890-5401(91)90052-4\n\n. \nhttp:\/\/www.sciencedirect.com\/science\/article\/pii\/0890540191900524\n\n, selections from 1989 IEEE Symposium on Logic in Computer Science","journal-title":"Inform. Comput."},{"key":"15_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139567725","volume-title":"Type Theory and Formal Proof: An Introduction","author":"R Nederpelt","year":"2014","unstructured":"Nederpelt, R., Geuvers, H.: Type Theory and Formal Proof: An Introduction, 1st edn. Cambridge University Press, New York (2014)","edition":"1"},{"issue":"4","key":"15_CR11","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1017\/S0960129501003322","volume":"11","author":"F Pfenning","year":"2001","unstructured":"Pfenning, F., Davies, R.: A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11(4), 511\u2013540 (2001). \nhttps:\/\/doi.org\/10.1017\/S0960129501003322","journal-title":"Math. Struct. Comput. Sci."},{"key":"15_CR12","volume-title":"Lectures on the Curry-Howard Isomorphism","author":"MH Sorensen","year":"2006","unstructured":"Sorensen, M.H., Urzyczyn, P.: Lectures on the Curry-Howard Isomorphism. Elsevier Science, Amsterdam (2006)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36755-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,19]],"date-time":"2019-12-19T19:03:48Z","timestamp":1576782228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/lfcs-2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}