The algebra of programming

R Bird, O De Moor - NATO ASI DPD, 1996 - books.google.com
In these lecture notes we describe an algebraic approach to programming, suitable both for
the derivation of individual programs and for the study of programming techniques in …

[PDF][PDF] Wiley encyclopedia of electrical and electronics engineering

JG Webster - 1999 - 136.175.10.10
01• Aerospace and Electronic Systems Page 1 1 Page 2 i WILEY ENCYCLOPEDIA OF ELECTRICAL
AND ELECTRONICS ENGINEERING 24 Volume Set (Hardcover) by John G. Webster (Editor) …

Specware: Formal support for composing software

YV Srinivas, R Jüllig - International Conference on Mathematics of …, 1995 - Springer
Specware supports the systematic construction of formal specifications and their stepwise
refinement into programs. The fundamental operations in Specware are that of composing …

The unified problem-solving method development language UPML

D Fensel, E Motta, F Van Harmelen… - … and Information Systems, 2003 - Springer
Problem-solving methods provide reusable architectures and components for implementing
the reasoning part of knowledge-based systems. The Unified Problem-Solving Method …

Structured development of problem solving methods

D Fensel, E Motta - IEEE Transactions on Knowledge and Data …, 2001 - ieeexplore.ieee.org
Problem solving methods (PSMs) describe the reasoning components of knowledge-based
systems as patterns of behavior that can be reused across applications. While the …

Categories, relations and dynamic programming

O De Moor - Mathematical Structures in Computer Science, 1994 - cambridge.org
Dynamic programming is a strategy for solving optimisation problems. In this paper, we
show how many problems that may be solved by dynamic programming are instances of the …

Systematic derivation of incremental programs

YA Liu, T Teitelbaum - Science of Computer Programming, 1995 - Elsevier
A systematic approach is given for deriving incremental programs from non-incremental
programs written in a standard functional programming language. We exploit a number of …

OPAL: Design and implementation of an algebraic programming language

K Didrich, A Fett, C Gerke, W Grieskamp… - … Languages and System …, 1994 - Springer
The algebraic programming language OPAL has been designed as a testbed for
experiments with the specification and development of functional programs. The language …

[PDF][PDF] Structure and design of global search algorithms

DR Smith - 1987 - researchgate.net
Global search is an enumerative approach to problem solving that generalizes the
computational paradigms of binary search, backtracking, branch-and-bound, heuristic …

Theory interpretation in simple type theory

WM Farmer - International Workshop on Higher-Order Algebra, Logic …, 1993 - Springer
Abstract Theory interpretation is a logical technique for relating one axiomatic theory to
another with important applications in mathematics and computer science as well as in logic …