J. Guttag, J. Horning, and J. Williams. FP with data abstraction and strong typing. In Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, pages 11--24, 1981.  Home/Search   Document Not in Database   Summary   Related Articles

....In contrast, a different definition of type leads us to a more robust subset test. Other algorithms on types (such as type intersection and union) are also correspondingly weaker in their approach because of the difficulty of handling function types. Several type systems have been proposed for FP [GHW81, Fra81, Kat84]. The drawbacks of using these approaches for FL type inference are the essential first order nature of the systems and the inability to automatically infer types for recursive data structures. Regular trees have been used before in a type language for a statically typed, first order functional ....

J. Guttag, J. Horning, and J. Williams. FP with data abstraction and strong typing. In Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, pages 11--24, 1981.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC