Elaborating intersection and union types

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2012, Pages 17-28

  Dunfield, Jana ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

intersection types

Indexed keywords

DIFFERENTIATION (CALCULUS);

% REDUCTIONS; INTERSECTION TYPES; KEY FEATURE; LANGUAGE FEATURES; META-THEORY; PARAMETRIC POLYMORPHISM; PROPERTY; SYSTEM FEATURES; TYPE SYSTEMS; UNION TYPES;

CALCULATIONS;

EID: 84867543336     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2364527.2364534     Document Type: Conference Paper

References (33)

1. Alexander Aiken, Edward L. Wimmers, and T. K. Lakshman. Soft typing with conditional types. In 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. Information and Computation, 119:202-230, 1995.
3. Robert Cartwright and Mike Fagan. Soft typing. In Programming Language Design and Implementation, pages 278-292, 1991.
4. Giuseppe Castagna, Giorgio Ghelli, and Giuseppe Longo. A calculus for overloaded functions with subtyping. Information and Computation, 117(1):115-135, 1995.
5. 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.
6. Rowan Davies. Practical Refinement-Type Checking. PhD thesis, Carnegie Mellon University, 2005. CMU-CS-05-110.
7. Rowan Davies and Frank Pfenning. Intersection types and computational effects. In ICFP, pages 198-208, 2000.
8. Joshua Dunfield. Refined typechecking with Stardust. In Programming Languages meets Program Verification (PLPV '07), 2007.
9. Joshua Dunfield. Greedy bidirectional polymorphism. In ML Workshop, pages 15-26, 2009. http://www.cs.cmu.edu/~joshuad/papers/poly/.
10. Joshua Dunfield. Untangling typechecking of intersections and unions. In 2010 Workshop on Intersection Types and Related Systems, volume 45 of EPTCS, pages 59-70, 2011. arXiv: 1101.4428v1[cs.PL].
11. Joshua Dunfield. Twelf proofs accompanying this paper, March 2012. http://www.cs.cmu.edu/~joshuad/intcomp.tar or http://www.cs.cmu.edu/~joshuad/ intcomp/.
12. Joshua Dunfield and Frank Pfenning. Type assignment for intersections and unions in call-by-value languages. In Found. Software Science and Computation Structures (FoSSaCS '03), pages 250-266, 2003.
13. Joshua Dunfield and Frank Pfenning. Tridirectional typechecking. In Principles of Programming Languages, pages 281-292, 2004.
14. Tim Freeman and Frank Pfenning. Refinement types for ML. In Programming Language Design and Implementation, pages 268-277, 1991.
15. Alain Frisch, Giuseppe Castagna, and Véronique Benzaken. Semantic subtyping: dealing set-theoretically with function, union, intersection, and negation types. J. ACM, 55(4):1-64, 2008.
16. J. Roger Hindley. Coppo-Dezani types do not correspond to propositional logic. Theoretical Computer Science, 28:235-236, 1984.
17. J. Roger Hindley. Types with intersection: An introduction. Formal Aspects of Computing, 4:470-486, 1992.
18. Assaf J. Kfoury and J. B. Wells. Principality and type inference for intersection types using expansion variables. Theoretical Computer Science, 311(1-3):1-70, 2004.
19. David MacQueen, Gordon Plotkin, and Ravi Sethi. An ideal model for recursive polymorphic types. Information and Control, 71:95-130, 1986.
20. Peter Møller Neergaard and Harry G. Mairson. Types, potency, and idempotency: Why nonlinearity and amnesia make a type system work. In ICFP, pages 138-149, 2004.
21. Frank Pfenning and Carsten Schurmann. System description: Twelf-a meta-logical framework for deductive systems. In Int'l Conf. Automated Deduction (CADE-16), pages 202-206, 1999.
22. Benjamin C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, 1991a.
23. Benjamin C. Pierce. Programming with intersection types and bounded polymorphism. PhD thesis, Carnegie Mellon University, 1991b. Technical Report CMU-CS-91-205.
24. Benjamin C. Pierce and David N. Turner. Local type inference. ACM Trans. Prog. Lang. Syst., 22:1-44, 2000.
25. Garrel Pottinger. A type assignment for the strongly normalizable lambda-terms. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 561-577. Academic Press, 1980.
26. John C. Reynolds. Preliminary design of the programming language Forsythe. Technical Report CMU-CS-88-159, Carnegie Mellon University, 1988. http://doi.library.cmu.edu/10.1184/OCLC/18612825.
27. John C. Reynolds. The coherence of languages with intersection types. In Theoretical Aspects of Computer Software, volume 526 of LNCS, pages 675-700. Springer, 1991.
28. John C. Reynolds. Design of the programming language Forsythe. Technical Report CMU-CS-96-146, Carnegie Mellon University, 1996.
29. Sam Tobin-Hochstadt and Matthias Felleisen. The design and implementation of Typed Scheme. In Principles of Programming Languages, pages 395-406, 2008.
30. Franklyn Turbak, Allyn Dimock, Robert Muller, and J. B. Wells. Compiling with polymorphic and polyvariant flow types. In Int'l Workshop on Types in Compilation, 1997.
31. Twelf. Twelf wiki, 2012. http://twelf.org/wiki/Main-Page.
32. Philip Wadler and Stephen Blott. How to make ad-hoc polymorphism less ad hoc. In Principles of Programming Languages, pages 60-76, 1989.
33. J.B. Wells, Allyn Dimock, Robert Muller, and Franklyn Turbak. A calculus with polymorphic and polyvariant flow types. J. Functional Programming, 12(3):183-227, 2002.