Principal Typing and Mutual Recursion (2001)

by Lucília Figueiredo , Carlos Camarão
Venue:INTERNATIONAL WORKSHOP ON FUNCTIONAL AND LOGIC PROGRAMMING (WFLP 2001)
Citations:2 - 2 self

Documents Related by Co-Citation

51 Typing Haskell in Haskell – Mark P. Jones - 1999
940 A theory of type polymorphism in programming – Robin Milner - 1978
234 Principal type schemes for functional programs – L Damas, R Milner - 1982
329 Foundations for Programming Languages – J C Mitchell - 1996
1 Type Assignment in Prog. Languages – L Damas - 1984
1 Camarao C.: Practical Type Inference – C Vasconcellos, L Figueiredo
1 Semiunifiability is decidable. In Under consideration for publication – L Figueiredo, C Camarão - 2002
1 The Mercury Project. http://www.cs.mu.oz.au/research/mercury – F Henderson - 2003
1 The Haskell 98 Report. http://haskell.org/definition – S P Jones - 1998
1 Message to the Haskell mailing list, May 3, 2001, available from http://www.mailarchive.com/haskell@haskell.org – Lennart Augustsson - 2001
1 Catenable double ended queues – C Okasaki - 1997
11 A generalization of the trie data structure – R H Connelly, F L Morris - 1995
15 Polymorphic unification and ML typing – Paris C Kanellakis, John C Mitchell - 1989
55 Type reconstruction in the presence of polymorphic recursion – A J Kfoury, J Tiuryn, P Urzyczyn - 1993
42 Unification and ML Type Reconstruction – Paris C. Kanellakis, Harry G. Mairson, John C. Mitchell - 1991
79 Nested datatypes – Richard Bird, Lambert Meertens - 1998
93 What Are Principal Typings and What Are They Good For? – Trevor Jim - 1995
49 Deciding ML typability is complete for deterministic exponential time – Harry G Mairson - 1990
88 The Craft of Functional Programming – Simon Thompson - 1999