Semantic subtyping: Challenges, perspectives, and open problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3701 LNCS, Issue , 2005, Pages 1-20

  Castagna, Giuseppe ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIFFERENTIATION (CALCULUS); OPEN SYSTEMS; PROBLEM SOLVING; SET THEORY;

NEGATION; OPEN PROBLEMS; SEMANTIC SUBTYPING;

SEMANTICS;

EID: 33646202920     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11560586_1     Document Type: Conference Paper

References (29)

1. [AC96] D. Aspinall and A. Compagnoni. Subtyping dependent types. In 11th Ann. Symp. on Logic in Computer Science, pages 86-97, 1996.
2. [ACC93] M. Abadi, L. Cardelli, and P.-L. Curien. Formal parametric polymorphism. Theoretical Computer Science, 21:9-58, 1993. Special issue in honour of Corrado Böhm.
3. [APP91] Martín Abadi, Benjamin Pierce, and Gordon Plotkin. Faithful ideal models for recursive polymorphic types. International Journal of Foundations of Computer Science, 2(1):1-21, March 1991. Summary in Fourth Annual Symposium on Logic in Computer Science, June, 1989.
4. [AW93] Alexander Aiken and Edward L. Wimmers. Type inclusion constraints and type inference. In Proceedings of the Seventh ACM Conference on Functional Programming and Computer Architecture, pages 31-41, Copenhagen, Denmark, June 93.
5. [BCD83] H. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48(4):931-940, 1983.
6. [CC01] G. Castagna and G. Chen. Dependent types with subtyping and late-bound overloading. Information and Computation, 168(1): 1-67, 2001.
7. [CDV05] G. Castagna, M. Dezani, and D. Varacca. Encoding ℂDuce into ℂπ. Working draft, February 2005.
8. [CF05] G. Castagna and A. Frisch. A gentle introduction to semantic subtyping. In Proceedings of PPDP '05, the 7th ACM SIGPLAN International Symposium on Principles and Practice of Declarative Programming, Lisboa, Portugal, 2005. ACM Press. Joint ICALP-PPDP keynote talk.
9. [Che99] G. Chen. Dependent type system with subtyping. Journal of Computer Science and Technology, 14(1), 1999.
10. [CNV05] G. Castagna, R. De Nicola, and D. Varacca. Semantic subtyping for the π-calculus. In LICS '05, 20th Annual IEEE Symposium on Logic in Computer Science. IEEE Computer Society Press, 2005.
11. [Dam94] F. Damm. Subtyping with union types, intersection types and recursive types II. Research Report 816, IRISA, 1994.
12. [DCFGM02] M. Dezani-Ciancaglini, A. Frisch, E. Giovannetti, and Y. Motohama. The relevance of semantic subtyping. In Intersection Types and Related Systems. Electronic Notes in Theoretical Computer Science 70(1), 2002.
13. [FCB02] Alain Frisch, Giuseppe Castagna, and Véronique Benzaken. Semantic Subtyping. In Proceedings, Seventeenth Annual IEEE Symposium on Logic in Computer Science, pages 137-146. IEEE Computer Society Press, 2002.
14. [Fri04] Alain Frisch. Théorie, conception et realisation d'un langage de programmation fonctionnel adapté à XML. PhD thesis, Université Paris 7, December 2004.
15. [GJ01] A. Gordon and A. Jeffrey. Authenticity by typing for security protocols. In CSFW 2001: 14th IEEE Computer Security Foundations Workshop, pages 145-159, 2001.
16. [HFC05] H. Hosoya, A. Frisch, and G. Castagna. Parametric polymorphism for XML. In POPL '05, 32nd ACM Symposium on Principles of Programming Languages. ACM Press, 2005.
17. [HHP93] R. Harper, F. Honsell, and G. Plotkin. A framework for defining logics. Journal of the ACM, 40(1): 143-184, January 1993.
18. [Hos01] Haruo Hosoya. Regular Expression Types for XML. PhD thesis, The University of Tokyo, 2001.
19. [HP01] Haruo Hosoya and Benjamin C. Pierce. Regular expression pattern matching for XML. In The 25th Annual ACM SIGPLAN-SIGACTSymposium on Principles of Programming Languages, 2001.
20. [HP03] H. Hosoya and B. Pierce. XDuce: A typed XML processing language. ACM Transactions on Internet Technology, 3(2):117-148, 2003.
21. [HR02] M. Hennessy and J. Riely. Resource access control in systems of mobile agents. Information and Computation, 173:82-120, 2002.
22. [LMS93] Giuseppe Longo, Kathleen Milsted, and Sergei Soloviev. The genericity theorem and parametricity in the polymorphic λ-calculus. Theor. Comput. Sci., 121(1-2):323-349, 1993.
23. [Mer00] Massimo Merro. Locality in the pi-calculus and applications to distributed objects. PhD thesis, Ecole des Mines de Paris, Nice, France, 2000.
24. [Mil92] R. Milner. Functions as processes. Mathematical Structures in Computer Science, 2(2): 119-141, 1992.
25. [Pfe93] F. Pfenning. Refinement types for logical frameworks. In Informal Proceedings of the 1993 Workshop on Types for Proofs and Programs, May 1993.
26. [Rey83] J.C. Reynolds. Types, abstractions and parametric polymorphism. In R.E.A. Mason, editor, Information Processing '83, pages 513-523. North-Holland, 1983.
27. [SW02] D. Sangiorgi and D. Walker. The π-calculus. Cambridge University Press, 2002.
28. [YH00] N. Yoshida and M. Hennessy. Assigning types to processes. In Proc. of the 15th IEEE Symposium on Logic in Computer Science, pages 334-348, 2000.
29. [Yos04] Nobuko Yoshida. Channel dependent types for higher-order mobile processes. In POPL '04: Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 147-160. ACM Press, 2004.