DC Field | Value | Language |
---|---|---|
dc.contributor.author | 임정표 | en_US |
dc.date.accessioned | 2014-12-01T11:47:35Z | - |
dc.date.available | 2014-12-01T11:47:35Z | - |
dc.date.issued | 2011 | en_US |
dc.identifier.other | OAK-2014-00755 | en_US |
dc.identifier.uri | http://postech.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000001097715 | en_US |
dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/1257 | - |
dc.description | Master | en_US |
dc.description.abstract | Based on the close relation between functional languages and hardware circuits, lλ provides a way to specify structural hardware description. Moreover, lλ supports several features of functional languages such as higher-order functions and polymorphism which enable to write programs more succinctly. In spite of these merits, it is impractical to develop a huge circuit with lλ because it requires programmers to annotate all type information | en_US |
dc.description.abstract | it is a heavy burden onprogrammers, and reduces the code readability. To solve this problem, this paper proposes the algorithm lW (linear W), which is a type inference algorithm for lλ. The algorithm lW, which is based on the algorithmW, automatically finds correct type of any untyped expression. The paper also shows that the algorithm always gives the most general type of any expression. | en_US |
dc.language | eng | en_US |
dc.publisher | 포항공과대학교 | en_US |
dc.rights | BY_NC_ND | en_US |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/2.0/kr | en_US |
dc.title | A Type Inference Algorithm For A Linear Lambda Calculus For Hardware Description | en_US |
dc.type | Thesis | en_US |
dc.contributor.college | 일반대학원 컴퓨터공학과 | en_US |
dc.date.degree | 2011- 8 | en_US |
dc.type.docType | Thesis | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
library@postech.ac.kr Tel: 054-279-2548
Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.