微信服务号

微信订阅号

2025-4-6- 18
Home > Archive>Volume 15, Issue 7, 2004 >969-976
PDF HTML XML Export Cite reminder
Polymorphic Type for a Kind of Recursive Functions
Author:
Affiliation:

  • Article
    • | |
  • Metrics
    • |
  • Reference [21]
    • |
  • Related
    • |
  • Cited by [1]
    • | |
  • Comments
    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.

    Reference
    [1]Chen HM. Research on formal specification language based on CFRF [Ph.D. Thesis]. Institute of Software, The Chinese Academy of Sciences, 1999 (in Chinese with English abstract).
    [2]Dong YM. Collection of SAQ Report No 1-7. Technical Report, ISCAS-LCS-95-09, Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, 1995.
    [3]Dong YM, Chen HM, Zhang RL. Collection of SAQ Report No 8-16. Technical Report, ISCAS-LCS-96-1, Laboratory of Computer Science, Institute of Software, The Chinese Academy of Sciences, 1996.
    [4]Hudak P. Concept, evolution, and application of functional programming languages. ACM Computing Surveys, 1989,21(3):359～411.
    [5]Dong YM. Recursive functions of context free languages (1). Science in China (Series F), 2002,45(1):25～39.
    [6]Dong YM. Recursive functions of context free languages (Ⅱ). Science in China (Series F), 2002,45(2):81～102.
    [7]Mitchell JC. Type inference with simple subtypes. Journal of Functional Programming, 1991,1(3):245～285.
    [8]Strachey C. Fundamental Concepts in Programming Languages. Oxford: Oxford University Press, 1967.
    [9]Curry HB, Feys R. Combinatory Logic. Amsterdam: North-Holland, 1958.
    [10]Hindley R. The principal type scheme of an object in combinatory logic. Trans. of the American Mathematical Society, 1969,146(1):29～60.
    [11]Milner R. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 1978,17(3):348～375.
    [12]Cardelli L. Basic polymorphic type checking. Science of Computer Programming, 1987,8(2):147～172.
    [13]Jenkins S, Leavens GT. Polymorphic type-checking in scheme. Computer Languages, 1996,2(4):215～223.
    [14]Kfoury AJ, Pericas SM. Type inference for recursive definitions. In: Giuseppe L, Ecole NS, eds. Proc. of the 14th Symp. on Logic in Computer Science. Trento: IEEE Computer Society, 1999. 119～129.
    [15]Zheng HJ, Zhang NX. A polymorphic type system with constraints. Chinese Journal of Computers, 1999,22(4):343～350 (in Chinese with English abstract).
    [16]Yang J, Michaelson G, Trinder P. How do people check polymorphic types? In: Alan FB, Eleonora B, eds. Proc. of the 12th Annual Meeting of the Psychology of Programming Interest Group. Memoria: Corigliano Calabro, 2000. 67～77.
    [17]Earley J. An efficient context-free parsing algorithm. Communications of the ACM, 1970,13(2):94～102.
    [18]Chen HM, Dong YM. A representation of parse tree for context-free language. Journal of Computer Research and Development,2000,37(10): 1179～1184 (in Chinese with English abstract).
    [19]陈海明.基于上下文无关语言递归函数的规约语言研究[博士学位论文].北京:中国科学院软件研究所,1999.
    [20]郑红军,张乃孝.一种带约束的多态类型系统.计算机学报,1999,22(4):343～350.
    [21]陈海明,董韫美.上下文无关语言语法树的一种表示形式.计算机研究与发展,2000,37(10):1179～1184.
    Related
    Comments
    Comments
    分享到微博
    Submit
Get Citation

黄文集.一类递归函数的多态类型.软件学报,2004,15(7):969-976

Copy
Share
Article Metrics
  • Abstract:3786
  • PDF: 5046
  • HTML: 0
  • Cited by: 0
History
  • Received:September 05,2003
  • Revised:March 31,2004
Links:Institute of Software, CASChina Computer FederationCASNSFC
You are the first2033373Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063