Cited By
View all- Chen HDong Y(2004)Practical type checking of functions defined on Context-Free languagesJournal of Computer Science and Technology10.1007/BF0297344719:6(840-847)Online publication date: 1-Nov-2004
Function Definition Language FDL and its implementation
Pages 414 - 421
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.
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 1973 London Academic Press
[5]
Field A J, Harrison P G. Functional Programming. Addison-Wesley, 1988.
[6]
Koopman P W M, Van Eekelen M, and Plasmeijer M J Operational machine specification in a functional programming language Software-Practice and Experience 1995 25 5 463-499
[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]
Paakki Jukka Attribute grammar paradigms—A high-level methodology in language implementation ACM COmputing Surveys 1995 27 2 196-255
[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
Recommendations
Definitional Interpreters for Higher-Order Programming Languages
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Definitional interpreters for higher-order programming languages
ACM '72: Proceedings of the ACM annual conference - Volume 2Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters which are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Yet another meta-language for programming language processing
The formal specification language LFC was designed to support formal specification acquisition. However, it is yet suited to be used as a meta-language for specifying programming language processing. This paper introduces LFC as a meta-language, and ...
Comments
Information & Contributors
Information
Published In
© Science Press, Beijing China and Allerton Press Inc. 1999.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 22 March 2023
Revision received: 22 October 1998
Received: 14 January 1998
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 02 Sep 2024
Other Metrics
Citations
Cited By
View all- Chen HDong Y(2004)Practical type checking of functions defined on Context-Free languagesJournal of Computer Science and Technology10.1007/BF0297344719:6(840-847)Online publication date: 1-Nov-2004
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in