Skip to main content
Log in

Function Definition Language FDL and its implementation

  • Notes
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

A Function Definition Language (FDL) is presented. Though designed for describing specifications, FDL is also a general-purpose functional programming language. It uses context-free language as data type, supports pattern matching definition of functions, offers several function definition forms, and is executable. It is shown that FDL has strong expressiveness, is easy to use and describes algorithms concisely and naturally. An interpreter of FDL is introduced. Experiments and discussion are included.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Dong Yunmei. Collection of SAQ Reports no.1-7. Technical Report ISCAS-LCS-95-09, Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, August 1995.

  2. Dong Yunmeiet al. Collection of SAQ Reports no.8-16. Technical Report ISCAS-LCS-96-1, Computer Science Laboratory, Institute of Software, Chinese Academy of Sciences, March 1996.

  3. Dong Yunmei. MLIRF method for specification acquisition and reuse. (in Chinese) InProc. 9th National Conf. China Computer Federation, May 1996, pp 21–27.

  4. Sollomaa A. Formal Languages. Academic Press, London, 1973.

    Google Scholar 

  5. Field A J, Harrison P G. Functional Programming. Addison-Wesley, 1988.

  6. Koopman P W M, Van Eekelen M, Plasmeijer M J. Operational machine specification in a functional programming language.Software-Practice and Experience May 1995, 25(5): 463–499.

    Article  Google Scholar 

  7. Dong Yunmei. Recursive functions defined on context-free languages. (in Chinese), In [1].

  8. Aho A V, Ullman J D. The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing. Prentice-Hall, Inc., 1972.

  9. Jukka Paakki. Attribute grammar paradigms—A high-level methodology in language implementation.ACM COmputing Surveys, June 1995, 27(2): 196–255.

    Article  Google Scholar 

  10. Vogt Het al. Higher order attribute grammars. InProc. ACM SIGPLAN'89 Conf. PLDI, 1989, pp. 131–145.

  11. Ganzinger H, Giegerich R. Attribute coupled grammars. InProc. ACM SIGPLAN'84 Symp. Compiler Constructions, SIGPLAN Notices, June 1984, 19(6): 157–170.

  12. Dong Yunmei. An interactive learning algorithm, for acquisition of concepts represented as CFL.J. Comput. Sci. & Technol., 1998, 13(1): 1–8.

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen Haiming.

Additional information

This research was supported by the National “863” Hi-Tech Programme, the National Natural Science Foundation and the National “Ninth-Five” Sci-Tech Programme of China.

CHEN Haiming received his B. S. degree from University of Science and Technology of China in 1989 and his M.S. degree and Ph.D. degree from Institute of Software, Chinese Academy of Sciences (CAS) in 1992 and 1999, respectively. He is now a research member at the Laboratory of Computer Science, Institute of Software, CAS. His research interests include, software design methodology and programming languages.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chen, H. Function Definition Language FDL and its implementation. J. Comput. Sci. & Technol. 14, 414–421 (1999). https://doi.org/10.1007/BF02948745

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02948745

Keywords

Navigation