Type assignment for intersections and unions in call-by-value languages

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

Volumn LNCS 2620, Issue , 2003, Pages 250-266

  Dunfield, Jana ^a   Pfenning, Frank ^a  

^a Carnegie Mellon University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

DEPENDENT TYPES; EVALUATION ORDER; FUNCTIONAL LANGUAGES; GENERALISATION; INTERSECTION TYPES; ISOLATED SYSTEMS; SUBTERMS; TYPE-INDEXED TYPES; TYPECHECKING; UNION TYPES;

ARTIFICIAL INTELLIGENCE;

EID: 35248833026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36576-1_16     Document Type: Conference Paper

References (17)

1. Alexander Aiken, Edward L. Wimmers, and T. K. Lakshman. Soft typing with conditional types. In Proc. 21st Symposium on Principles of Programming Languages (POPL '94), pages 163-173, 1994.
2. Franco Barbanera, Mariangiola Dezani-Ciancaglini, and Ugo de’Liguoro. Intersection and union types: syntax and semantics. Inf. and Comp., 119: 202-230, 1995.
3. R. Cartwright and M. Fagan. Soft typing. In Proc. SIGPLAN '91 Conf. Programming Language Design and Impl. (PLDI), volume 26, pages 278-292, 1991.
4. M. Coppo, M. Dezani-Ciancaglini, and B. Venneri. Functional characters of solvable terms. Zeitschrift f. math. Logik und Grundlagen d. Math., 27: 45-58, 1981.
5. Rowan Davies. Practical refinement-type checking. PhD thesis proposal, Carnegie Mellon University, 1997.
6. Rowan Davies and Frank Pfenning. Intersection types and computational effects. In Proc. Int’l Conf. Functional Programming (ICFP '00), pages 198-208, 2000.
7. Joshua Dunfield. Combining two forms of type refinements. Technical Report CMU-CS-02-182, Carnegie Mellon University, September 2002.
8. Tim Freeman and Frank Pfenning. Refinement types for ML. In Proc. SIGPLAN '91 Conf. Programming Language Design and Impl. (PLDI), volume 26, pages 268-277. ACM Press, June 1991.
9. Robin Milner, Mads Tofte, Robert Harper, and David MacQueen. The Definition of Standard ML (Revised). MIT Press, 1997.
10. Jens Palsberg and Christina Pavlopoulou. From polyvariant flow information to intersection and union types. J. Functional Programming, 11(3): 263-317, 2001.
11. Benjamin C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, 1991.
12. John C. Reynolds. Design of the programming language Forsythe. Technical Report CMU-CS-96-146, Carnegie Mellon University, 1996.
13. S. van Bakel, M. Dezani-Ciancaglini, U. de’Liguoro, and Y. Motohoma. The minimal relevant logic and the call-by-value lambda calculus. To appear, July 1999.
14. J.B. Wells, Allyn Dimock, Robert Muller, and Franklyn Turbak. A calculus with polymorphic and polyvariant flow types. J. Functional Programming, 12(3): 183-317, May 2002.
15. Hongwei Xi. Dependent types in practical programming. PhD thesis, Carnegie Mellon University, 1998.
16. Hongwei Xi. Dependently typed data structures. Revised version superseding that of WAAAPL '99, available electronically, February 2000.
17. Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In Proc. 26th Symp. on Principles of Programming Languages (POPL’99), pages 214-227. ACM Press, 1999.