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 298 (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
Denotational Semantics for Unguarded Recursion: The Demonic Case
"... We show that the technique to prove equivalence of operational and denotational cpo based semantics using retractions, as introduced in [BV] for a sequential backtracking language, can be applied to parallel languages as well. We prove equivalence for a uniform language in which procedure calls need ..."
Abstract
 Add to MetaCart
We show that the technique to prove equivalence of operational and denotational cpo based semantics using retractions, as introduced in [BV] for a sequential backtracking language, can be applied to parallel languages as well. We prove equivalence for a uniform language in which procedure calls need not be guarded. The unguardedness is taken care of by giving a semantics in which the nondeterminism is demonic. Section 1 Introduction In [BV]a we have introduced a new idea of proving equivalence of an operational semantics, say O, and a denotational semantics, say D, where both semantics are based on cpo's. The idea is to introduce less abstract variants O and D of the semantical definitions for which the equivalence O = D is easier to establish. The latter proof will be less complicated if O and D can be defined in such a way that for each statement they deliver maximal elements in the cpo of meanings of statements. The equivalence O = D can then be established by sho...