ABSTRACT
An applicative language based upon recent ideas by John Backus has been developed. The language provides a powerful formalism for the expression of complex database queries. Though currently implemented with an interface to a CODASYL system, the language employs a sufficiently general data model that use with other database management systems is possible. This paper describes the language through a number of examples and outlines its implementation.
- Backus, J. Can Programming be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs. Comm. ACM, 21, 613--641. Google ScholarDigital Library
- Burge, W.H. Recursive Programming Techniques. Addison-Wesley, Reading, Mass., 1975.Google Scholar
- Chamberlin, D.D. and R.F. Boyce. SEQUEL: A Structured English Query Language. Proc. ACM SIGMOD Workshop, 1974. Google ScholarDigital Library
- Data Base Task Group April 1971 Report. ACM, New York 1971.Google Scholar
- Friedman, D.P. and Wise, D.S. CONS should not evaluate its arguments. In Automata, Languages, and Programming. Edinburgh Univ. Press, Edinburgh 1976.Google Scholar
- Gerritsen, R. Seed Reference Manual. International Database Systems, Philadelphia (1978).Google Scholar
- Kaplan, S.J. CO-OP: A Natural Language Co-operative Query System. PhD. Dissertation, Moore School, University of Pennsylvania.Google Scholar
- Landin, P.J. A Correspondence between ALGOL 60 and Church's Lambda Notation. Comm. ACM, 8, 89--101. Google ScholarDigital Library
- Smith, J.M and D.C.P. Smith. Aggregation and Generalization. ACM Transactions on Database Systems 2 (June 1977). Google ScholarDigital Library
- Stonebraker, M. et al. The Design and Implementation of INGRES. ACM Tranasactions on Database Systems, Sept. 1976. Google ScholarDigital Library
- FQL: a functional query language
Recommendations
An introduction to test specification in FQL
HVC'10: Proceedings of the 6th international conference on Hardware and software: verification and testingIn a recent series of papers, we introduced a new framework for white-box testing which aims at a separation of concerns between test specifications and test generation engines. We believe that establishing a common language for test criteria will have ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell SymposiumProgrammers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Comments