| 摘要: |
| 以上下文无关语言上的递归函数为基础的语言LFC(1anguage for context free recursive function)是一种形式规约语言,适于处理短语结构.LFC也是函数式语言,具有函数式语言的许多特点.LFC已经在形式规约获取系统SAQ(specification acquisition system)中实现,为其最初设计的类型系统不支持多态类型.引入类型变量和相应的类型检查方法,就可以将其类型系统扩充为多态类型系统.对多态类型系统实现中的一些问题也进行了讨论.在实现多态之后,LFC |
| 关键词: 函数式语言 多态 类型检查 递归函数 类型系统 |
| DOI： |
| 分类号: |
| 基金项目:Supported bytheNationalNatural Science Foundation ofChinaunderGrantNos 60273023,60103008(国家自然科学基金) |
|
| Polymorphic Type for a Kind of Recursive Functions |
|
HUANG Wen-Ji
|
| Abstract: |
| Based on recursive functions defined on context-free language, LFC (language for context free recursive function) is a formal specification language and fits for dealing with phrase structure. LFC is yet another functional language with many general characteristics. It has been implemented in SAQ (specification acquisition system).The original type system for LFC is not polymorphic. With type variables, the original type system can be augmented and become a polymorphic type system. The type checking algorithm and some problems about implementation are also discussed. Polymorphic type system makes LFC more agile and predicts good future in the applications of LFC. |
| Key words: functional language polymorphism type checking recursive function type system |
