OutsideIn(X) Modular type inference with local assumptions

Journal of Functional Programming

Volumn 21, Issue 4-5, 2011, Pages 333-412

  Vytiniotis, Dimitrios ^a   Peyton Jones, Simon ^a   Schrijvers, Tom ^b   Sulzmann, Martin ^c  

^a MICROSOFT RESEARCH   (United States)

^b GHENT UNIVERSITY   (Belgium)

^c Informatik Consulting Systems AG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85023151689     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796811000098     Document Type: Article

References (52)

1. Bachmair, L. & Tiwari, A. (2000) Abstract congruence closure and specializations. In Proceedings of International Conference on Automated Deduction (CADE '00), LNCS, vol. 1831. Springer-Verlag, pp. 64–78.
2. Beckert, B. (1994) A completion-based method for mixed universal and rigid E-unification. In Proceedings of International Conference on Automated Deduction (CADE '94). Springer-Verlag, pp. 678–692.
3. Chakravarty, M., Keller, G. & Peyton Jones, S. (2005a) Associated type synonyms. In Proceedings of International Conference on Functional Programming (ICFP '05). New York: ACM, pp. 241–253.
4. Chakravarty, M., Keller, G., Peyton Jones, S. & Marlow, S. (2005b) Associated types with class. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '05). New York: ACM, pp. 1–13.
5. Cheney, J. & Hinze, R. (2003) First-Class Phantom Types. TR 1901. Cornell University. Available at: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.c is/TR2003–1901
6. Damas, L. & Milner, R. (1982) Principal type-schemes for functional programs. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '82). New York, NY, USA: ACM, pp. 207–212.
7. Faxén, K.-F. (2003) Haskell and principal types. In Proceedings of the 2003 ACM SIGPLAN Workshop on Haskell (Haskell '03). New York, NY, USA: ACM, pp. 88–97.
8. Frühwirth, T. (1998) Theory and practice of Constraint Handling Rules. J. Logic Program. 37(1–3), 95–138.
9. Gallier, J. H., Narendran, P., Raatz, S. & Snyder, W. (1992) Theorem proving using equational matings and rigid E-unification. J. ACM 39(2), 377–429.
10. Hall, C. V., Hammond, K., Peyton Jones, S. L. & Wadler, P. L. (1996) Type classes in Haskell. ACM Trans. Program. Lang. Syst. 18(2), 109–138.
11. Heeren, B., Leijen, D. & van IJzendoorn, A. (2003) Helium, for learning Haskell. In Proceedings of ACM SIGPLAN 2003 Haskell Workshop. New York: ACM, pp. 62–71.
12. Jones, M. P. (September 1992) Qualified Types: Theory and Practice. DPhil thesis, Oxford University.
13. Jones, M. P. (September 1993) Coherence for Qualified Types. Research Report YALEU/DCS/RR-989. New Haven, CT: Yale University.
14. Jones, M. P. (2000) Type classes with functional dependencies. In Proceedings of European Symposium on Programming Languages and Systems (ESOP '00), LNCS, vol. 1782. Springer Verlag.
15. Kapur, D. (1997) Shostak's congruence closure as completion. In Proceedings of International Conference on Rewriting Techniques and Applications (RTA '97). London, UK: Springer Verlag, pp. 23–37.
16. Kennedy, A. J. (September 1996) Type Inference and Equational Theories. LIX RR/96/09. Ecole Polytechnique.
17. Kiselyov, O., Peyton Jones, S. & Shan, C.-C. (2010) Fun with type functions. In Reflections on the work of C. A. R. Hoare, A. W. Roscoe, Cliff B. Jones & Ken Wood (eds). Springer, 303–333.
18. Lämmel, R. & Peyton Jones, S. (2003) Scrap your boilerplate: A practical design pattern for generic programming. In Proceedings of ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI '03). New York: ACM, pp. 26–37.
19. Lämmel, R. & Peyton Jones, S. (2005) Scrap your boilerplate with class: extensible generic functions. In Proceedings of ACM SIGPLAN International Conference on Functional Programming (ICFP '05). New York, NY, USA: ACM, pp. 204–215.
20. Läufer, K. & Odersky, M. (1994) Polymorphic type inference and abstract data types. ACM Trans. Program. Languages Syst. 16(5), 1411–1430.
21. Lin, C.-K. & Sheard, T. (2010a) Pointwise generalized algebraic data types. In Proceedings of ACM SIGPLAN workshop on Types in language design and implementation (TLDI '10). New York, NY, USA: ACM, pp. 51–62.
22. Lin, C.-K. & Sheard, T. (July 2010b) Three Techniques for GADT Type Inference. Draft.
23. Maher, M. (2005) Herbrand constraint abduction. In Proceedings of Annual IEEE Symposium on Logic in Computer Science (LICS '05). IEEE Computer Society, pp. 397–406.
24. Milner, R. (1978) A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17(3), 348–375.
25. Nieuwenhuis, R. & Oliveras, A. (2005) Proof-producing congruence closure. In Proceedings of International Conference on Rewriting Techniques and Applications (RTA '05). LNCS, vol. 3467. Springer-Verlag, pp. 453–468.
26. Nipkow, T. & Prehofer, C. (1995) Type reconstruction for type classes. J. Funct. Program. 5(2), 201–224.
27. Odersky, M., Sulzmann, M. & Wehr, M. (1999) Type inference with constrained types. Theor. Pract. Object Syst. 5(1), 35–55.
28. Peyton Jones, S., Vytiniotis, D., Weirich, S. & Shields, M. (January 2007) Practical type inference for arbitrary-rank types. J. Funct. Program. 17(1), 1–82.
29. Peyton Jones, S., Vytiniotis, D., Weirich, S. & Washburn, G. (2006) Simple unification-based type inference for GADTs. In Proceedings of ACM SIGPLAN International Conference on Functional Programming (ICFP '06). ACM, pp. 50–61.
30. Peyton Jones, S., Washburn, G. & Weirich, S. (July 2004) Wobbly Types: Type Inference for Generalised Algebraic Data Types. Technical Report MS-CIS-05–26. Philadelphia, Pennsylvania: University of Pennsylvania.
31. Pottier, F. & Régis-Gianas, Y. (2006) Stratified type inference for generalized algebraic data types. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '06). ACM, pp. 232–244.
32. Pottier, F. & Rémy, D. (2005) The essence of ML type inference. In Advanced Topics in Types and Programming Languages, Pierce, B. C. (ed), Chapter 10. MIT Press, pp. 389–489.
33. Schrijvers, T., Guillemette, L-J. & Monnier, S. (2008b) Type invariants for Haskell. In Proceedings of Workshop on Programming Languages Meets Program Verification (PLPV '09). New York, NY, USA: ACM, pp. 39–48.
34. Schrijvers, T., Peyton Jones, S., Chakravarty, M. & Sulzmann, M. (2008a) Type checking with open type functions. In Proceedings of ACM SIGPLAN International Conference on Functional Programming (ICFP '08). New York, NY, USA: ACM, pp. 51–62.
35. Schrijvers, T., Peyton Jones, S., Sulzmann, M. & Vytiniotis, D. (2009) Complete and decidable type inference for GADTs. In Proceedings of ACM SIGPLAN International Conference on Functional Programming (ICFP '09). ACM.
36. Schrijvers, T., Sulzmann, M., Peyton Jones, S. & Chakravarty, M. (2007) Towards open type functions for Haskell. In Proceedings of International Symposium on Implementation and Application of Functional Languages (IFL '09), Chitil, O. (ed), pp. 233–251.
37. Simonet, V. & Pottier, F. (2007) A constraint-based approach to guarded algebraic data types. ACM Trans. Program. Lang. Syst. 29(1).
38. Skalka, C. & Pottier, F. (2003) Syntactic type soundness for HM(X). Electron. Notes Theor. Comput. Sci. 75, 61–74.
39. Stuckey, P. J. & Sulzmann, M. (2005) A theory of overloading. ACM Trans. Program. Lang. Syst. 27(6), 1–54.
40. Sulzmann, M. (May 2000) A General Framework for Hindley/Milner Type Systems with Constraints. Ph.D. thesis, Department of Computer Science, Yale University.
41. Sulzmann, M., Chakravarty, M., Peyton Jones, S. & Donnelly, K. (2007a) System F with type equality coercions. In Proceedings of ACM SIGPLAN International Workshop on Types in Languages Design and Implementation (TLDI '07). ACM.
42. Sulzmann, M., Duck, G. J., Peyton Jones, S. & Stuckey, P. J. (2007b) Understanding functional dependencies via constraint handling rules. J. Funct. Program. 17(1), 83–129.
43. Sulzmann, M., Müller, M. & Zenger, C. (1999) Hindley/Milner Style Type Systems in Constraint Form. Research Report ACRC-99–009. School of Computer and Information Science, University of South Australia.
44. Sulzmann, M., Schrijvers, T. & Stuckey, P. J. (2006a) Principal type inference for GHC-style multi-parameter type classes. In Proceedings of Asian Symposium on Programming Languages and Systems (APLAS '06). LNCS, vol. 4279. Springer-Verlag, pp. 26–43.
45. Sulzmann, M., Schrijvers, T. & Stuckey, P. (January 2008) Type Inference for GADTs via Herbrand Constraint Abduction. Report CW 507. Leuven, Belgium: Department of Computer Science, K.U. Leuven.
46. Sulzmann, M., Wazny, J. & Stuckey, P. (2006b) A framework for extended algebraic data types. In Proceedings of International Symposium on Functional and. Logic Programming (FLOPS '06). LNCS, vol. 3945. Springer-Verlag, pp. 47–64.
47. Tofte, M. (1990) Type inference for polymorphic references. Inf. comput. 89(1), 1–34.
48. Vytiniotis, D., Peyton Jones, S. & Schrijvers, T. (2010) Let should not be generalized. In Proceedings of ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI '10). New York, NY, USA: ACM, pp. 39–50.
49. Wadler, P. & Blott, S. (1989) How to make ad-hoc polymorphism less ad hoc. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '89). ACM.
50. Weirich, S., Vytiniotis, D., Peyton Jones, S. & Zdancewic, S. (2010) Generative type abstraction and type-level computation. In Proceedings of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '10). ACM.
51. Wright, A. (1995) Simple imperative polymorphism. Lisp Symb. Comput. 8, 343–355.
52. Xi, H., Chen, C. & Chen, G. (2003) Guarded recursive datatype constructors. In Proceedings ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL '03). ACM, pp. 224–235.