practical type checking of functions defined on context-free languages
文献类型:期刊论文
作者 | Chen Haiming ; Yun-Mei Dong |
刊名 | Journal of Computer Science and Technology
![]() |
出版日期 | 2004 |
卷号 | 19期号:6页码:840-847 |
关键词 | type checking context-free language algorithm |
中文摘要 | A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF.languages is not decidable,a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked.Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented. |
收录类别 | EI,SCI |
语种 | 英语 |
WOS记录号 | WOS:000225656600015 |
公开日期 | 2010-07-22 |
源URL | [http://124.16.136.157/handle/311060/2851] ![]() |
专题 | 软件研究所_计算机科学国家重点实验室 _期刊论文 |
推荐引用方式 GB/T 7714 | Chen Haiming,Yun-Mei Dong. practical type checking of functions defined on context-free languages[J]. Journal of Computer Science and Technology,2004,19(6):840-847. |
APA | Chen Haiming,&Yun-Mei Dong.(2004).practical type checking of functions defined on context-free languages.Journal of Computer Science and Technology,19(6),840-847. |
MLA | Chen Haiming,et al."practical type checking of functions defined on context-free languages".Journal of Computer Science and Technology 19.6(2004):840-847. |
入库方式: OAI收割
来源:软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。