Subtyping union types

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

Volumn 3210, Issue , 2004, Pages 415-429

  Vouillon, Jérôme ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

Lambda calculus; Semantics; Subtyping; Union types

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); FORMAL LANGUAGES; PATHOLOGY; SEMANTICS;

CALL-BY-NAME; LAMBDA CALCULUS; SUBTYPING RELATION; SUBTYPINGS; UNION TYPES;

CALCULATIONS;

EID: 24944524192     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_32     Document Type: Article

References (13)

1. Damm, F.: Subtyping with union types, intersection types and recursive types II. Research Report 2259, INRIA Rennes (1994)
2. Vouillon, J.: Subtyping union types (extended version). Manuscript; available from http://www.pps.jussieu.fr/~vouillon/publi/#union. (2004)
3. Vouillon, J., Melliès, P.A.: Semantic types: A fresh look at the ideal model for types. In: Proceedings of the 31th ACM Conference on Principles of Programming Languages, Venezia, Italia, ACM Press (2004) 52-63
4. Melliès, P.A., Vouillon, J.: Recursive polymorphic types and parametricity in an operational framework. Preprint PPS//04/06//n°30; available from http://www. pps.jussieu.fr/~vouillon/publi/#semtypes2.(2004)
5. Girard, J.Y.: Interprétation fonctionelle et élimination des coupures dans l'arithmétique d'ordre supérieur. Thèse de doctorat d'État, University of Paris VII (1972)
6. Coq Development Team: The Coq Proof Assistant Reference Manual - Version V7.4. (2003) Available from http://coq.inria.fr/doc/main.html.
7. MacQueen, D., Plotkin, G., Sethi, R.: An ideal model for recursive polymorphic types. Information and Control 71 (1986) 95-130
8. Girard, J.Y.: Linear logic. Theoretical Computer Science 50 (1987) 1-102
9. Danos, V., Krivine, J.L.: Disjunctive tautologies and synchronisation schemes. In: Computer Science Logic'00. Volume 1862 of Lecture Notes in Computer Science., Springer (2000) 292-301
10. Krivine, J.L.: Typed lambda-calculus in classical Zermelo-Fraenkel set theory. Archive of Mathematical Logic 40 (2001) 189-205
11. Pitts, A.M.: Parametric polymorphism and operational equivalence. Mathematical Structures in computer Science 10 (2000) 321-359
12. Frisch, A., Castagna, G., Benzaken, V.: Semantic subtyping. In: 17th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press (2002) 137-146
13. Hosoya, H., Vouillon, J., Pierce, B.C.: Regular expression types for XML. In: Proceedings of the International Conference on Functional Programming (ICFP). (2000)