ABSTRACT
Stratified type inference for generalized algebraic data types.
- James Cheney and Ralf Hinze. A lightweight implementation of generics and dynamics. In Haskell workshop, 2002. Google Scholar
Digital Library
- James Cheney and Ralf Hinze. First-class phantom types. Technical Report 1901, Cornell University, 2003.Google Scholar
- Karl Crary, Stephanie Weirich, and Greg Morrisett. Intensional polymorphism in type erasure semantics. Journal of Functional Programming, 12(6):567--600, November 2002. Google Scholar
Digital Library
- Fritz Henglein. Type inference with polymorphic recursion. ACM Transactions on Programming Languages and Systems, 15(2):253--289, April 1993. Google Scholar
Digital Library
- Ralf Hinze. Fun with phantom types. In Jeremy Gibbons and Oege de~Moor, editors, The Fun of Programming, pages 245--262. Palgrave Macmillan, March 2003.Google Scholar
- Gérard Huet. Résolution d'équations dans des langages d'ordre 1, 2, .., ω. PhD thesis, Université Paris 7, September 1976.Google Scholar
- Martin Odersky, Martin Sulzmann, and Martin Wehr. Type inference with constrained types. Theory and Practice of Object Systems, 5(1):35--55, 1999. Google Scholar
Digital Library
- Martin Odersky, Matthias Zenger, and Christoph Zenger. Colored local type inference. In ACM Symposium on Principles of Programming Languages (POPL), pages 41--53, 2001. Google Scholar
Digital Library
- Christine Paulin-Mohring. Inductive definitions in the system Coq: rules and properties. Research Report RR1992-49, ENS Lyon, 1992.Google Scholar
- Simon Peyton Jones, Dimitrios Vytiniotis, Stephanie Weirich, and Mark Shields. Practical type inference for arbitrary-rank types. Manuscript, July 2005.Google Scholar
- Simon Peyton Jones, Geoffrey Washburn, and Stephanie Weirich. Wobbly types: type inference for generalised algebraic data types. Manuscript, July 2004.Google Scholar
- Benjamin C. Pierce and David N. Turner. Local type inference. ACM Transactions on Programming Languages and Systems, 22(1):1--44, January 2000. Google Scholar
Digital Library
- François Pottier and Nadji Gauthier. Polymorphic typed defunctionalization. In ACM Symposium on Principles of Programming Languages (POPL), pages 89--98, January 2004. Google Scholar
Digital Library
- François Pottier and Yann Régis-Gianas. Towards efficient, typed LR parsers. Manuscript, April 2005.Google Scholar
- François Pottier and Didier Rémy. The essence of ML type inference. In Benjamin C. Pierce, editor, Advanced Topics in Types and Programming Languages, chapter 10, pages 389--489. MIT Press, 2005.Google Scholar
- Yann Régis-Gianas. A prototype typechecker for ML with generalized algebraic data types. http://cristal.inria.fr/~regisgia/software/, July 2005.Google Scholar
- Didier Rémy. Simple, partial type inference for system $F$ based on type containment. In ACM International Conference on Functional Programming (ICFP), September 2005. Google Scholar
Digital Library
- Tim Sheard. Languages of the future. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pages 116--119, October 2004. Google Scholar
Digital Library
- Tim Sheard and Emir Pašaliý. Meta-programming with built-in type equality. In Workshop on Logical Frameworks and Meta-Languages (LFM), July 2004.Google Scholar
- Vincent Simonet and François Pottier. Constraint-based type inference for guarded algebraic data types. Research Report 5462, INRIA, January 2005.Google Scholar
- Peter J. Stuckey and Martin Sulzmann. Type inference for guarded recursive data types. Manuscript, February 2005.Google Scholar
- Sergei G. Vorobyov. An improved lower bound for the elementary theories of trees. In International Conference on Automated Deduction (CADE), volume 1104 of Lecture Notes in Computer Science, pages 275--287. Springer Verlag, 1996. Google Scholar
Digital Library
- Hongwei Xi, Chiyan Chen, and Gang Chen. Guarded recursive datatype constructors. In ACM Symposium on Principles of Programming Languages (POPL), pages 224--235, January 2003. Google Scholar
Digital Library
Index Terms
Stratified type inference for generalized algebraic data types
Recommendations
Polymorphic type inference and abstract data types
Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to ...
Stratified type inference for generalized algebraic data types
Proceedings of the 2006 POPL ConferenceStratified type inference for generalized algebraic data types.







Comments