Top-down synthesis of divide-and-conquer algorithms
Artificial Intelligence
Introduction to higher order categorical logic
Introduction to higher order categorical logic
The Munich Project CIP: Volume I: the wide spectrum language CIP-L
The Munich Project CIP: Volume I: the wide spectrum language CIP-L
Category theory for computing science
Category theory for computing science
Program inversion: more than fun!
Science of Computer Programming
Programming by expression refinement: the KMP algorithm
Beauty is our business
Preordered categories and predicate transformers
Preordered categories and predicate transformers
Algebra of programming
Syntactic Analysis and Operator Precedence
Journal of the ACM (JACM)
Communications of the ACM
The Science of Programming
Categorical Combinators, Sequential Algorithms and Funtional Programming
Categorical Combinators, Sequential Algorithms and Funtional Programming
A Discipline of Programming
Algorithmic Language and Program Development
Algorithmic Language and Program Development
Introduction to Functional Programming
Introduction to Functional Programming
Polynomial Relators (Extended Abstract)
AMAST '91 Proceedings of the Second International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Towards squiggly refinement algebra
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Inorder Traversal of a Binary Heap and its Inversion in Optimal Time and Space
Proceedings of the Second International Conference on Mathematics of Program Construction
An Alternative Derivation of a Binary Heap Construction Function
Proceedings of the Second International Conference on Mathematics of Program Construction
Formal Derivation of CSP Programs From Temporal Specifications
MPC '95 Mathematics of Program Construction
Algebraic Methods for Optimization Problems
Revised Lectures from the International Summer School and Workshop on Algebraic and Coalgebraic Methods in the Mathematics of Program Construction
Constructing Tournament Representations: An Exercise in Pointwise Relational Programming
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
| Hi-index | 0.00 |
The point-free relational calculus has been very successful as a language for discussing general programming principles. However, when it comes to specific applications, the calculus can be rather awkward to use: some things are more clearly and simply expressed using variables. The combination of variables and relational combinators such as converse and choice yields a kind of nondeterministic functional programming language. We give a semantics for such a language, and illustrate with an example application.