Semantic subtyping: Dealing set-theoretically with function, union, intersection, and negation types

Journal of the ACM

Volumn 55, Issue 4, 2008, Pages

  Frisch, Alain ^a,d   Castagna, Giuseppe ^b   Benzaken, Véronique ^b,c  

^a LexiFi SAS   (France)

^b CNRS   (France)

^c UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

^d LexiFi   (France)

Author keywords

Higher order functions; Intersection types; Negation types; Subtyping; Union types

Indexed keywords

SEMANTICS;

HIGHER ORDER FUNCTIONS; INTERSECTION TYPES; NEGATION TYPES; SUBTYPINGS; UNION TYPES;

FORMAL LANGUAGES;

EID: 52249093623     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1391289.1391293     Document Type: Article

References (43)

1. AIKEN, A., AND WIMMERS, E. L. 1993. Type inclusion constraints and type inference. In Proceedings of the 7th ACM Conference on Functional Programming and Computer Architecture (Copenhagen, Denmark). ACM, New York, 31-41.
2. AIKEN, A., WIMMERS, E. L., AND LAKSHMAN, T. K. 1994. Soft typing with conditional types. In Proceedings of the 21ST ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (New York, NY). ACM, New York, 163-173.
3. AMADIO, R. M., AND CARDELLI, L. 1993. Subtyping recursive types. ACM Trans. Program Lang. Syst. 15, 4 (Sept.), 575-631.
4. AMADIO, R., AND CURIEN, P.-L. 1998. Domains and Lambda Calculi. Cambridge Tracts in Theoretical Computer Science, vol. 46. Cambridge University Press, Cambridge, MA.
5. ASPERTI, A., AND LONGO, G. 1991. Categories, Types and Structures: An Introduction to Category Theory for the Working Computer Scientist. MIT Press, Cambridge, MA.
6. BARBANERA, F., DEZANI-CIANCAGLINI, M., AND DE'LIGUORO, U. 1995. Intersection and union types: Syntax and semantics. Inf. Comput. 119, 202-230.
7. BARENDREGT, H., COPPO, M., AND DEZANI-CIANCAGLINI, M. 1983. A filter lambda model and the completeness of type assignment. J. Symb. Logic 48, 4, 931-940.
8. BENZAKEN, V., CASTAGNA, G., AND FRISCH, A. 2003. CDuce: An XML-friendly general purpose language. In ICFP '03, Proceedings of the 8th ACM International Conference on Functional Programming (Uppsala, Sweden). ACM New York, 51-63.
9. CASTAGNA, G. 2005. Semantic subtyping: Challenges, perspectives, and open problems. In ICTCS 2005, Proceedings of the Italian Conference on Theoretical Computer Science. Lecture Notes in Computer Science, vol. 3701. Springer-Verlag, New York, 1-20.
10. CASTAGNA, G., DE NICOLA, R., AND VARACCA, D. 2005. Semantic subtyping for the π-calculus. In LICS '05, Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA.
11. CASTAGNA, G., DE NICOLA, R., AND VARACCA, D. 2007. Semantic subtyping for the π-calculus. Theoretical Computer Science. Special issue in honor of Mario Coppo, Mariangiola Dezani-Ciancaglini and Simona Ronchi delia Rocca. To appear.
12. CASTAGNA, G., DEZANI-CIANCAGLINI, M., AND VARACCA, D. 2006. Encoding CDuce into the π-calculus. In CONCUR 2006, Proceedings of the 17th International Conference on Concurrency Theory. Lecture Notes in Computer Science, vol. 4137. Springer-Verlag, New York, 310-326.
13. CASTAGNA, G., AND FRISCH, A. 2005. A gentle introduction to semantic subtyping. In Proceedings of PPDP '05, the 7th ACM SIGPLAN International Symposium on Principles and Practice of Declarative Programming. ACM, New York (full version) and ICALP '05, 32nd International Colloquium on Automata, Languages and Programming. Lecture Notes in Computer Science, vol. 3580. Springer-Verlag, New York (summary) (Joint ICALP-PPDP keynote talk).
14. CASTAGNA, G., GHELLI, G., AND LONGO, G. 1993. A semantics for λ&-early: A calculus with over-loading and early binding. In Proceedings of the International Conference on Typed Lambda Calculi and Applications (Utrecht, The Netherlands), M. Bezem, and J. Groote, Eds. Lecture Notes in Computer Science, vol. 664. Springer-Verlag, New York, 107-123.
15. CASTAGNA, G., GHELLI, G., AND LONGO, G. 1995. A calculus for overloaded functions with subtyping. Inf. Comput. 117, 1, 115-135.
16. CDUCE. The CDuce programming language, http://www.educe.org.
17. COPPO, M., AND DEZANI-CIANCAGLINI, M. 1980. An extension of the basic functionality theory for the λ-calculus. Notre-Dame J. Formal. Logic 21, 4 (Oct.), 685-693.
18. DAMM, F. 1994a. Subtyping with union types, intersection types and recursive types II. Research Report 816, IRISA.
19. DAMM, F. M. 1994b. Subtyping with union types, intersection types and recursive types. In Theoretical Aspects of Computer Software, M. Hagiya and J. C. Mitchell, Eds. Vol. 789. Springer-Verlag, New York, 687-706.
20. DAVIES, R., AND PFENNING, F. 2000. Intersection types and computational effects. In Proceedings of the the 5th ACM SIGPLAN International Conference on Functional Programming (ICFP '00). ACM, New York.
21. DEZANI-CIANCAGLINI, M., FRISCH, A., GIOVANNETTI, E., AND MOTOHAMA, Y. 2002. The relevance of semantic subtyping. In Intersection Types and Related Systems. Electronic Notes in Theoretical Computer Science 70, 1.
22. FREEMAN, T., AND PFENNING, F. 1991. Refinement types for ML. In Proceedings of the ACM SIGPLAN '91 Conference on Programming Language Design and Implementation. SIGPLAN Notices 26, 6 (June), 268-277.
23. FRISCH, A. 2004. Théorie, conception et réalisation d'un langage de programmation fonctionnel adapté à XML. Ph.D. dissertation. Université Paris 7.
24. FRISCH, A. 2006. OCaml + XDuce. In Proceedings of the the 11th ACM SIGPLAN International Conference on Functional Programming (ICFP'06). ACM, New York.
25. FRISCH, A., CASTAGNA, G., AND BENZAKEN, V. 2002. Semantic Subtyping. In LICS'02, Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 137-146.
26. GAPAYEV, V., AND PIERCE, B. 2003. Regular object types. In Proceedings of the ECOOP '03. Lecture Notes in Computer Science, Springer-Verlag, New York.
27. HINDLEY, R., AND LONGO, G. 1980. Lambda-calculus models and extensionality. Zeit. Math. Logik Grund. Math. 26, 2, 289-319.
28. HOSOYA, H. 2001. Regular expression types for XML. Ph.D. dissertation, The University of Tokyo, Tokyo, Japan.
29. HOSOYA, H., FRISCH, A., AND CASTAGNA, G. 2005. Parametric polymorphism for XML. In POPL '05, Proceedings of the 32nd ACM Symposium on Principles of Programming Languages. ACM Press, New York.
30. HOSOYA, H., AND PIERCE, B. 2001. Regular expression pattern matching for XML. In POPL '01, Proceedings of the 25th ACM Symposium on Principles of Programming Languages. ACM Press, New York.
31. HOSOYA, H., AND PIERCE, B. 2003. XDuce: A typed XML processing language. ACM Trans. Internet Tech. 3, 2, 117-148.
32. HOSOYA, H., VOUILLON, J., AND PIERCE, B. 2000. Regular expression types for XML. In Proceedings of the ICFP '00. SIGPLAN Notices, 35, 9.
33. MACQUEEN, D., PLOTKIN, G., AND SETHI, R. 1986. An ideal model for recursive polymorphic types. Inf. Cont. 71, 1/2, 95-130.
34. MELLIÈS, P.-A., AND VOUILLON, J. 2005. Recursive polymorphic types and parametricity in an operational framework. In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05). IEEE Computer Society Press, Los Alamitos, CA, 82-91.
35. PFENNING, F. 1993. Refinement types for logical frameworks. In Informal Proceedings of the Workshop on Types for Proofs and Programs, H. Geuvers, Ed. Nijmegen, The Netherlands, 285-299.
36. PIERCE, B. 1991. Programming with intersection types, union types, and polymorphism. Tech. Rep. CMU-CS-91-106, School of Computer Sciente, Carnegie Mellon University.
37. REYNOLDS, J. C. 1983. Types, abstraction and parametric polymorphism. In Information Processing, R. E. A. Mason, Ed. Elsevier Science Publishers B. V. (North-Holland), Amsterdam, The Netherlands, 513-523.
38. REYNOLDS, J. C. 1991. The coherence of languages with intersection types. In Theoretical Aspects of Computer Software, T. Ito and A. R. Meyer, Eds. Lecture Notes in Computer Science, vol. 526. Springer-Verlag, Berlin, Germany, 675-700.
39. REYNOLDS, J. C. 1996. Design of the programming language Forsythe. Tech. Rep. CMU-CS96-146, Carnegie Mellon University, Pittsburgh, PA, June.
40. STUDER, T. 2001. A semantics for X-{}: A calculus with overloading and late-binding. J. Logic Computation 11, 4, 527-544.
41. TSUIKI, H. 1994. A normalizing calculus with overloading and subtyping. In TACS '94, Proceedings of the Symposium on Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol 789, Springer-Verlag, New York.
42. VOUILLON, J. 2006. Polymorphic regular tree types and patterns. In POPL '06, Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 103-114.
43. VOUILLON, J., AND MELLIÉS, P.-A. 2004. Semantic types: A fresh look at the ideal model for types. In Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM, New York, 52-63.