This document is also available in these non-normative formats: XML.
When designing computer systems, one is often faced with a choice between using a more or less powerful language for publishing information, for expressing constraints, or for solving some problem. This finding explores tradeoffs relating the choice of language to reusability of information. The "Rule of Least Power" suggests choosing the least powerful language suitable for a given purpose.
This document is an editors' copy that has no official standing.
This document is a draft of a proposed finding. It has been produced by the W3C Technical Architecture Group (TAG). The text of this finding was adapted from Principle of Least Power in [Axioms]. Earlier drafts of this finding had the working title: The Principle of Least Power.
Additional TAG findings, both accepted and in draft state, may also be available. The TAG may incorporate this and other findings into future versions of the [AWWW]. Please send comments on this finding to the publicly archived TAG mailing list email@example.com (archive).
The World Wide Web is unique in its ability to promote information reuse on a global scale. Information published on the Web can be flexibly combined with other information, read by a broad range of software tools, and browsed by human users of the Web. For such reuse to succeed, the broadest possible range of tools must be capable of understanding the data on the Web, and the relationships among that data. Thus, when publishing information or programs on the Web, the choice of language is important. This finding explores the connection between the choice of computer language and the reusability of information represented in that language.
There is an important tradeoff between the computational
power of a language and the ability to
determine what a program
in that language is doing.
Computer languages range
from the plainly descriptive (such as Dublin Core metadata, or the content of
most databases, or HTML),
through logical languages with limited propositional logic (such as
access control lists, conneg content negotiation or regular expressions),
to the nearly Turing-complete (PDF or some versions of SQL),
through those that are in
fact Turing-complete though
one is led not to use them that way (XSLT, more powerful versions of SQL),
through those that are functional and Turing-complete (Haskell),
to those that are
The Turing-complete languages are
shown by computer science to be equivalent in their ability
to compute any result of which a computer is capable, and are
in that sense the most powerful class of languages for computers.
The tradeoff for such power is that you typically cannot
determine what a program in a Turing-complete language will do
without actually running it.
Indeed, you often cannot tell in advance whether such a
program will even reach the point of producing useful output.
Of course, you can easily tell what a simple program
print "2+2" will do,
but given an arbitrary program you'd likely have to run it,
and possibly for a very long time.
Conversely, if you capture information in a simple declarative form,
anyone can write a program to analyze it in many ways.
Thus, there is a tradeoff in choosing between languages that can solve a broad range of problems and languages in which programs and data are easily analyzed. Computer Science in the 1960s through 1980s spent a lot of effort making languages that were as powerful as possible. Nowadays we have to appreciate the reasons for picking not the most powerful solution but the least powerful. Expressing constraints, relationships and processing instructions in less powerful languages increases the flexibility with which information can be reused: the less powerful the language, the more you can do with the data stored in that language.
Less powerful languages are usually easier to secure. A bug-free regular expression processor, for example, is by definition free of many security exposures that are inherent in the more general runtime one might use for a language like C++. Because programs in simpler languages are easier to analyze, it's also easier to identify the security problems that they do have.
There are many dimensions to language power and complexity that should be considered when publishing information. For example, a language with a straightforward syntax may be easier to analyze than an otherwise equivalent one with more complex structure. A language that wraps simple computations in unnecessary mechanics, such as object creation or thread management, may similarly inhibit information extraction. The intention of this finding is neither to rigorously characterize the many ways in which a programming language may exhibit power or complexity, nor to suggest that all such power necessarily interferes with information reuse. Rather, this finding observes that a variety of characteristics that make languages powerful can complicate or prevent analysis of programs or information conveyed in those languages, and it suggests that such risks be weighed seriously when publishing information on the Web. Indeed, on the Web, the least powerful language that's suitable should usually be chosen. This is The Rule of Least Power:
In aiming for simplicity, one must of course go far enough but not too far. The language you choose must be powerful enough to successfully solve your problem, and indeed, complexity and lack of clarity can easily result from clumsy efforts to patch around use of a language that is too limited. Furthermore, the suggestion to use less powerful languages must in practice be weighed against other factors. Perhaps the more powerful language is a standard and the less powerful language not, or perhaps the use of simple idioms in a powerful language makes it practical to use the powerful languages without unduly obscuring the information conveyed (see 3 Scalable language families). Overall, the Web benefits when less powerful languages can be successfully applied.
Many Web technologies are designed to exploit the Principle of Least Power. HTML for example, is intentionally designed not to be a full programming language so that many different things can be done with an HTML document: software can present the document in various styles, extract tables of contents, index it, and so on. Similarly, CSS is a declarative styling language that is easily analyzed. The Semantic Web is an attempt, largely, to map large quantities of existing data onto a common language so that the data can be analyzed in ways never dreamed of by its creators. If, for example, some weather data is published as a Web resource using RDF, a user can retrieve it as a table, perhaps average it, plot it, or deduce things from it in combination with other information. At the other end of the scale is the weather information conveyed by an ingeniously written Java applet. While the applet might provide a very cool user interface or other sophisticated features, the results of the program will be not usually be predictable in advance. A search engine finding the resource will have no idea of what the weather data is or even, in the absence of other information, that it is a weather-related resource The only way to find out what a Java applet means is generally to set it running, and see what it does. Thus, HTML, CSS and the Semantic Web are examples of Web technologies designed with "least power" in mind. Web resources that use these technologies are more likely to be reused in flexible ways than those expressed in more powerful languages.
A different sort of scalability can be found when comparing Turing-complete languages. Although all have equivalent expressive power, functional languages such as Haskell and XSLT facilitate the creation of programs that may be easier to analyze than their imperative equivalents. Particularly when such languages are further subset to eliminate complex features (to eliminate recursion, perhaps, or to focus on template forms in XSLT), the resulting variants may be quite powerful yet easy to analyze.
19-Dec-2005 [NRM]: initial version
19-Dec-2005 [NRM]: corrected a few typos, set right date in this change log.
23-Jan-2006 [NRM]: Significant revision to account for comments made at the (Dec. 20 2005 TAG Teleconference ) and email received in Dec. and Jan. (Note: changed from discussing "procedural" to "imperative" languages.)
13-Feb-2006 [NRM]: Changed title to Rule of Least Power. Introduced separate Principle: powerful languages inhibit reuse, and a GPN known informally as the Rule of Least Power GPN: use least powerful suitable language on the Web. Rearranged first section, and included new paragraph indicating that this finding does not attempt to characterize all the important dimensions of complexity that may inhibit reuse. Also: removed the To Do list.