DC Field | Value | Language |
---|---|---|
dc.contributor.author | oukseh lee | ko |
dc.contributor.author | kwangkeun yi | ko |
dc.date.accessioned | 2013-02-27T20:42:20Z | - |
dc.date.available | 2013-02-27T20:42:20Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1998-07 | - |
dc.identifier.citation | ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, v.20, no.4, pp.707 - 723 | - |
dc.identifier.issn | 0164-0925 | - |
dc.identifier.uri | http://hdl.handle.net/10203/70745 | - |
dc.description.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 founded. In this article, we formally define the context-sensitive, top-down type inference algorithm (named "M"), prove its soundness and completeness, and show a distinguishing property that M always stops earlier than W if the input program is ill typed. Our proofs can be seen as theoretical justifications for various type-checking strategies being used in practice. | - |
dc.language | English | - |
dc.publisher | Assoc Computing Machinery | - |
dc.title | Proofs About a Folklore Let-Polymorphic Type InferenceAlgorithm | - |
dc.type | Article | - |
dc.identifier.wosid | 000077590100001 | - |
dc.identifier.scopusid | 2-s2.0-0032108250 | - |
dc.type.rims | ART | - |
dc.citation.volume | 20 | - |
dc.citation.issue | 4 | - |
dc.citation.beginningpage | 707 | - |
dc.citation.endingpage | 723 | - |
dc.citation.publicationname | ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | - |
dc.contributor.localauthor | kwangkeun yi | - |
dc.contributor.nonIdAuthor | oukseh lee | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | algorithms | - |
dc.subject.keywordAuthor | languages | - |
dc.subject.keywordAuthor | theory | - |
dc.subject.keywordAuthor | type error | - |
dc.subject.keywordAuthor | type inference algorithm | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.