© 1988 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||||
Binding and Type Checking in Database Programming Languages

1 University of Glasgow, Department of Computing Science, Glasgow G12 8QQ, UK, 2 University of Pennsylvania, Department of Computer and Information Science, Moore School/D2, Philadelphia Pa 19104, USA, 3 University of St Andrews, Department of Computational Science, North Haugh, St Andrews KY16 9SS, Fife, UK
Static binding and type-checking, by which we mean the ability to bind names and assign types in advance of program execution is a desirable feature of many modern programming languages. In particular, it is one of the most useful techniques for catching programming errors and is a powerful aid in program optimisation, However, many programming tasks, especially those involving persistent data, appear to require some form of delayed binding and type checking. In this paper we illustrate the need for delaying those operations and examine a selection of languages to see how they provide a mixture of delayed and static operations. We conclude that, with the current state of language technology, the programmer needs explicit control over the timing of binding and type checking.
Received June 1987. revised July 1987.
* University of Glasgow, Department of Computing Science, Glasgow G12 8QQ
University of Pennsylvania, Department of Computer and Information Science, Moore School/D2, Philadelphia Pa 19104, USA
¶ University of St Andrews, Department of Computational Science, North Haugh, St Andrews KY16 9SS, Fife