Abstract
A program is declarative if it requires little specification about control; instead it specifies as much as possible what to compute. The most ambitious objective of declarative programming is to derive computations from requirements specifications automatically in every domain. A more conservative goal of declarative programming is to make programming a simple task so that only the key portion of a program must be figured out by the programmer and most low-level details can be completed by the programming system automatically. Such objectives have been successfully accomplished in many well-defined domains. Chapter 7 first discusses a number of very high level programming languages that provide the programmer with additional tools to simplify manipulations of complex data structures (Sections 7.1–7.2). Section 7.3 discusses a logic programming language, PROLOG. Section 7.4 discusses the concept of declarative programming in database systems—a well-defined yet powerful domain that covers a large number of applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Kennedy, K., and Schwartz, J. Computers and Mathematics with Applications 1, 97–119 (1975).
Schonberg, E., Schwartz, J., and Sharir, M. ACM Transactions on Programming Languages and Systems 3:2, 126–143 (Apr. 1981).
Feather, M. S., and London, P. E. Science of Computer Programming 2, 91–131 (1982).
Green, C., and Westfold, S. Machine Intelligence 10, 339–359 (1982).
Cooke, D. E., “An executable high-level language based upon multisets” (Dept. of Computer Science, University of Texas at El Paso, 1994).
Banatre, J. P., and Le Matayer, D. Communications of ACM 36–1, 98–111 (Jan. 1993).
Freudenberger, S., Schwartz, J., and Sharir, M. ACM Transactions on Programming Languages and Systems 5:1, 26–45 (1983).
Cheng, T., Lock, E., and Prywes, N. IEEE Transactions on Software Engineering 10:5, 552–563 (Sept. 1984).
Communications of the ACM, 34:10, Oct. 1991.
Warren, D. H. D., Pereira, L. M., and Pereira, F. “PROLOG—the language and its implementation compared with LISP.” Symposium on AI and Programming Languages, ACM SIGPLAN 12:8 (1977) 109–115.
Everest, G. C., and Hanna, M. S. “Survey of object-oriented database management systems,” Carlson School of Management, University of Minnesota, Minneapolis, 1992).
Bertino, E., Negri, M., Pelagatti, G., and Sbattella, L. IEEE Transactions on Data and Knowledge Engineering 4.3, 223–237 (June 1992).
Stonebraker, M., Wong, E., Kreps, P., and Held, G. D. ACM Transactions on Database Systems 1:3, 189–222 (Sept. 1976).
Sheu, P.C.-Y., COMPOSE user’s guide (Visual/Interactive Data Engineering Laboratory, University of California, Irvine, CA, 1996).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Sheu, P.CY. (1997). Declarative Programming. In: Software Engineering and Environment. Software Science and Engineering. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5907-8_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5907-8_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7710-8
Online ISBN: 978-1-4615-5907-8
eBook Packages: Springer Book Archive