Abstract
Semantic subtyping is a relatively new approach to define subtyping relations where types are interpreted as sets and union, intersection and negation types have the corresponding set-theoretic interpretation. In this lecture we outline the approach, give an aperçu of its expressiveness and generality by applying it to the λ-calculus with recursive and product types and to the π-calculus. We then discuss in detail the new challenges and research perspectives that the approach brings forth.
Based on joint work with: Véronique Benzaken, Rocco De Nicola, Mariangiola Dezani, Alain Frisch, Haruo Hosoya, Daniele Varacca
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aspinall, D., Compagnoni, A.: Subtyping dependent types. In: 11th Ann. Symp. on Logic in Computer Science, pp. 86–97 (1996)
Abadi, M., Cardelli, L., Curien, P.-L.: Formal parametric polymorphism. Theoretical Computer Science 21, 9–58 (1993); Special issue in honour of Corrado Böhm
Abadi, M., Pierce, B., Plotkin, G.: Faithful ideal models for recursive polymorphic types. International Journal of Foundations of Computer Science 2(1), 1–21 (1991); Summary in Fourth Annual Symposium on Logic in Computer Science (June 1989)
Aiken, A., Wimmers, E.L.: Type inclusion constraints and type inference. In: Proceedings of the Seventh ACM Conference on Functional Programming and Computer Architecture, Copenhagen, Denmark, June 1993, pp. 31–41 (1993)
Barendregt, H., Coppo, M., Dezani-Ciancaglini, M.: A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic 48(4), 931–940 (1983)
Castagna, G., Chen, G.: Dependent types with subtyping and late-bound overloading. Information and Computation 168(1), 1–67 (2001)
Castagna, G., Dezani, M., Varacca, D.: Encoding CDuce into Cπ. Working draft (February 2005)
Castagna, G., Frisch, A.: A gentle introduction to semantic subtyping. In: Proceedings of PPDP 2005, the 7th ACM SIGPLAN International Symposium on Principles and Practice of Declarative Programming, Lisboa, Portugal. ACM Press, New York (2005); Joint ICALP-PPDP keynote talk
Chen, G.: Dependent type system with subtyping. Journal of Computer Science and Technology 14(1) (1999)
Castagna, G., De Nicola, R., Varacca, D.: Semantic subtyping for the π-calculus. In: LICS 2005, 20th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos (2005)
Damm, F.: Subtyping with union types, intersection types and recursive types II. Research Report 816, IRISA (1994)
Dezani-Ciancaglini, M., Frisch, A., Giovannetti, E., Motohama, Y.: The relevance of semantic subtyping. In: Intersection Types and Related Systems. Electronic Notes in Theoretical Computer Science 70(1) (2002)
Frisch, A., Castagna, G., Benzaken, V.: Semantic Subtyping. In: Proceedings, Seventeenth Annual IEEE Symposium on Logic in Computer Science, pp. 137–146. IEEE Computer Society Press, Los Alamitos (2002)
Frisch, A.: Théorie, conception et réalisation d’un langage de programmation fonctionnel adapté à XML. PhD thesis, Université Paris 7 (December 2004)
Gordon, A., Jeffrey, A.: Authenticity by typing for security protocols. In: CSFW 2001: 14th IEEE Computer Security Foundations Workshop, pp. 145–159 (2001)
Hosoya, H., Frisch, A., Castagna, G.: Parametric polymorphism for XML. In: POPL 2005, 32nd ACM Symposium on Principles of Programming Languages. ACM Press, New York (2005)
Harper, R., Honsell, F., Plotkin, G.: A framework for defining logics. Journal of the ACM 40(1), 143–184 (1993)
Hosoya, H.: Regular Expression Types for XML. PhD thesis, The University of Tokyo (2001)
Hosoya, H., Pierce, B.C.: Regular expression pattern matching for XML. In: The 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2001)
Hosoya, H., Pierce, B.: XDuce: A typed XML processing language. ACM Transactions on Internet Technology 3(2), 117–148 (2003)
Hennessy, M., Riely, J.: Resource access control in systems of mobile agents. Information and Computation 173, 82–120 (2002)
Longo, G., Milsted, K., Soloviev, S.: The genericity theorem and parametricity in the polymorphic λ-calculus. Theor. Comput. Sci. 121(1-2), 323–349 (1993)
Merro, M.: Locality in the pi-calculus and applications to distributed objects. PhD thesis, Ecole des Mines de Paris, Nice, France (2000)
Milner, R.: Functions as processes. Mathematical Structures in Computer Science 2(2), 119–141 (1992)
Pfenning, F.: Refinement types for logical frameworks. In: Informal Proceedings of the 1993 Workshop on Types for Proofs and Programs (May 1993)
Reynolds, J.C.: Types, abstractions and parametric polymorphism. In: Mason, R.E.A. (ed.) Information Processing 1983, pp. 513–523. North-Holland, Amsterdam (1983)
Sangiorgi, D., Walker, D.: The π-calculus. Cambridge University Press, Cambridge (2002)
Yoshida, N., Hennessy, M.: Assigning types to processes. In: Proc. of the 15th IEEE Symposium on Logic in Computer Science, pp. 334–348 (2000)
Yoshida, N.: Channel dependent types for higher-order mobile processes. In: POPL 2004: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pp. 147–160. ACM Press, New York (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Castagna, G. (2005). Semantic Subtyping: Challenges, Perspectives, and Open Problems. In: Coppo, M., Lodi, E., Pinna, G.M. (eds) Theoretical Computer Science. ICTCS 2005. Lecture Notes in Computer Science, vol 3701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11560586_1
Download citation
DOI: https://doi.org/10.1007/11560586_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29106-0
Online ISBN: 978-3-540-32024-1
eBook Packages: Computer ScienceComputer Science (R0)