Abstract
We study how to extend modal type systems based on intuitionistic modal logic S4 or S5 with a subtyping system based on intersection types. In the presence of four type constructors \({\!}\!\rightarrow \!{\!},\,{\!}\wedge {\!},\,\square {}\), and \(\Diamond {}\), the traditional approach using a binary subtyping relation does not work well because of lack of orthogonality in subtyping rules and presence of a transitivity rule. We adopt the idea from the judgmental formulation of modal logic (Pfenning and Davies in Math Struct Comput Sci 11(4):511–540, 2001) and use subtyping judgments whose definitions express those notions internalized into type constructors directly at the level of judgments. The resultant judgmental subtyping systems admit cut rules similarly to a sequent calculus for intuitionistic logic and play a key role in designing and verifying the relational subtyping systems based on the binary subtyping relation. We use the proof assistant Coq to prove the admissibility of the cut rules and the equivalence between the two kinds of subtyping systems. The lesson from our study is that by using subtyping judgments instead of the binary subtyping relation, we can overcome the limitation usually associated with the syntactic approach to formulating subtyping systems.
Similar content being viewed by others
References
Belnap, N.D.: Display logic. J. Philos. Logic 11(4), 375–417 (1982)
Borghuis, T., Feijs, L.: A constructive logic for services and information flow in computer networks. Comput. J. 43(4), 275–289 (2000)
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–106. ACM (2011)
Davies, R., Pfenning, F.: Intersection types and computational effects. In: Proceedings of the ACM SIGPLAN International Conference on Functional Programming, pp. 198–208. ACM Press (2000)
Frisch, A., Castagna, G., Benzaken, V.: Semantic subtyping: dealing set-theoretically with function, union, intersection, and negation types. J. ACM 55(4), 191–1964 (2008)
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’10, pp. 255–271. Springer (2010)
Hosoya, H., Pierce, B.C.: XDuce: a statically typed XML processing language. ACM Trans. Internet Technol. 3(2), 117–148 (2003)
Jia, L., Walker, D.: Modal proofs as distributed programs (extended abstract). In: Proceedings of the European Symposium on Programming, LNCS 2986, pp. 219–233. Springer (2004)
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–174. ACM (1999)
Laurent, O.: Intersection types with subtyping by means of cut-elimination. Unpublished note, January 2005
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–299. IEEE Computer Society Press (1995)
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–295. IEEE Press (2004)
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–49. ACM Press (2003)
Pfenning, F.: Structural cut elimination. In: Proceedings of the Tenth Annual IEEE Symposium on Logic in Computer Science, pp. 156–166. IEEE (1995)
Pfenning, F., Davies, R.: A judgmental reconstruction of modal logic. Math. Struct. Comput. Sci. 11(4), 511–540 (2001)
Acknowledgments
This work was supported by the National Research Foundation of Korea(NRF) grant funded by the Korea government(MSIP) (No. NRF-2008-0062609) and Mid-career Researcher Program through NRF funded by the MEST (2010-0022061).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Seo, J., Park, S. Judgmental subtyping systems with intersection types and modal types. Acta Informatica 50, 359–380 (2013). https://doi.org/10.1007/s00236-013-0186-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00236-013-0186-2