Greedy bidirectional polymorphism

ML'09 - Proceedings of the 2009 ACM SIGPLAN Workshop on ML

Volumn , Issue , 2009, Pages 15-26

  Dunfield, Jana ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

Languages

Indexed keywords

BIDIRECTIONALITY; GREEDY METHOD; HIGHER-RANK POLYMORPHISM; LANGUAGE; PARAMETRIC POLYMORPHISM; POWER; SYSTEM F; TYPE SYSTEMS; TYPECHECKING;

EID: 70450282386     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1596627.1596631     Document Type: Conference Paper

References (32)

1. Andreas Abel. Termination checking with types. RAIRO - Theoretical Informatics and Applications, 38(4):277-319, 2004. Special Issue: Fixed Points in Computer Science (FICS'03).
2. Andreas Abel, Thierry Coquand, and Peter Dybjer. Verifying a semantic βτ-conversion test for Martin-Löf type theory. In Mathematics of Program Construction (MPC'08), volume 5133 of LNCS, pages 29-56, 2008.
3. <:. Research report 97, DEC/Compaq Systems Research Center, February 1993.
4. Adam Chlipala, Leaf Petersen, and Robert Harper. Strict bidirectional type checking. In Workshop on Types in Language Design and Impl. (TLDI '05), pages 71-78, 2005.
5. Thierry Coquand. An algorithm for type-checking dependent types. Science of Computer Programming, 26(1-3):167-177, 1996.
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 Programming Verification (PLPV '07), 2007a.
9. Joshua Dunfield. Bidirectional polymorphism through greed and unions. URL http://type-refinements.info/bipoly/. Unpublished manuscript, April 2009.
10. Joshua Dunfield. A Unified System of Type Refinements. PhD thesis, Carnegie Mellon University, 2007b. CMU-CS-07-129.
11. 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.
12. Joshua Dunfield and Frank Pfenning. Tridirectional typechecking. In POPL, pages 281-292, January 2004.
13. Andrew Gill, John Launchbury, and Simon L Peyton Jones. A short cut to deforestation. In Functional Programming and Computer Architecture, pages 223-232, 1993.
14. Jean-Yves Girard. The system F of variable types, fifteen years later. Theoretical Computer Science, 45(2):159-192, 1986.
15. A. J. Kfoury and J. B. Wells. A direct algorithm for type inference in the rank-2 fragment of the second-order A-calculus. In LISP and Functional Programming, pages 196-207, 1994.
16. F: raising ML to the power of System F. In ICFP, pages 27-38, 2003.
17. Daan Leijen. Flexible types: robust type inference for first-class polymorphism. In POPL, pages 66-77, January 2009.
18. Andres Löh, Conor McBride, and Wouter Swierstra. A tutorial implementation of a dependently typed lambda calculus. Unpublished draft, http://people.cs.uu.nl/andres/LambdaPi/index.html, 2008.
19. William Lovas and Frank Pfenning. A bidirectional refinement type system for LF. In Int'l Workshop on Logical Frameworks and Meta-languages, Electronic Notes in Theoretical Computer Science, pages 113-128. Elsevier, July 2007.
20. Ulf Norell. Towards a Practical Programming Language Based on Dependent Type Theory. PhD thesis, Dept. of Computer Science and Engineering, Chalmers University of Technology, 2007.
21. Martin Odersky, Matthias Zenger, and Christoph Zenger. Colored local type inference. In POPL, pages 41-53, 2001.
22. Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Mark Shields. Practical type inference for arbitrary-rank types. J. Functional Programming, 17(1):1-82, 2007.
23. Brigitte Pientka. A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions. In POPL, pages 371-382, 2008.
24. Brigitte Pientka and Joshua Dunfield. Programming with proofs and explicit contexts. In Principles and Practice of Declarative Programming (PPDP'08), pages 163-173, 2008.
25. Benjamin C. Pierce. Programming with intersection types, union types, and polymorphism. Technical Report CMU-CS-91-106, Carnegie Mellon University, 1991.
26. Benjamin C. Pierce and David N. Turner. Local type inference. ACM Trans. Programming Languages and Systems, 22:1-44, 2000.
27. F: graphic type constraints with efficient type inference. In ICFP, pages 63-74, 2008.
28. John C. Reynolds. Towards a theory of type structure. In Colloque sur la Programmation, volume 19 of LNCS, pages 408-425. Springer, 1974. http://www.cs.cmu.edu/afs/cs/user/jcr/ftp/theotypestr.pdf.
29. John C. Reynolds. Design of the programming language Forsythe. Technical Report CMU-CS-96-146, Carnegie Mellon University, 1996.
30. Andrew Tolmach and Dino P. Oliva. From ML to Ada: Strongly-typed language interoperability via source translation. J. Functional Programming, 8(4):367-412, 1998.
31. J. B. Wells. Typability and type checking in System F are equivalent and undecidable. Annals of Pure and Applied Logic, 98:111-156, 1999.
32. Hongwei Xi. Dependent Types in Practical Programming. PhD thesis, Carnegie Mellon University, 1998.