Programming examples needing polymorphic recursion

Electronic Notes in Theoretical Computer Science

Volumn 136, Issue , 2005, Pages 57-102

  Hallett, J J ^a   Kfoury, A J ^a  

^a BOSTON UNIVERSITY   (United States)

Author keywords

Examples; Finitary polymorphism; Intersection types; Polymorphic recursion

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; KNOWLEDGE ACQUISITION; RECURSIVE FUNCTIONS; RESEARCH AND DEVELOPMENT MANAGEMENT;

EXAMPLES; FINITARY POLYMORPHISM; INTERSECTION TYPES; POLYMORPHIC RECURSION;

MATHEMATICAL PROGRAMMING;

EID: 21744444047     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.06.014     Document Type: Conference Paper

References (17)

1. M. Emms, and H. Leiss Standard ml with polymorphic recursion, 1998 http://www.cis.uni-muenchen.de/projects/polyrec.html
2. C. Haack, and J.B. Wells Type error slicing in implicitly typed, higher-order languages Programming Languages & Systems, 12th European Symp. Programming LNCS vol. 2618 2003 Springer-Verlag Superseded by [3]
3. C. Haack, and J.B. Wells Type error slicing in implicitly typed, higher-order languages Sci. Comput. Programming 50 2004 Supersedes [2]
4. F. Henglein Type inference with polymorphic recursion ACM Trans. on Prog. Langs. & Systs. 15 2 1993
5. T. Jim. What are principal typings and what are they good for? In Conf. Rec. POPL '96: 23rd ACM Symp. Princ. of Prog. Langs., 1996
6. S.P. Jones Haskell mailing list - subject: Polymorphic recursion, 1993 http://www.mail-archive.com/haskell@haskell.org/msg00517.html
7. S.P. Jones Haskell mailing list - subject: Re: Polymorphic recursion, 1994 http://www.mail-archive.com/haskell@haskell.org/msg00492.html
8. S.P. Jones, J. Hughes. Haskell 98: A non-strict, purely functional language. Technical report, The Haskell 98 Committee, 1999. Currently available at http://haskell.org
9. S.P. Jones, M. Shields. Practical type inference for arbitrary-rank types. Under Consideration for the Journal of Functional Programming, 2004
10. A.J. Kfoury, J. Tiuryn, and P. Urzyczyn Type reconstruction in the presence of polymorphic recursion ACM Trans. on Prog. Langs. & Systs. 15 2 1993
11. A.J. Kfoury, J. Tiuryn, and P. Urzyczyn The undecidability of the semi-unification problem Inform. & Comput. 102 1 1993
12. A.J. Kfoury, J.B. Wells. Principality and decidable type inference for finite-rank intersection types. In Conf. Rec. POPL '99: 26th ACM Symp. Princ. of Prog. Langs., 1999. Superseded by [14]
13. A.J. Kfoury, J.B. Wells. Principality and type inference for intersection types using expansion variables. Supersedes [12], 2003
14. A.J. Kfoury, and J.B. Wells Principality and type inference for intersection types using expansion variables Theoret. Comput. Sci. 311 1-3 2004 Supersedes [12]. For omitted proofs, see the longer report [13]
15. A. Mycroft Polymorphic type schemes and recursive definitions Proceedings, 6th International Conference on Programming 1984 Springer-Verlag
16. C. Okasaki Purely Functional Data Structures 1998 Cambridge University Press
17. Z. Somogyi Comparing mercury and haskell, 2003 http://www.cs.mu.oz.au/ research/mercury/information/comparison_with_haskell.html