See this document in CiteSeerX!

Proofs about a Folklore Let-Polymorphic Type Inference Algorithm (1998)  (Make Corrections)  (27 citations)
Oukseh Lee, Kwangkeun Yi
ACM Transanctions on Programming Languages and Systems



  Home/Search   Context   Related

Links:   ACM   DBLP

 
View or download:
pllab.kaist.ac.kr/~kwang...toplas.ps.gz
ropas.kaist.ac.kr/...toplasleyi.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  pllab.kaist.ac.kr/~kwang...papers (more)
Homepages:  O.Lee  K.Yi
  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: The Hindley/Milner let-polymorphic type inference system has two different algorithms: one is the de facto standard Algorithm W that is bottom-up (or context-insensitive), and the other is a "folklore" algorithm that is top-down (or context-sensitive). Because the latter algorithm has not been formally presented with its soundness and completeness proofs, and its relation with the W algorithm has not been rigorously investigated, its use in place of (or in combination with) W is not well... (Update)

Context of citations to this paper:   More

...unify types at application subexpressions. It is proven that the M algorithm stops earlier than the W algorithm when there is a type error [29]. It reports a ner grain error site than the W algorithm, but the type in its report may be harder to understand than that from the W...

Cited by:   More
Type-Based Useless-Variable Elimination - Naoki Kobayashi Koba (1999)   (Correct)
Type Error Slicing in Implicitly Typed Higher-Order Languages - Haack, Wells (2004)   (Correct)
Graphs for Recording Type Information - Bruce Mcadam Laboratory   (Correct)

Similar documents (at the sentence level):
11.4%:   A Generalized Let-Polymorphic Type Inference Algorithm - Lee, Yi (2000)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Explaining Polymorphic Types - Jun, Michaelson, Trinder (2002)   (Correct)
0.2:   Evaluating Environments for Functional Programming - Whittle, Cumming   (Correct)
0.2:   Improving Polymorphic Type Explanations - Yang (2001)   (Correct)

Similar documents based on text:   More   All
0.3:   A Proof Method for the Correctness of Modularized 0CFA - Lee, Yi, Paek (2002)   (Correct)
0.3:   Inserting Safe Memory Reuse Commands into ML-like Programs - Lee, Yang, Yi (2003)   (Correct)
0.3:   An Explicit Polymorphic Type System for Verifying Untrusted.. - Chung (2000)   (Correct)

Related documents from co-citation:   More   All
17:   Explaining type errors in polymorphic languages - Beaven, Stansifer - 1994
15:   the unification of substitutions in type-inference - McAdam - 1998
15:   Finding the source of type errors (context) - Wand - 1986

BibTeX entry:   (Update)

Oukseh Lee and Kwangkeun Yi. Proofs about a folklore let-polymorphic type inference algorithm. ACM Transactions on Programming Languages and Systems, 1998. Accepted for publication. http://citeseer.ist.psu.edu/151436.html   More

@article{ leyi1998,
  pages = "707--723",
  year = "1998",
  title = "Proofs about a Folklore Let-Polymorphic Type Inference Algorithm",
  author = "Oukseh Lee and Kwangkeun Yi",
  volume = "20",
  number = "4",
  journal = "ACM Transanctions on  Programming Languages and Systems",
  month = jul,
  url = "citeseer.ist.psu.edu/151436.html" }
Citations (may not include all citations):
809   A theory of type polymorphism in programming (context) - Milner - 1978  DBLP
634   A machine-oriented logic based on the resolution principle (context) - Robinson - 1965  ACM   DBLP
343   Principal type-scheme for functional programs (context) - Damas, Milner - 1982
178   Standard ML of New Jersey - MacQueen, Appel - 1993
61   Local type inference - Pierce, Turner - 1998
59   Basic polymorphic typechecking - Cardelli - 1987  ACM   DBLP
30   Explaining type errors in polymorphic languages - Beaven, Stansifer - 1993  ACM
15   Debugging type errors - Bernstein, Stark - 1995
12   Interactive programming environment for ML - Rideau, Th'ery - 1997
10   The caml light system (context) - Leroy - 1995
9   Explaining type inference - Duggan, Bent - 1996  ACM   DBLP
1   The caml light system (context) - about, Let-Polymorphic et al. - 1993
1   A maximal-flow approach to anomaly isolation in unification-.. (context) - Johnson, Walz - 1986



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://pllab.kaist.ac.kr/~kwang/papers.html):   More
Z1: A Data Flow Analyzer Generator - Yi, Harrison   (Correct)
Automatic Generation and Management of Interprocedural.. - Yi, Harrison, III (1993)   (Correct)
Compile-time Detection of Uncaught Exceptions in Standard ML Programs - Yi (1994)   (Correct)

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