Skip to main content

A Gentle Introduction to Semantic Subtyping

  • Conference paper
Automata, Languages and Programming (ICALP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3580))

Included in the following conference series:

  • 3246 Accesses

Abstract

Subtyping relations are usually defined either syntactically by a formal system or semantically by an interpretation of types into an untyped denotational model. This work shows how to define a subtyping relation semantically in the presence of boolean connectives, functional types and dynamic dispatch on types, without the complexity of denotational models, and how to derive a complete subtyping algorithm. The presentation is voluntarily kept informal and discursive and the technical details are reduced to a minimum since we rather insist on the motivations, the intuition, and the guidelines to apply the approach.

Joint ICALP/PPDP 2005 keynote talk, short overview. The full article is included in the proceedings of PPDP ’05[3]

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aiken, A., Wimmers, E.L.: Type inclusion constraints and type inference. In: Proc. of the 7th ACM Conference on Functional Programming and Computer Architecture (1993)

    Google Scholar 

  2. Benzaken, V., Castagna, G., Frisch, A.: CDuce: an XML-friendly general purpose language. In: ICFP 2003, 8th ACM International Conference on Functional Programming (2003)

    Google Scholar 

  3. Castagna, G., Frisch, A.: A gentle introduction to semantic subtyping. In: Proc. of PPDP 2005, the 7th ACM Symposium on Principles and Practice of Declarative Programming (2005)

    Google Scholar 

  4. Damm, F.: Subtyping with union types, intersection types and recursive types II. Research Report 816, IRISA (1994)

    Google Scholar 

  5. Frisch, A.: Théorie, conception et réalisation d’un langage de programmation fonctionnel adapté à XML. PhD thesis, Université Paris (December 7, 2004)

    Google Scholar 

  6. Frisch, A., Castagna, G., Benzaken, V.: Semantic Subtyping. In: Proc. of LICS 2002, the 7th Annual IEEE Symposium on Logic in Computer Science, pp. 137–146 (2002)

    Google Scholar 

  7. Hosoya, H., Pierce, B.: XDuce: A typed XML processing language. ACM Transactions on Internet Technology 3(2), 117–148 (2003)

    Article  Google Scholar 

  8. Hosoya, H.: Regular Expression Types for XML. PhD thesis, University of Tokyo (2001)

    Google Scholar 

  9. Hosoya, H., Pierce, B.C.: Regular expression pattern matching for XML. In: Proc. of POPL 2001, the 25th Annual ACM Symposium on Principles of Programming Languages (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castagna, G., Frisch, A. (2005). A Gentle Introduction to Semantic Subtyping. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_3

Download citation

  • DOI: https://doi.org/10.1007/11523468_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-27580-0

  • Online ISBN: 978-3-540-31691-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics