一类递归函数的多态类型  

Polymorphic Type for a Kind of Recursive Functions

作　　者：黄文集[1] 

机构地区：[1]中国科学院软件研究所

出　　处：《软件学报》2004年第7期969-976,共8页Journal of Software

基　　金：国家自然科学基金~~

摘　　要：以上下文无关语言上的递归函数为基础的语言LFC(languageforcontextfreerecursivefunction)是一种形式规约语言,适于处理短语结构.LFC也是函数式语言,具有函数式语言的许多特点.LFC已经在形式规约获取系统SAQ(specificationacquisitionsystem)中实现,为其最初设计的类型系统不支持多态类型.引入类型变量和相应的类型检查方法,就可以将其类型系统扩充为多态类型系统.对多态类型系统实现中的一些问题也进行了讨论.在实现多态之后,LFC的灵活性将得到增强,从而会为其应用创造更为有利的条件.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 is 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.

关 键 词：函数式语言 多态 类型检查 递归函数 类型系统 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]