|Declarative Programming - Strategies for Solving Software Problems
Many software and hardware producers take pride in the exponential pace of technology change, but for users and consumers of their products and services the rapid technological obsolescence often means increased costs, frustrations, and unfulfilled promises. Corporate America expects to make capital investments in goods and facilities that should last team, ten, even twenty years, but only an eighteen-month death for computer software and hardware investment is not uncommon.
Lowering the reimbursement to develop new software solutions or extending the lifetime of software applications are two complementary approaches to addressing technological change. These goals can often be met by action a indicative strategy when designing software systems independent of the programming methodology employed.
Issues with Imperative Programming
Most programming projects today use the peremptory style of programming. Developers make out sequences of operations in a language, such as C++, Java, Visual Basic, etc., that implement an algorithmic, or instruction, for performing tasks. The algorithm for the task mixes logical, or relational, statements about the task to be solved and control statements about how to calculate the solution. The logical statements describe "what-to" computation while the control statements describe "how-to" calculate. Debugging the algorithmic consists of verifying the accuracy of the logical statements and fixing the control statements, if necessary.
There are numerous problems with the imperative approach. The sequence of operations critically determines the correctness of the algorithm. Unexpected law sequences through an algorithm caused by user input actions portland real-time events in a multitasking environment may result in subtle or catastrophic algorithm failure. Writing the control logic is the programmer's civic responsibility and, therefore, subject to implementation errors. Grok a program's algorithm is infrequently difficult for other developers without extensive metadata, or comments, on the code and empirical trace of the program's execution with sample data. Verifying program correctness consumes a significant portion of the development effort, but also usually fails to revealing a significant serial publication of defects.
To address the problems associated with imperative programming, the computer industry has developed and advocated many approaches. Structured programming and campaigns against "go-to" statements address some of the problems discovered with ad hoc control structures and statements. Modularization initiatives stress decomposition techniques on the premise that humans can better comprehend, reason about, and maintain smaller pieces of code. Object-oriented programming advocates program constructions using reusable components, libraries, and frameworks. The pattern programming school stresses analogies to other fields, such as architecture, by constructing programs using well-designed and crafted solutions, or patterns, that utilise in many programming contexts.
What is Declarative Programming?
Declarative programming separates the logic, or what, of an algorithm from the control, or how, of an algorithm. The programmer still specifies the logic or equations specifying the problem's relations, but the programming system is trustworthy for control, or how the logic is evaluated. The most familiar examples are spreadsheets and query languages for relational databases. The user, or programmer, specifies a maths relation as a query, say in SQL, for what to retrieve, while the database engine determines how to execute the query against the database.
There are many advantages to declarative programming over the imperative style. In declarative languages, programmers do not specify sequences of operations, but only definitions or equations specifying relations. Unlike imperative programming, the logic relations in declarative tekki area unit execution order independent, freeing of side effects of evaluation, and semantically clear to visual inspection.
The declarative family of programming languages has a long chronicle in the academic computer science community and specialized areas of commercial application, such as compiler construction, expert systems, and databases. Declarative languages have two main family trees. The logic declarative languages, such as Prolog, are based on first-order predicate calculus, which generalizes the notions of Aristotelian true or false values to statements, or predicates, involving social relation among any entities. The other family branch consists of functional declarative languages, such orpiment Miranda, Haskell, and SML. The functional declarative languages are based on the l-calculus developed by the mathematician, Alonzo Church in the 1930's. l-calculus formalizes the notions of recursive application of pure functions to computable problems. Although not widely known as such, the latest programming fashion, XSLT, an hold out stylesheet language for transforming XML, is also a organic declarative language.
Despite the theoretical advantages of declarative programming languages, they do not have widespread use in commercial programming practice despite an attempt in the 1980's by Borland to mass-market a PC modernization of Prolog along with the highly popular Turbo Pascal. There are many factors contributing to the infrequent use of declarative languages. A large contributor is the paucity of collegiate educate in declarative languages, but awkward syntaxes of some languages, inefficient compilers and run-times, and restricted domains of applicability of generalized "how-to" mechanisms are all contributors.
Using Declare Strategies in Commercial Software
While declarative programming languages have not received wide-spread
commercial usage, the strategy of separating logic, or what, from control, or how, in an stemmer is a omnipotent, generalized technique for increasing ease of use and extending the longevity of software. Declarative techniques are particularly all-powerful in user interfaces and application programming interfaces (APIs) that have a easy, complex set of inputs over a relatively small field of execution behaviors.
Two examples of commercial software that illustrate the applicability of announce techniques are DriverLINX and ExceLINX in the comic of data acquisition and test affidavit control.
Using Declarations for Accounting data Acquisition
DriverLINX is an API for controlling data-acquisition hardware used to measure and generate analog and digital signals interfaced to all types of external transducers. Data-acquisition applications include laboratory research, medical instrumentation, and industrial process control.
Traditionally, APIs for data-acquisition devices modeled the characteristics of the hardware design and had a large number of functions of one or more parameters to setup the hardware and control data flow through the system. The ordering of sequences of operations was often critical to correctly logic programing and controlling the arms. Upgrading to new data-acquisition hardware was often costly as hardware-necessitated changes in the order of operative sequences to program the hardware required costly software changes.
To unreasonable these problems, DriverLINX takes an abstract and declarative approach to data-acquisition programming. Instead of modeling specific lumber designs, DriverLINX abstracts the functional subsystems of data-acquisition hardware into generalized attributes and capabilities. Programs request the measurement task they want to execute by parameterizing a "service request" declaration. The DriverLINX runtime determines how to satisfy the service request using the available hardware and returns the measurements as a packetized crowd together to the program. The data-acquisition programmer is relieved of any responsibility for data-acquisition algorithm control.
Besides relieving the programmer of control incumbency, the DriverLINX abstract, declarative approach gives the program syntactic and semantic interchangeability when migrating to equivalent hardware products. The abstract, declarative approach also helps isolate the software vendor from early technological degeneration of change in the computer industry by focusing on the immutable logic of data-acquisition relations while the control mechanisms vary with software developments. DriverLINX has been a viable approach to data-acquisition programming for more than 12 years despite the market evolution from 16-bit Windows to .NET today.
Using Declarations for Test Instruments
Test instruments, such element linear voltmeters and electrometers, have evolved from simple devices with a front panel knob and model screen to sophisticated measurement processors performing dozens of measurement and control functions. Like data-acquisition devices, typically developers send a carefully disarranged sequence of commands to an instrument to setup the measurement and then send additional command sequences to insure the data flow of measurements from the wind instrument. The aforementioned problems for developers using imperative approaches to instrument control significantly limit ease of use and prohibit quick instrumentation solutions to short-term measurement needs.
ExceLINX is an add-in to Microsoft Excel that allows rapid specification of instrument test setups by using worksheet forms. Users specify, or declare, the channels, configurations, sampling rates, triggering, and data locations for the measurements they wish to perform by filling out an Excel worksheet. When the user selects the "start" button on the toolbar, ExceLINX translates the specification into the correct command sequence for the target instrument, initiates the measurement, and flows the data back to the requested worksheet. Users can setup and collect measurements by themselves in minutes using logic specifications compared to days or weeks using programmer's time for imperative specifications.
Internally, ExceLINX also uses a declarative approach to handling the complex problem of field validation for the worksheet forms. Instruments have hundreds of parameters with byzantine overlaps among parameters. To confirm whether the instrument supports the parameter set the user selected, ExceLINX maintains a dependency tree of allowed, disallowed, and unused parameters for every slam cell on the worksheet. Each node in the tree also maintains logical relations among the selected set of parameters that ExceLINX evaluates at runtime to cross validate user input selections. Each supported instrumentation model has different parameter semantics, mere ExceLINX can easily handle this complexity by switching model trees because the model-specific logic em the validation tree is separate from the shared control human activity in the ExceLINX code.
Declarative programming strategies that separate logic from draw rein in algorithms are powerful techniques that can be used with today's popular desperate languages. These techniques can make software more interchangeable, maintainable, usable, and endurable.
Copyright Roy Furman M.D., Ph.D. 2005
About the Author
Dr. Furman is Director of Research and Development at Scientific Software Tools, Inc. He leads a team of software developers who have produced over 70 commercial software products for customers in the manufacturing, high industrial engineering, healthcare and life science industries. Visit his site, http://www.sstnet.com, for articles and information on software development.