In: Teo Rus (editor), Procs. of AMAST 2000, Springer Lecture Notes in Computer Science, Volume 1816, pages 371--390

Authors: Oege de Moor and Jeremy Gibbons
>

Abstract

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.

(PDF, PS)

BIBTEX:

           @inproceedings{amast00moor, 
           author = "Moor, Oege de and Gibbons, Jeremy"
           title = "Pointwise relational programming", 
           booktitle = "Algebraic Methodology And Software Technology { (AMAST)}", 
           editor = "Teo Rus", 
           year = "2000",
           series = "Lecture Notes in Computer Science",
           volume = "1816",
           pages = "371-390"} 
           publisher = "Springer"}