{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T20:45:28Z","timestamp":1648759528234},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2013,10,8]],"date-time":"2013-10-08T00:00:00Z","timestamp":1381190400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s00236-013-0186-2","type":"journal-article","created":{"date-parts":[[2013,10,7]],"date-time":"2013-10-07T07:19:51Z","timestamp":1381130391000},"page":"359-380","source":"Crossref","is-referenced-by-count":0,"title":["Judgmental subtyping systems with intersection types and modal types"],"prefix":"10.1007","volume":"50","author":[{"given":"Jeongbong","family":"Seo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sungwoo","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,8]]},"reference":[{"issue":"4","key":"186_CR1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"ND Belnap","year":"1982","unstructured":"Belnap, N.D.: Display logic. J. Philos. Logic 11(4), 375\u2013417 (1982)","journal-title":"J. Philos. Logic"},{"issue":"4","key":"186_CR2","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1093\/comjnl\/43.4.274","volume":"43","author":"T Borghuis","year":"2000","unstructured":"Borghuis, T., Feijs, L.: A constructive logic for services and information flow in computer networks. Comput. J. 43(4), 275\u2013289 (2000)","journal-title":"Comput. J."},{"key":"186_CR3","doi-asserted-by":"crossref","unstructured":"Castagna, G., Xu, Z.: Set-theoretic foundation of parametric polymorphism and subtyping. In: Proceedings of the 16th ACM SIGPLAN International Conference on Functional Programming, pp. 94\u2013106. ACM (2011)","DOI":"10.1145\/2034773.2034788"},{"key":"186_CR4","doi-asserted-by":"crossref","unstructured":"Davies, R., Pfenning, F.: Intersection types and computational effects. In: Proceedings of the ACM SIGPLAN International Conference on Functional Programming, pp. 198\u2013208. ACM Press (2000)","DOI":"10.1145\/351240.351259"},{"issue":"4","key":"186_CR5","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1145\/1391289.1391293","volume":"55","author":"A Frisch","year":"2008","unstructured":"Frisch, A., Castagna, G., Benzaken, V.: Semantic subtyping: dealing set-theoretically with function, union, intersection, and negation types. J. ACM 55(4), 191\u20131964 (2008)","journal-title":"J. ACM"},{"key":"186_CR6","doi-asserted-by":"crossref","unstructured":"Galmiche, D., Salhi, Y.: Label-free proof systems for intuitionistic modal logic IS5. In: Proceedings of the 16th International Conference on Logic for Programming, Artificial intelligence, and Reasoning, LPAR\u201910, pp. 255\u2013271. Springer (2010)","DOI":"10.1007\/978-3-642-17511-4_15"},{"issue":"2","key":"186_CR7","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1145\/767193.767195","volume":"3","author":"H Hosoya","year":"2003","unstructured":"Hosoya, H., Pierce, B.C.: XDuce: a statically typed XML processing language. ACM Trans. Internet Technol. 3(2), 117\u2013148 (2003)","journal-title":"ACM Trans. Internet Technol."},{"key":"186_CR8","doi-asserted-by":"crossref","unstructured":"Jia, L., Walker, D.: Modal proofs as distributed programs (extended abstract). In: Proceedings of the European Symposium on Programming, LNCS 2986, pp. 219\u2013233. Springer (2004)","DOI":"10.1007\/978-3-540-24725-8_16"},{"key":"186_CR9","doi-asserted-by":"crossref","unstructured":"Kfoury, A.J., Wells, J.B.: Principality and decidable type inference for finite-rank intersection types. In: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 161\u2013174. ACM (1999)","DOI":"10.1145\/292540.292556"},{"key":"186_CR10","unstructured":"Laurent, O.: Intersection types with subtyping by means of cut-elimination. Unpublished note, January 2005"},{"key":"186_CR11","unstructured":"Longo, G., Milsted, K., Soloviev, S.: A logic of subtyping. In: Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science, pp. 292\u2013299. IEEE Computer Society Press (1995)"},{"key":"186_CR12","doi-asserted-by":"crossref","unstructured":"Murphy, T., VII, Crary, K., Harper, R., Pfenning, F.: A symmetric modal lambda calculus for distributed computing. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science, pp. 286\u2013295. IEEE Press (2004)","DOI":"10.1109\/LICS.2004.1319623"},{"key":"186_CR13","doi-asserted-by":"crossref","unstructured":"Park, S.: A calculus for probabilistic languages. In: Proceedings of the 2003 ACM SIGPLAN International Workshop on Types in Language Design and Implementation, pp. 38\u201349. ACM Press (2003)","DOI":"10.1145\/604174.604180"},{"key":"186_CR14","doi-asserted-by":"crossref","unstructured":"Pfenning, F.: Structural cut elimination. In: Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science, pp. 156\u2013166. IEEE (1995)","DOI":"10.1109\/LICS.1995.523253"},{"issue":"4","key":"186_CR15","doi-asserted-by":"crossref","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)","journal-title":"Math. Struct. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0186-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-013-0186-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0186-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T19:57:46Z","timestamp":1564430266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-013-0186-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,8]]},"references-count":15,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["186"],"URL":"https:\/\/doi.org\/10.1007\/s00236-013-0186-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,8]]}}}