Tridirectional typechecking

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn 31, Issue , 2004, Pages 281-292

  Dunfield, Jana ^a   Pfenning, Frank ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Dependent types; Intersection types; Type refinements; Union types

Indexed keywords

ABSTRACTING; ALGORITHMS; APPROXIMATION THEORY; COMPUTER PROGRAMMING LANGUAGES; INFORMATION ANALYSIS; PROBLEM SOLVING;

DEPENDENT TYPES; INTERSECTION TYPES; TYPE REFINEMENTS; UNION TYPES;

SEMANTICS;

EID: 2442417882     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/964001.964025     Document Type: Conference Paper

References (29)

1. Alexander Aiken, Edward L. Wimmers, and T. K. Lakshman. Soft typing with conditional types. In ACM Symp. Principles of Programming Languages, 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 SIGPLAN 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. A practical refinement-type checker for Standard ML. In Algebraic Methodology and Software Tech. (AMAST'97), pages 565-566. Springer LNCS 1349, 1997.
6. Rowan Davies. Practical refinement-type checking. PhD thesis proposal, Carnegie Mellon University, 1997.
7. Rowan Davies and Frank Pfenning. Intersection types and computational effects. In Int'l Conf. Functional Programming (ICFP '00), pages 198-208, 2000.
8. Joshua Dunfield. Combining two forms of type refinements. Technical Report CMU-CS-02-182, Carnegie Mellon University, September 2002.
9. Joshua Dunfield and Frank Pfenning. Type assignment for intersections and unions in call-by-value languages. In Found. Software Science and Computational Structures (FOSSACS '03), pages 250-266, Warsaw, Poland, April 2003. Springer LNCS 2620.
10. Tim Freeman. Refinement types for ML. PhD thesis, Carnegie Mellon University, 1994. CMU-CS-94-110.
11. Tim Freeman and Frank Pfenning. Refinement types for ML. In SIGPLAN Conf. Programming Language Design and Impl. (PLDI), volume 26, pages 268-277. ACM Press, 1991.
12. Haruo Hosoya and Benjamin C. Pierce. How good is local type inference? Technical Report MS-CIS-99-17, University of Pennsylvania, June 1999.
13. Trevor Jim. What are principal typings and what are they good for? Technical memorandum MIT/LCS/TM-532, MIT, November 1995.
14. Yitzhak Mandelbaum, David Walker, and Robert Harper. An effective theory of type refinements. Technical Report TR-656-02, Princeton, December 2002.
15. Jens Palsberg and Christina Pavlopoulou. From polyvariant flow information to intersection and union types. J. Func. Prog., 11(3):263-317, 2001.
16. Benjamin C. Pierce. Programming with intersection types and bounded polymorphism. PhD thesis, Carnegie Mellon University, 1991. Technical Report CMU-CS-91-205.
17. Benjamin C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, 1991.
18. Benjamin C. Pierce and David N. Turner. Local type inference. In ACM Symp. Principles of Programming Languages, pages 252-265, 1998. Full version in ACM Trans. Prog. Lang. Sys., 22(1): 1-44, 2000.
19. Benjamin C. Pierce and David N. Turner. Local type inference. In ACM Symp. Principles of Programming Languages, pages 252-265, 1998. Full version in ACM Trans. Prog. Lang. Sys., 22(1): 1-44, 2000.
20. John C. Reynolds. Design of the programming language Forsythe. Technical Report CMU-CS-96-146, Carnegie Mellon University, 1996.
21. Fred Smith, David Walker, and Greg Morrisett. Alias types. In European Symp. on Programming (ESOP'00), pages 366-381, Berlin, Germany, March 2000.
22. Jean-Pierre Talpin and Pierre Jouvelot. The type and effect discipline. Inf. and Comp., 111(2):245-296, 1994.
23. Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Inf. and Comp., 132(2):109-176, 1997.
24. J. B. Wells and Christian Haack. Branching types. In European Symp. on Programming (ESOP'02), pages 115-132, 2002.
25. J.B. Wells, Allyn Dimock, Robert Muller, and Franklyn Turbak. A calculus with polymorphic and polyvariant flow types. J. Func. Prog., 12(3): 183-317, May 2002.
26. Joe Wells. The essence of principal typings. In Int'l Coll. Automata, Languages, and Programming, volume 2380 of LNCS, pages 913-925. Springer, 2002.
27. Hongwei Xi. Dependent types in practical programming. PhD thesis, Carnegie Mellon University, 1998.
28. Hongwei Xi. Dependently typed data structures. Revision superseding WAAAPL '99, February 2000.
29. Hongwei Xi and Frank Pfenning. Dependent types in practical programming. In ACM Symp. Principles of Programming Languages, pages 214-227, 1999.