Results 1 
2 of
2
Programming with bananas, lenses, envelopes and barbed wire
 In FPCA
, 1991
"... We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example Functions in Bird and Wadler's "Introdu ..."
Abstract

Cited by 299 (11 self)
 Add to MetaCart
We develop a calculus for lazy functional programming based on recursion operators associated with data type definitions. For these operators we derive various algebraic laws that are useful in deriving and manipulating programs. We shall show that all example Functions in Bird and Wadler's "Introduction to Functional Programming " can be expressed using these operators. 1
RALL: Machinesupported Proofs for Relation Algebra
 PROCEEDINGS OF CADE14, LECTURE NOTES IN COMPUTER SCIENCE 1249
, 1997
"... We present a theorem proving system for abstract relation algebra called RALL (= RelationAlgebraic Language and Logic), based on the generic theorem prover Isabelle. On the one hand, the system is an advanced case study for Isabelle/HOL, and on the other hand, a quite mature proof assistant for ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
We present a theorem proving system for abstract relation algebra called RALL (= RelationAlgebraic Language and Logic), based on the generic theorem prover Isabelle. On the one hand, the system is an advanced case study for Isabelle/HOL, and on the other hand, a quite mature proof assistant for research on the relational calculus. RALL is able to deal with the full language of heterogeneous relation algebra including higherorder operators and domain constructions, and checks the typecorrectness of all formulas involved. It offers both an interactive proof facility, with special support for substitutions and estimations, and an experimental automatic prover. The automatic proof method exploits an isomorphism between relationalgebraic and predicatelogical formulas, relying on the classical universalalgebraic concepts of atom structures and complex algebras.