Results 1 
8 of
8
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 &qu ..."
Abstract

Cited by 308 (11 self)
 Add to MetaCart
(Show Context)
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
Problems in the topology of binary digital images
 Open problems in topology
, 1990
"... ..."
(Show Context)
Retractions in Comparing Prolog Semantics
 IN PROC. COMPUTING SCIENCE IN THE NETHERLANDS, PART 1, P.M.G. APERS
, 1989
"... We present an operational model O and a continuation based denotational model D for a uniform variant of Prolog, including the cut operator. The two semantical definitions make use of higher order transformations F and Y, respectively. We prove O and D equivalent in a novel way by comparing yet anot ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
We present an operational model O and a continuation based denotational model D for a uniform variant of Prolog, including the cut operator. The two semantical definitions make use of higher order transformations F and Y, respectively. We prove O and D equivalent in a novel way by comparing yet another pair of higher order transformations F and Y , that yield F and Y, respectively, by application of a suitable abstraction operator.
On Relating Denotational and Operational Semantics for Programming Languages with Recursion and Concurrency, chapter 24
, 1990
"... ..."
(Show Context)
Denotational Semantics for Unguarded Recursion: The Demonic Case
, 1990
"... 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.
Retractions in Comparing Prolog Semantics
, 1990
"... We present an operational model O and a continuation based denotational model D for a uniform variant of Prolog, including the cut operator. The two semantical definitions make use of higher order transformations F and Y, respectively. We prove O and D equivalent in a novel way by comparing yet anot ..."
Abstract
 Add to MetaCart
We present an operational model O and a continuation based denotational model D for a uniform variant of Prolog, including the cut operator. The two semantical definitions make use of higher order transformations F and Y, respectively. We prove O and D equivalent in a novel way by comparing yet another pair of higher order transformations F and Y , that yield F and Y, respectively, by application of a suitable abstraction operator. Section 1 Introduction In [BV] we presented both an operational and a denotational continuation based semantics for the core of Prolog, and we proved these two semantics equivalent. We used a two step approach, by first deriving these results for an intermediate language, obtained by stripping the logic programming aspects (substitutions, most general unifiers and all that) from Prolog. This resulted in the abstract language B in which only the control structure from Prolog remained, such as the backtrack mechanism and the cut operator. After having co...
The logic of action
"... Abstract In this article we provide a brief overview of the logic of action in philosophy, linguistics, computer science and artificial intelligence. The logic of action is the formal study of action in which formal languages are the main tool of analysis. The concept of action is of central interes ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract In this article we provide a brief overview of the logic of action in philosophy, linguistics, computer science and artificial intelligence. The logic of action is the formal study of action in which formal languages are the main tool of analysis. The concept of action is of central interest to many disciplines: the social sciences including economics, the humanities including history and literature, psychology, linguistics, law, computer science, artificial intelligence, and probably others. In philosophy it has been studied since the beginning because of its importance for epistemology and, particularly, ethics; and since a few decades it is even studied for its own sake. But it is in the logic of action that action is studied in the most abstract way. The logic of action began in philosophy. But it has also played a certain role in linguistics. And currently it is of great importance in computer science and artificial intelligence. For our purposes it is natural to separate the accounts of these developments.